| Publication | Date of Publication | Type |
|---|
Shifted composition. II: Shift Harnack inequalities and curvature upper bounds
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
On the privacy of noisy stochastic gradient descent for convex optimization
SIAM Journal on Computing | 2024-08-06 | Paper |
| Shifted Composition I: Harnack and Reverse Transport Inequalities | 2023-11-24 | Paper |
| Acceleration by Stepsize Hedging II: Silver Stepsize Schedule for Smooth Convex Optimization | 2023-09-28 | Paper |
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Kernel Approximation on Algebraic Varieties
SIAM Journal on Applied Algebra and Geometry | 2023-04-11 | Paper |
Near-linear convergence of the random Osborne algorithm for matrix balancing
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
| Faster high-accuracy log-concave sampling via algorithmic warm starts | 2023-02-20 | Paper |
| Concentration of the Langevin Algorithm's Stationary Distribution | 2022-12-23 | Paper |
Approximating min-mean-cycle for low-diameter graphs in near-optimal time and memory
SIAM Journal on Optimization | 2022-08-19 | Paper |
Asymptotics for semidiscrete entropic optimal transport
SIAM Journal on Mathematical Analysis | 2022-03-21 | Paper |
Wasserstein Barycenters Are NP-Hard to Compute
SIAM Journal on Mathematics of Data Science | 2022-03-21 | Paper |
Hardness results for multimarginal optimal transport problems
Discrete Optimization | 2022-01-18 | Paper |
scientific article; zbMATH DE number 7370561 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-09 | Paper |
| scientific article; zbMATH DE number 7370561 (Why is no real title available?) | 2021-07-09 | Paper |
Kernel approximation on algebraic varieties
(available as arXiv preprint) | 2021-06-04 | Paper |
Online learning over a finite action set with limited switching
Mathematics of Operations Research | 2021-06-03 | Paper |
Wasserstein barycenters are NP-hard to compute
(available as arXiv preprint) | 2021-01-04 | Paper |
Wasserstein barycenters can be computed in polynomial time in fixed dimension
(available as arXiv preprint) | 2020-06-14 | Paper |
Near-linear convergence of the Random Osborne algorithm for Matrix Balancing
(available as arXiv preprint) | 2020-04-06 | Paper |
Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution
SIAM Journal on Control and Optimization | 2020-02-26 | Paper |
Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution
SIAM Journal on Control and Optimization | 2020-02-26 | Paper |
| Best arm identification for contaminated bandits | 2020-02-07 | Paper |
Best arm identification for contaminated bandits
(available as arXiv preprint) | 2020-02-07 | Paper |
Online learning over a finite action set with limited switching
(available as arXiv preprint) | 2018-03-05 | Paper |
Inclusion of forbidden minors in random representable matroids
Discrete Mathematics | 2017-05-10 | Paper |
Shifted Composition II: Shift Harnack Inequalities and Curvature Upper Bounds
(available as arXiv preprint) | N/A | Paper |
