9:30-10:15 Welcome
10:20-11:10 Pierre Monmarché
Non-asymptotic analysis of HMC and Langevin diffusion for MCMC
11:10 -12:00 André Belotto
A general system of differential equations to model first order adaptative algorithms: Application to Adam
Lunch at Foyer Darwin map here
14:00-14:50 Alain Durmus
Non-equilibrium sampling
14:50-15:40 Joris Bierkens
Piecewise deterministic Monte Carlo in infinite dimensions
Coffee break
16:10-17:00 Elsa Cazelle
A novel notion of barycenter for probability distributions based on optimal weak mass transport
17:00-17:50 Jean-François Jabir
Penalization methods for diffusion processes with weak constraints
09:00-9:50 Sébastien Gadat
Stochastic Gauss-Newton algorithm for optimal transport
9:50-10:40 Lukasz Szpruch
Mean-field perspective on training neural networks - Part 1 (lecture)
Coffee break
11:10-12:00 Claire Boyer
Is interpolation benign in random forests?
Lunch at Foyer Darwin map here
14:00-14:50 Manon Michel
Computational complexity reduction by factorization in MCMC
14:50-15:40 Gabriel Peyré
Computational optimal transport - Part 1 (lecture)
Coffee break
16:10-17:00 Teddy Furon
Robustness and Security in Machine Learning: the example of image classification
17:00-17:50 Raphael Pinot
Demystifying byzantine robust machine learning
19:45 Dinner at La Réserve map here
09:00-9:50 Gabriel Peyré
Computational optimal transport - Part 2 (lecture)
9:50-10:40 Lukasz Szpruch
Mean-field perspective on training neural networks - Part 2 (lecture)
Coffee break
11:10-12:00 Clarisse Poon
Smooth bilevel programming for sparse regularization
Lunch at Foyer Darwin map here