298 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université de LilleFR364 papers
- Centre National de la Recherche ScientifiqueFR257 papers
- École Centrale de LilleFR212 papers
- Centre de Recherche en InformatiqueFR203 papers
- Université Paris-SaclayFR74 papers
- Institut d'Astrophysique SpatialeFR64 papers
- Sorbonne UniversitéFR59 papers
- Institut de Recherche en Astrophysique et PlanétologieFR58 papers
- Université Paris CitéFR57 papers
- Université Paris Sciences et LettresFR53 papers
- Ludwig-Maximilians-Universität MünchenDE52 papers
- CEA Paris-SaclayFR51 papers
17 papers · 1 filter
Listen and Translate: A Proof of Concept for End-to-End Speech-to-Text Translation
Alexandre Berard, Olivier Pietquin, Christophe Servan +1
This paper proposes a first attempt to build an end-to-end speech-to-text translation system, which does not use source language transcription during learning or decoding. We propo…
Burkholderia genome mining for nonribosomal peptide synthetases reveals a great potential for novel siderophores and lipopeptides synthesis
Qassim Esmaeel, Maude Pupin, Nam Phuong Kieu +7
Burkholderia is an important genus encompassing a variety of species, including pathogenic strains as well as strains that promote plant growth. We have carried out a global strate…
GuessWhat?! Visual object discovery through multi-modal dialogue
Harm de Vries, Florian Strub, Sarath Chandar +3
We introduce GuessWhat?!, a two-player guessing game as a testbed for research on the interplay of computer vision and dialogue systems. The goal of the game is to locate an unknow…
AutoGain: Gain Function Adaptation with Submovement Efficiency Optimization
Byungjoo Lee, Mathieu Nancel, Sunjun Kim +1
A well-designed control-to-display gain function can improve pointing performance with indirect pointing devices like trackpads. However, the design of gain functions is challengin…
The Recycling Gibbs Sampler for Efficient Learning
Luca Martino, Victor Elvira, Gustau Camps-Valls
Monte Carlo methods are essential tools for Bayesian inference. Gibbs sampling is a well-known Markov chain Monte Carlo (MCMC) algorithm, extensively used in signal processing, mac…
On-line detection of qualitative dynamical changes in nonlinear systems: the resting-oscillation case
Ying Tang, Alessio Franci, Romain Postoyan
Motivated by neuroscience applications, we introduce the concept of qualitative detection, that is, the problem of determining on-line the current qualitative dynamical behavior (e…
Organized Complexity: is Big History a Big Computation?
Jean-Paul Delahaye, Clement Vidal
The concept of "logical depth" introduced by Charles H. Bennett (1988) seems to capture, at least partially, the notion of organized complexity, so central in big history. More pre…
Natural Steganography: cover-source switching for better steganography
Patrick Bas
This paper proposes a new steganographic scheme relying on the principle of cover-source switching, the key idea being that the embedding should switch from one cover-source to ano…
Independent Resampling Sequential Monte Carlo Algorithms
Roland Lamberti, Yohan Petetin, François Desbouvries +1
Sequential Monte Carlo algorithms, or Particle Filters, are Bayesian filtering algorithms which propagate in time a discrete and random approximation of the a posteriori distributi…
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
Adrien Boiret, Raphaela Palenta
We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not nece…
On Explore-Then-Commit Strategies
Aurélien Garivier, Emilie Kaufmann, Tor Lattimore
We study the problem of minimising regret in two-armed bandit problems with Gaussian rewards. Our objective is to use this simple setting to illustrate that strategies based on an…
evt_MNIST: A spike based version of traditional MNIST
Mazdak Fatahi, Mahmood Ahmadi, Mahyar Shahsavari +2
Benchmarks and datasets have important role in evaluation of machine learning algorithms and neural network implementations. Traditional dataset for images such as MNIST is applied…
Tractable Lineages on Treelike Instances: Limits and Extensions
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them…
Hybrid Collaborative Filtering with Autoencoders
Florian Strub, Jeremie Mary, Romaric Gaudel
Collaborative Filtering aims at exploiting the feedback of users to provide personalised recommendations. Such algorithms look for latent variables in a large sparse matrix of rati…
Maximin Action Identification: A New Bandit Framework for Games
Aurélien Garivier, Emilie Kaufmann, Wouter Koolen
We study an original problem of pure exploration in a strategic bandit model motivated by Monte Carlo Tree Search. It consists in identifying the best action in a game, when the pl…
Optimal Best Arm Identification with Fixed Confidence
Aurélien Garivier, Emilie Kaufmann
We give a complete characterization of the complexity of best-arm identification in one-parameter bandit problems. We prove a new, tight lower bound on the sample complexity. We pr…
Expansion-maximization-compression algorithm with spherical harmonics for single particle imaging with X-ray lasers
Julien Flamant, Nicolas Le Bihan, Andrew V. Martin +1
In 3D single particle imaging with X-ray free-electron lasers, particle orientation is not recorded during measurement but is instead recovered as a necessary step in the reconstru…