Sorry, you need to enable JavaScript to visit this website.
Partager

Publications

 

Les publications de nos enseignants-chercheurs sont sur la plateforme HAL :

 

Les publications des thèses des docteurs du LTCI sont sur la plateforme HAL :

 

Retrouver les publications figurant dans l'archive ouverte HAL par année :

2022

  • (Complex) natural gradient optimization for optical quantum circuit design
    • Yao Yuan
    • Cussenot Pierre
    • Wolf Richard A.
    • Miatto Filippo M.
    Physical Review A, American Physical Society, 2022, 105 (5), pp.052402. Few-mode optical quantum circuits can be simulated and optimized using gradient-descent methods, as optical gates can be parametrized by continuous parameters. However, the parameter space as seen by a nonholomorphic cost function is not Euclidean, which means that the Euclidean gradient does not generally point in the direction of steepest ascent. In order to retrieve the true steepest-ascent direction, one must take into account the local metric in what is known as the natural-gradient (NG) method. In this work we implement the NG for the optimization of optical quantum circuits. Specifically, we adapt the NG approach to a complex-valued parameter space, allowing us to apply the NG method directly within the Bargmann formalism, which we rely on for transforming between phase space and Fock space. We then compare the NG approach to vanilla gradient descent and to Adam over two standard state-preparation benchmarks: a single-photon source and a Gottesman-Kitaev-Preskill state source. We observe that the NG approach converges significantly faster (due in part to the possibility of using larger learning rates) and with a smoother decay of the cost function throughout the optimization. This result further improves our ability to design quantum circuits via classical optimization methods. (10.1103/PhysRevA.105.052402)
    DOI : 10.1103/PhysRevA.105.052402
  • A Quadrature Rule combining Control Variates and Adaptive Importance Sampling
    • Leluc Rémi
    • Portier François
    • Zhuman Aigerim
    • Segers Johan
    Advances in Neural Information Processing Systems, Morgan Kaufmann Publishers, 2022, 35, pp.11842--11853. Driven by several successful applications such as in stochastic gradient descent or in Bayesian computation, control variates have become a major tool for Monte Carlo integration. However, standard methods do not allow the distribution of the particles to evolve during the algorithm, as is the case in sequential simulation methods. Within the standard adaptive importance sampling framework, a simple weighted least squares approach is proposed to improve the procedure with control variates. The procedure takes the form of a quadrature rule with adapted quadrature weights to reflect the information brought in by the control variates. The quadrature points and weights do not depend on the integrand, a computational advantage in case of multiple integrands. Moreover, the target density needs to be known only up to a multiplicative constant. Our main result is a non-asymptotic bound on the probabilistic error of the procedure. The bound proves that for improving the estimate's accuracy, the benefits from adaptive importance sampling and control variates can be combined. The good behavior of the method is illustrated empirically on synthetic examples and real-world data for Bayesian linear regression.
  • High-capacity free-space optical link in the midinfrared thermal atmospheric windows using unipolar quantum devices
    • Didier Pierre
    • Dely Hamza
    • Bonazzi Thomas
    • Spitz Olivier
    • Awwad Elie
    • Rodriguez Etienne
    • Vasanelli Angela
    • Sirtori Carlo
    • Grillot Frédéric
    Advanced photonics, SPIE, 2022, 4 (5), pp.056004. Free-space optical communication is a very promising alternative to fiber communication systems, in terms of ease of deployment and costs. Midinfrared light has several features of utter relevance for free-space applications: low absorption when propagating in the atmosphere even under adverse conditions, robustness of the wavefront during long-distance propagation, and absence of regulations and restrictions for this range of wavelengths. A proof-of-concept of high-speed transmission taking advantage of intersubband devices has recently been demonstrated, but this effort was limited by the short-distance optical path (up to 1 m). In this work, we study the possibility of building a long-range link using unipolar quantum optoelectronics. Two different detectors are used: an uncooled quantum cascade detector and a nitrogen-cooled quantum well-infrared photodetector. We evaluate the maximum data rate of our link in a back-to-back configuration before adding a Herriott cell to increase the length of the light path up to 31 m. By using pulse shaping, pre- and post-processing, we reach a record bitrate of 30 Gbit s − 1 for both two-level (OOK) and four-level (PAM-4) modulation schemes for a 31-m propagation link and a bit error rate compatible with error-correction codes. (10.1117/1.AP.4.5.056004)
    DOI : 10.1117/1.AP.4.5.056004
  • Enhanced four-wave mixing dynamics in epitaxial quantum dot laser on silicon
    • Ding Shihao
    • Dong Bozhang
    • Chow Weng
    • Bowers John
    • Grillot Frédéric
    , 2022, pp.NpTh3D.1. The four-wave mixing conversion efficiency of quantum dot laser is much higher than that of quantum well. These results are important for self-mode-locked pulse production and high-bandwidth optical frequency comb generation. (10.1364/NP.2022.NpTh3D.1)
    DOI : 10.1364/NP.2022.NpTh3D.1
  • Selected Topics in Malliavin Calculus
    • Decreusefond Laurent
    , 2022, 10. (10.1007/978-3-031-01311-9)
    DOI : 10.1007/978-3-031-01311-9
  • Somme et produit, couple star
    • Zayana Karim
    • Rabiet Victor
    CultureMath, ENS, 2022. Relation entre somme et produit de deux nombres. Résolution des équations du second degré sans utiliser le discriminant
  • Direction-Aware Adaptive Online Neural Speech Enhancement with an Augmented Reality Headset in Real Noisy Conversational Environments
    • Sekiguchi Kouhei
    • Nugraha Aditya Arie
    • Du Yicheng
    • Bando Yoshiaki
    • Fontaine Mathieu
    • Yoshii Kazuyoshi
    , 2022. This paper describes the practical response-and performance-aware development of online speech enhancement for an augmented reality (AR) headset that helps a user understand conversations made in real noisy echoic environments (e.g., cocktail party). One may use a state-of-the-art blind source separation method called fast multichannel nonnegative matrix factorization (FastMNMF) that works well in various environments thanks to its unsupervised nature. Its heavy computational cost, however, prevents its application to real-time processing. In contrast, a supervised beamforming method that uses a deep neural network (DNN) for estimating spatial information of speech and noise readily fits real-time processing, but suffers from drastic performance degradation in mismatched conditions. Given such complementary characteristics, we propose a dual-process robust online speech enhancement method based on DNN-based beamforming with FastMNMF-guided adaptation. FastMNMF (back end) is performed in a mini-batch style and the noisy and enhanced speech pairs are used together with the original parallel training data for updating the direction-aware DNN (front end) with backpropagation at a computationally-allowable interval. This method is used with a blind dereverberation method called weighted prediction error (WPE) for transcribing the noisy reverberant speech of a speaker, which can be detected from video or selected by a user's hand gesture or eye gaze, in a streaming manner and spatially showing the transcriptions with an AR technique. Our experiment showed that the word error rate was improved by more than 10 points with the runtime adaptation using only twelve minutes observation.
  • Vibration Detection and Localization in Buried Fiber Cable after 80km of SSMF using Digital Coherent Sensing System with Co-Propagating 600Gb/s WDM Channels
    • Guerrier Sterenn
    • Benyahya Kaoutar
    • Dorize Christian
    • Awwad Elie
    • Mardoyan Haik
    • Renaudier Jérémie
    , 2022, pp.M2F.3. (10.1364/OFC.2022.M2F.3)
    DOI : 10.1364/OFC.2022.M2F.3
  • Free-Space Communication With Directly Modulated Mid-Infrared Quantum Cascade Devices
    • Spitz Olivier
    • Didier Pierre
    • Durupt Lauréline
    • Andrés Díaz-Thomas Daniel
    • Baranov Alexei N
    • Cerutti Laurent
    • Grillot Frédéric
    IEEE Journal of Selected Topics in Quantum Electronics, Institute of Electrical and Electronics Engineers, 2022. This study deals with the communication capabilities of two kinds of semiconductor lasers emitting in one of the atmosphere transparency windows, around 4 µm. One of these two lasers is a quantum cascade laser and the other one is an interband cascade laser. With the quantum cascade laser, a subsequent attenuation is added to the optical path in order to mimic the attenuation of free-space transmission of several kilometers. Direct electrical modulation is used to transmit the message and two-level formats, non-return-to-zero and return-to-zero, are used and compared in terms of maximum transmission data rate. The sensitivity to optical feedback is also analyzed, as well as the evolution of the error rate when reducing the optical power at the level of the detector. This work provides a novel insight into the development of future secure free-space optical communication links based on midinfrared semiconductor lasers and sheds the light on improvements required to achieve multi-Gbits/s communication with off-the-shelf components. Index Terms-Quantum cascade laser, interband cascade laser, mid-infrared photonics, free-space communication. I. INTRODUCTION T HE development of semiconductor laser technology was considerably boosted with inventing quantum cascade lasers (QCLs) in early 90s [1] and interband cascade lasers (ICLs) shortly afterwards [2]. At the early stages of QCLs, free-space optical transmissions were envisioned [3] alongside Manuscript (10.1109/JSTQE.2021.3096316)
    DOI : 10.1109/JSTQE.2021.3096316
  • Conditional and Relevant Common Information
    • Graczyk Robert
    • Lapidoth Amos
    • Wigger Michèle M
    Information and Inference, Oxford University Press (OUP), 2022, 11 (2), pp.679 - 737. Two variations on Wyner's common information are proposed: conditional common information and relevant common information. These are shown to have operational meanings analogous to those of Wyner's common information in appropriately defined distributed problems of compression, simulation and channel synthesis. For relevant common information, an additional operational meaning is identified: on a multiple-access channel with private and common messages, it is the minimal common-message rate that enables communication at the maximum sum-rate under a weak coordination constraint on the inputs and output. En route, the weak-coordination problem over a Gray-Wyner network is solved under the no-excess-rate constraint. (10.1093/imaiai/iaab021)
    DOI : 10.1093/imaiai/iaab021
  • Optimizing Higher-Order Correlation Analysis Against Inner Product Masking Scheme
    • Ming Jingdian
    • Zhou Yongbin
    • Cheng Wei
    • Li Huizhong
    IEEE Transactions on Information Forensics and Security, Institute of Electrical and Electronics Engineers, 2022, 17, pp.3555-3568. (10.1109/TIFS.2022.3209890)
    DOI : 10.1109/TIFS.2022.3209890
  • Variations on a Theme by Massey
    • Rioul Olivier
    IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2022, 68 (5), pp.2813-2828. In 1994, Jim Massey proposed the guessing entropy as a measure of the difficulty that an attacker has to guess a secret used in a cryptographic system, and established a well-known inequality between entropy and guessing entropy. Over 15 years before, in an unpublished work, he also established a well-known inequality for the entropy of an integer-valued random variable of given variance. In this paper, we establish a link between the two works by Massey in the more general framework of the relationship between discrete (absolute) entropy and continuous (differential) entropy. Two approaches are given in which the discrete entropy (or Rényi entropy) of an integer-valued variable can be upper bounded using the differential (Rényi) entropy of some suitably chosen continuous random variable. As an application, lower bounds on guessing entropy and guessing moments are derived in terms of entropy or Rényi entropy (without side information) and conditional entropy or Arimoto conditional entropy (when side information is available) (10.1109/TIT.2022.3141264)
    DOI : 10.1109/TIT.2022.3141264
  • Characterization of the majority matrices of profiles of equivalence relations
    • Hudry Olivier
    , 2022.
  • Participation de l’équipe TGV à DEFT 2022 : Prédiction automatique de notes d’étudiants à des questionnaires en fonction du type de question
    • Gaudray Bouju Vanessa
    • Guettier Margot
    • Lerus Gwennola
    • Guibon Gaël
    • Labeau Matthieu
    • Lefeuvre Luce
    , 2022, pp.23-35. Cet article présente l’approche de l’équipe TGV lors de sa participation à la tâche de base de DEFT 2022, dont l’objectif était de prédire automatiquement les notes obtenues par des étudiants sur la base de leurs réponses à des questionnaires. Notre stratégie s’est focalisée sur la mise au point d’une méthode de classification des questions en fonction du type de réponse qu’elles attendent, de manière à pouvoir mener une approche différenciée pour chaque type. Nos trois runs ont consisté en une approche non différenciée, servant de référence, et deux approches différenciées, la première se basant sur la constitution d’un jeu de caractéristiques et la seconde sur le calcul de TF-IDF et de la fonction de hashage. Notre objectif premier était ainsi de vérifier si des approches dédiées à chaque type de questions sont préférables à une approche globale.
  • Listen to Interpret: Post-hoc Interpretability for Audio Networks with NMF
    • Jayneel Parekh
    • Sanjeel Parekh
    • Pavlo Mozharovskyi
    • Florence d'Alché-Buc
    • Richard Gael
    , 2022. This paper tackles post-hoc interpretability for audio processing networks. Our goal is to interpret decisions of a trained network in terms of high-level audio objects that are also listenable for the end-user. To this end, we propose a novel interpreter design that incorporates non-negative matrix factorization (NMF). In particular, a regularized interpreter module is trained to take hidden layer representations of the targeted network as input and produce time activations of pre-learnt NMF components as intermediate outputs. Our methodology allows us to generate intuitive audio-based interpretations that explicitly enhance parts of the input signal most relevant for a network's decision. We demonstrate our method's applicability on popular benchmarks, including a real-world multi-label classification task.
  • Multiple instance learning on deep features for weakly supervised object detection with extreme domain shifts
    • Gonthier Nicolas
    • Ladjal Saïd
    • Gousseau Yann
    Computer Vision and Image Understanding, Elsevier, 2022, 214. Weakly supervised object detection (WSOD) using only image-level annotations has attracted a growing attention over the past few years. Whereas such task is typically addressed with a domain-specific solution focused on natural images, we show that a simple multiple instance approach applied on pre-trained deep features yields excellent performances on non-photographic datasets, possibly including new classes. The approach does not include any fine-tuning or cross-domain learning and is therefore efficient and possibly applicable to arbitrary datasets and classes. We investigate several flavors of the proposed approach, some including multi-layers perceptron and polyhedral classifiers. Despite its simplicity, our method shows competitive results on a range of publicly available datasets, including paintings (People-Art, IconArt), watercolors, cliparts and comics and allows to quickly learn unseen visual categories. (10.1016/j.cviu.2021.103299)
    DOI : 10.1016/j.cviu.2021.103299
  • Towards Globally Optimized Hybrid Homomorphic Encryption - Featuring the Elisabeth Stream Cipher
    • Cosseron Orel
    • Hoffmann Clément
    • Méaux Pierrick
    • Standaert François-Xavier
    , 2022.
  • From Coherent Systems Technology to Advanced Fiber Sensing for Smart Network Monitoring
    • Dorize Christian
    • Guerrier Sterenn
    • Awwad Elie
    • Mardoyan Haik
    • Renaudier Jeremie
    Journal of Lightwave Technology, Institute of Electrical and Electronics Engineers (IEEE)/Optical Society of America(OSA), 2022, pp.1-10. (10.1109/JLT.2022.3221552)
    DOI : 10.1109/JLT.2022.3221552
  • DNN-FREE LOW-LATENCY ADAPTIVE SPEECH ENHANCEMENT BASED ON FRAME-ONLINE BEAMFORMING POWERED BY BLOCK-ONLINE FASTMNMF
    • Nugraha Aditya Arie
    • Sekiguchi Kouhei
    • Fontaine Mathieu
    • Bando Yoshiaki
    • Yoshii Kazuyoshi
    , 2022. This paper describes a practical dual-process speech enhancement system that adapts environment-sensitive frame-online beamforming (front-end) with help from environment-free block-online source separation (back-end). To use minimum variance distortionless response (MVDR) beamforming, one may train a deep neural network (DNN) that estimates timefrequency masks used for computing the covariance matrices of sources (speech and noise). Backpropagation-based runtime adaptation of the DNN was proposed for dealing with the mismatched training-test conditions. Instead, one may try to directly estimate the source covariance matrices with a state-ofthe-art blind source separation method called fast multichannel non-negative matrix factorization (FastMNMF). In practice, however, neither the DNN nor the FastMNMF can be updated in a frame-online manner due to its computationally-expensive iterative nature. Our DNN-free system leverages the posteriors of the latest source spectrograms given by block-online FastMNMF to derive the current source covariance matrices for frame-online beamforming. The evaluation shows that our frame-online system can quickly respond to scene changes caused by interfering speaker movements and outperformed an existing block-online system with DNN-based beamforming by 5.0 points in terms of the word error rate.
  • PBRE: A Rule Extraction Method from Trained Neural Networks Designed for Smart Home Services
    • Qiu Mingming
    • Najm Elie
    • Sharrock Rémi
    • Traverson Bruno
    , 2022, 13427, pp.158-173. Designing smart home services is a complex task when multiple services with a large number of sensors and actuators are deployed simultaneously. It may rely on knowledge-based or data-driven approaches. The former can use rule-based methods to design services statically, and the latter can use learning methods to discover inhabitants’ preferences dynamically. However, neither of these approaches is entirely satisfactory because rules cannot cover all possible situations that may change, and learning methods may make decisions that are sometimes incomprehensible to the inhabitant. In this paper, PBRE (Pedagogic Based Rule Extractor) is proposed to extract rules from learning methods to realize dynamic rule generation for smart home systems. The expected advantage is that both the explainability of rule-based methods and the dynamicity of learning methods are adopted. We compare PBRE with an existing rule extraction method, and the results show better performance of PBRE. We also apply PBRE to extract rules from a smart home service represented by an NRL (Neural Network-based Reinforcement Learning). The results show that PBRE can help the NRL-simulated service to make understandable suggestions to the inhabitant. (10.1007/978-3-031-12426-6_13)
    DOI : 10.1007/978-3-031-12426-6_13
  • Cybersecurity in Smart Homes: Architectures, Solutions and Technologies
    • Khatoun Rida
    , 2022. Smart homes use Internet-connected devices, artificial intelligence, protocols and numerous technologies to enable people to remotely monitor their home, as well as manage various systems within it via the Internet using a smartphone or a computer. A smart home is programmed to act autonomously to improve comfort levels, save energy and potentially ensure safety; the result is a better way of life. Innovative solutions continue to be developed by researchers and engineers and thus smart home technologies are constantly evolving. By the same token, cybercrime is also becoming more prevalent. Indeed, a smart home system is made up of connected devices that cybercriminals can infiltrate to access private information, commit cyber vandalism or infect devices using botnets. This book addresses cyber attacks such as sniffing, port scanning, address spoofing, session hijacking, ransomware and denial of service. It presents, analyzes and discusses the various aspects of cybersecurity as well as solutions proposed by the research community to counter the risks. Cybersecurity in Smart Homes is intended for people who wish to understand the architectures, protocols and different technologies used in smart homes.
  • Statistical learning from biased training samples
    • Clémençon Stéphan
    • Laforgue Pierre
    Electronic Journal of Statistics, Shaker Heights, OH : Institute of Mathematical Statistics, 2022, 16 (2), pp.6086-6134. With the deluge of digitized information in the Big Data era, massive datasets are becoming increasingly available for learning predictive models. However, in many practical situations, the poor control of the data acquisition processes may naturally jeopardize the outputs of machine learning algorithms, and selection bias issues are now the subject of much attention in the literature. The present article investigates how to extend Empirical Risk Minimization, the principal paradigm in statistical learning, when training observations are generated from biased models, i.e., from distributions that are different from that in the test/prediction stage, and absolutely continuous with respect to the latter. Precisely, we show how to build a “nearly debiased” training statistical population from biased samples and the related biasing functions, following in the footsteps of the approach originally proposed in [46]. Furthermore, we study from a nonasymptotic perspective the performance of minimizers of an empirical version of the risk computed from the statistical population thus created. Remarkably, the learning rate achieved by this procedure is of the same order as that attained in absence of selection bias. Beyond the theoretical guarantees, we also present experimental results supporting the relevance of the algorithmic approach promoted in this paper. (10.1214/22-EJS2084)
    DOI : 10.1214/22-EJS2084
  • Uniform Reliability of Self-Join-Free Conjunctive Queries
    • Amarilli Antoine
    • Kimelfeld Benny
    Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2022. The reliability of a Boolean Conjunctive Query (CQ) over a tuple-independent probabilistic database is the probability that the CQ is satisfied when the tuples of the database are sampled one by one, independently, with their associated probability. For queries without self-joins (repeated relation symbols), the data complexity of this problem is fully characterized by a known dichotomy: reliability can be computed in polynomial time for hierarchical queries, and is #P-hard for non-hierarchical queries. Inspired by this dichotomy, we investigate a fundamental counting problem for CQs without self-joins: how many sets of facts from the input database satisfy the query? This is equivalent to the uniform case of the query reliability problem, where the probability of every tuple is required to be 1/2. Of course, for hierarchical queries, uniform reliability is solvable in polynomial time, like the reliability problem. We show that being hierarchical is also necessary for this tractability (under conventional complexity assumptions). In fact, we establish a generalization of the dichotomy that covers every restricted case of reliability in which the probabilities of tuples are determined by their relation. (10.46298/lmcs-18(4:3)2022)
    DOI : 10.46298/lmcs-18(4:3)2022
  • Lyrics segmentation via bimodal text–audio representation
    • Fell Michael
    • Nechaev Yaroslav
    • Meseguer-Brocal Gabriel
    • Cabrio Elena
    • Gandon Fabien
    • Peeters Geoffroy
    Natural Language Engineering, Cambridge University Press (CUP), 2022, 28 (3), pp.317 - 336. Song lyrics contain repeated patterns that have been proven to facilitate automated lyrics segmentation, with the final goal of detecting the building blocks (e.g., chorus, verse) of a song text. Our contribution in this article is twofold. First, we introduce a convolutional neural network (CNN)-based model that learns to segment the lyrics based on their repetitive text structure. We experiment with novel features to reveal different kinds of repetitions in the lyrics, for instance based on phonetical and syntactical properties. Second, using a novel corpus where the song text is synchronized to the audio of the song, we show that the text and audio modalities capture complementary structure of the lyrics and that combining both is beneficial for lyrics segmentation performance. For the purely text-based lyrics segmentation on a dataset of 103k lyrics, we achieve an F-score of 67.4%, improving on the state of the art (59.2% F-score). On the synchronized text–audio dataset of 4.8k songs, we show that the additional audio features improve segmentation performance to 75.3% F-score, significantly outperforming the purely text-based approaches. (10.1017/S1351324921000024)
    DOI : 10.1017/S1351324921000024
  • Towards Outdoor Electromagnetic Field Exposure Mapping Generation Using Conditional GANs
    • Mallik Mohammed
    • Tesfay Angesom Ataklity
    • Allaert Benjamin
    • Kassi Rédha
    • Egea-Lopez Esteban
    • Molina-Garcia-Pardo Jose-Maria
    • Wiart Joe
    • Gaillot Davy
    • Clavier Laurent
    Sensors, MDPI, 2022, 22 (24), pp.9643. With the ongoing fifth-generation cellular network (5G) deployment, electromagnetic field exposure has become a critical concern. However, measurements are scarce, and accurate electromagnetic field reconstruction in a geographic region remains challenging. This work proposes a conditional generative adversarial network to address this issue. The main objective is to reconstruct the electromagnetic field exposure map accurately according to the environment’s topology from a few sensors located in an outdoor urban environment. The model is trained to learn and estimate the propagation characteristics of the electromagnetic field according to the topology of a given environment. In addition, the conditional generative adversarial network-based electromagnetic field mapping is compared with simple kriging. Results show that the proposed method produces accurate estimates and is a promising solution for exposure map reconstruction. (10.3390/s22249643)
    DOI : 10.3390/s22249643