no code implementations • 29 Mar 2024 • Jérémie Bigot, Issa-Mbenard Dabo, Camille Male
We also investigate the similarities and differences that exist with the standard setting of independent and identically distributed data.
no code implementations • 2 Feb 2023 • Bernard Bercu, Jérémie Bigot, Gauthier Thurin
We introduce a new stochastic algorithm for solving entropic optimal transport (EOT) between two absolutely continuous probability measures $\mu$ and $\nu$.
no code implementations • 13 Oct 2022 • Jérémie Bigot, Paul Freulon, Boris P. Hejblum, Arthur Leclaire
This paper is focused on the study of entropic regularization in optimal transport as a smoothing method for Wasserstein estimators, through the prism of the classical tradeoff between approximation and estimation errors in statistics.
no code implementations • 16 Jul 2021 • Yiye Jiang, Jérémie Bigot, Sofian Maabout
Therefore, we augment the proposed AR models by incorporating trend as extra parameter, and then adapt the online algorithms to the augmented data models, which allow us to simultaneously learn the graph and trend from streaming samples.
no code implementations • 24 Apr 2020 • Yiye Jiang, Jérémie Bigot, Sofian Maabout
This paper is concerned by the problem of selecting an optimal sampling set of sensors over a network of time series for the purpose of signal recovery at non-observed sensors with a minimal reconstruction error.
no code implementations • 4 Jun 2019 • Louis Capitaine, Jérémie Bigot, Rodolphe Thiébaut, Robin Genuer
Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle high-dimensional data.