| Publication | Date of Publication | Type |
|---|
Shifted Composition II: Shift Harnack Inequalities and Curvature Upper Bounds
(available as arXiv preprint) | N/A | Paper |
Sharp dimensional analysis of midpoint methods for Langevin sampling
(available as arXiv preprint) | 2026-10-05 | Paper |
High-accuracy simulation of Picard HMC, part I: Gaussian cloud correction
(available as arXiv preprint) | 2026-09-30 | Paper |
Smoothed Picard Hamiltonian Monte Carlo
(available as arXiv preprint) | 2026-09-07 | Paper |
Stability of the Kim-Milman flow map
Electronic Communications in Probability | 2026-08-28 | Paper |
Uniform-in-N log-Sobolev inequality for the mean-field Langevin dynamics with convex energy
SIAM Journal on Mathematical Analysis | 2026-08-06 | Paper |
Exact simulation of diffusions and improved algorithms for log-concave sampling
(available as arXiv preprint) | 2026-08-05 | Paper |
Algorithms for mean-field variational inference via polyhedral optimization in the Wasserstein space
Foundations of Computational Mathematics | 2026-06-22 | Paper |
Shifted composition. II: Shift Harnack inequalities and curvature upper bounds
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling
(available as arXiv preprint) | 2026-01-01 | Paper |
Stability of the Kim--Milman flow map
(available as arXiv preprint) | 2026-01-01 | Paper |
High-accuracy log-concave sampling with stochastic queries
(available as arXiv preprint) | 2026-01-01 | Paper |
Sampling from Constrained Gibbs Measures: with Applications to High-Dimensional Bayesian Inference
(available as arXiv preprint) | 2026-01-01 | Paper |
Lectures on optimization
(available as arXiv preprint) | 2026-01-01 | Paper |
Near-Lipschitz stability of the Kim--Milman flow map
(available as arXiv preprint) | 2026-01-01 | Paper |
Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler
(available as arXiv preprint) | 2026-01-01 | Paper |
Sharp Gaussian divergence and Bernstein-Markov inequalities
(available as arXiv preprint) | 2026-01-01 | Paper |
Analysis of Langevin Monte Carlo from Poincaré to log-Sobolev
Foundations of Computational Mathematics | 2025-09-02 | Paper |
| Faster high-accuracy log-concave sampling via algorithmic warm starts | 2025-08-15 | Paper |
| Query lower bounds for log-concave sampling | 2025-08-15 | Paper |
Query lower bounds for log-concave sampling
Journal of the ACM | 2025-04-25 | Paper |
Statistical optimal transport. École d'Été de Probabilités de Saint-Flour XLIX -- 2019
Lecture Notes in Mathematics | 2025-03-12 | Paper |
Shifted composition. I: Harnack and reverse transport inequalities
IEEE Transactions on Information Theory | 2025-02-26 | Paper |
| Fisher information lower bounds for sampling | 2025-02-24 | Paper |
| On the complexity of finding stationary points of smooth functions in one dimension | 2025-02-24 | Paper |
Faster high-accuracy log-concave sampling via algorithmic warm starts
Journal of the ACM | 2025-02-06 | Paper |
| The entropic barrier is n-self-concordant | 2024-09-20 | Paper |
An entropic generalization of Caffarelli's contraction theorem via covariance inequalities
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2024-03-01 | Paper |
Uniform-in-N log-Sobolev inequality for the mean-field Langevin dynamics with convex energy
(available as arXiv preprint) | 2024-01-01 | Paper |
The ballistic limit of the log-Sobolev constant equals the Polyak-Łojasiewicz constant
(available as arXiv preprint) | 2024-01-01 | Paper |
| Shifted Composition I: Harnack and Reverse Transport Inequalities | 2023-11-24 | Paper |
| Faster high-accuracy log-concave sampling via algorithmic warm starts | 2023-02-20 | Paper |
Gaussian discrepancy: a probabilistic relaxation of vector balancing
Discrete Applied Mathematics | 2022-10-13 | Paper |
| On the complexity of finding stationary points of smooth functions in one dimension | 2022-09-15 | Paper |
Dimension-free log-Sobolev inequalities for mixture distributions
Journal of Functional Analysis | 2021-10-22 | Paper |
| Gradient descent algorithms for Bures-Wasserstein barycenters | 2020-01-06 | Paper |
Gradient descent algorithms for Bures-Wasserstein barycenters
(available as arXiv preprint) | 2020-01-01 | Paper |
A combinatorial proof of a formula of Biane and Chapuy
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A combinatorial proof of a formula of Biane and Chapuy
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
