Picture for Sébastien Gadat

Sébastien Gadat

TSE

FastPart: Over-Parameterized Stochastic Gradient Descent for Sparse optimisation on Measures

Add code
Dec 10, 2023
Viaarxiv icon

Stochastic Langevin Monte Carlo for (weakly) log-concave posterior distributions

Add code
Jan 08, 2023
Viaarxiv icon

Asymptotic study of stochastic adaptive algorithm in non-convex landscape

Add code
Dec 14, 2020
Figure 1 for Asymptotic study of stochastic adaptive algorithm in non-convex landscape
Viaarxiv icon

On the cost of Bayesian posterior mean strategy for log-concave models

Add code
Oct 08, 2020
Figure 1 for On the cost of Bayesian posterior mean strategy for log-concave models
Viaarxiv icon

Sparse Regularization for Mixture Problems

Add code
Jul 23, 2019
Figure 1 for Sparse Regularization for Mixture Problems
Viaarxiv icon

Stochastic Heavy Ball

Add code
Oct 21, 2016
Figure 1 for Stochastic Heavy Ball
Figure 2 for Stochastic Heavy Ball
Figure 3 for Stochastic Heavy Ball
Viaarxiv icon

Regret bounds for Narendra-Shapiro bandit algorithms

Add code
Jan 16, 2016
Figure 1 for Regret bounds for Narendra-Shapiro bandit algorithms
Figure 2 for Regret bounds for Narendra-Shapiro bandit algorithms
Figure 3 for Regret bounds for Narendra-Shapiro bandit algorithms
Figure 4 for Regret bounds for Narendra-Shapiro bandit algorithms
Viaarxiv icon

Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions

Add code
Nov 05, 2014
Figure 1 for Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions
Figure 2 for Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions
Figure 3 for Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions
Figure 4 for Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions
Viaarxiv icon