World's Best Scientists 2026 revealed!
Award Badge
Mathematics
UAE
2026
Award Badge
Computer Science
France
2025

D-Index & Metrics

Computer Science

D-Index
67
Citations
31795
World Ranking
2141
National Ranking
16

Mathematics

D-Index
67
Citations
29720
World Ranking
327
National Ranking
2

Research.com Recognitions

  • 2026 - Research.com Mathematics in United Arab Emirates Leader Award
  • 2025 - Research.com Computer Science in France Leader Award
  • 2022 - Research.com Computer Science in France Leader Award

Overview

Eric Moulines is affiliated with École Polytechnique in France. Their research spans the fields of Computer Science and Mathematics, with significant contributions across subfields including Artificial Intelligence, Statistics and Probability, Control and Systems Engineering, Management Science and Operations Research, and Computational Mechanics.

Their recent publications reflect a focus on stochastic processes, optimization, and machine learning methodologies. Notable papers include:

  • On Stochastic Gradient Langevin Dynamics with Dependent Data Streams: The Fully Nonconvex Case, 2021, SIAM Journal on Mathematics of Data Science
  • On stochastic gradient Langevin dynamics with dependent data streams in the logconcave case, 2020, Bernoulli
  • A machine learning-based methodology for multi-parametric solution of chemical processes operation optimization under uncertainty, 2021, Chemical Engineering Journal
  • Finite Time Analysis of Linear Two-timescale Stochastic Approximation with Markovian Noise, 2020, arXiv (Cornell University)
  • Variance reduction for Markov chains with application to MCMC, 2020, Statistics and Computing

Their work addresses topics such as Markov Chains and Monte Carlo Methods, Stochastic Gradient Optimization Techniques, Statistical Methods and Inference, Gaussian Processes and Bayesian Inference, Sparse and Compressive Sensing Techniques, Advanced Bandit Algorithms Research, and Bayesian Methods and Mixture Models.

Frequent coauthors in their collaborations include:

  • Alain Durmus
  • Alexey Naumov
  • Denis Belomestny
  • Daniil Tiapkin
  • Sergey Samsonov

Their research is published in venues such as:

  • arXiv (Cornell University)
  • Statistics and Computing
  • Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences
  • Computers & Chemical Engineering
  • HAL (Le Centre pour la Communication Scientifique Directe)

Eric Moulines has also authored a book titled Foundations of Modern Statistics, published by Springer International Publishing in 2023.

Best Publications

  • Subspace methods for the blind identification of multichannel FIR filters

    E. Moulines;P. Duhamel;J.-F. Cardoso;S. Mayrargue

  • A blind source separation technique using second-order statistics

    A. Belouchrani;K. Abed-Meraim;J.-F. Cardoso;E. Moulines

  • Inference in Hidden Markov Models

    Olivier Capp;Eric Moulines;Tobias Ryden

  • Pitch-synchronous waveform processing techniques for text-to-speech synthesis using diphones

    Eric Moulines;Francis Charpentier

  • Continuous probabilistic transform for voice conversion

    Y. Stylianou;O. Cappe;E. Moulines

  • An Overview of Existing Methods and Recent Advances in Sequential Monte Carlo

    O. Cappe;S.J. Godsill;E. Moulines

  • Convergence of a stochastic approximation version of the EM algorithm

    Bernard Delyon;Marc Lavielle;Eric Moulines

  • Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning

    Eric Moulines;Francis R. Bach

  • On‐line expectation–maximization algorithm for latent data models

    Olivier Cappé;Eric Moulines

  • Voice transformation using PSOLA technique

    H. Valbret;E. Moulines;J. P. Tubach

  • Non-parametric techniques for pitch-scale and time-scale modification of speech

    Eric Moulines;Jean Laroche

  • On upper-confidence bound policies for switching bandit problems

    Aurélien Garivier;Eric Moulines

  • Inference in Hidden Markov Models (Springer Series in Statistics)

    Olivier Cappé;Eric Moulines;Tobias Ryden

  • Limit theorems for weighted samples with applications to sequential Monte Carlo methods

    Randal Douc;Eric Moulines

  • A subspace algorithm for certain blind identification problems

    K. Abed-Meraim;P. Loubaton;E. Moulines

  • Least-squares Estimation of an Unknown Number of Shifts in a Time Series

    Marc Lavielle;Eric Moulines

  • On the ergodicity properties of some adaptive MCMC algorithms

    Christophe Andrieu;Éric Moulines

  • Prediction error method for second-order blind identification

    K. Abed-Meraim;E. Moulines;P. Loubaton

  • Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)

    Francis Bach;Eric Moulines

  • Asymptotic properties of the maximum likelihood estimator in autoregressive models with Markov regime

    Randal Douc;Éric Moulines;Tobias Rydén

  • Comparison of Resampling Schemes for Particle Filtering

    Randal Douc;Olivier Cappé;Eric Moulines

  • Pitch synchronous waveform processing techniques for text-to-speech synthesis using diphones

    Francis Charpentier;Eric Moulines

  • Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm

    Alain Durmus;Eric Moulines

  • Inference in Hid-den Markov Models

    Olivier Cappe;Eric Moulines;Tobias Ryden

Frequent Co-Authors

Olivier Cappé
Olivier Cappé PSL University
Philippe Loubaton
Philippe Loubaton Université Paris Cité
Murad S. Taqqu
Murad S. Taqqu Boston University
Anna Scaglione
Anna Scaglione Cornell University
Francis Bach
Francis Bach École Normale Supérieure
Pierre Duhamel
Pierre Duhamel CentraleSupélec
Yannis Stylianou
Yannis Stylianou University of Crete
Karim Abed-Meraim
Karim Abed-Meraim University of Orléans
Christophe Andrieu
Christophe Andrieu University of Bristol
Joe Wiart
Joe Wiart Institut Mines-Télécom

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA opens doors to various online educational pathways that can complement or expand your skill set. For those considering graduate studies, exploring transfer credits for online MBA programs can save time and resources, making it easier to integrate prior learning into advanced business education.

With data-driven decision-making becoming central across industries, many math graduates find value in specializing through a best masters in data analytics programs. These degrees build on mathematical foundations and prepare students for lucrative roles in analytics and data science.

For those weighing business degree options, understanding what MBA programs can I get into is crucial. This knowledge helps tailor applications to programs that match your qualifications and career goals.

Additionally, if flexibility and a streamlined admission process are priorities, exploring the easiest online MBA programs to get into can be beneficial. These programs often offer convenient pacing and support, ideal for working professionals transitioning from math-focused roles to management.

Best Scientists Citing Eric Moulines

Trending Scientists

Recently Published Articles