Jason M. Altschuler

CoRR, 2024

Shifted Composition II: Shift Harnack Inequalities and Curvature Upper Bounds.

[BibT_eX]

[DOI]

Sinho Chewi

CoRR, 2024

2023

Polynomial-time algorithms for multimarginal optimal transport problems with structure.

[BibT_eX]

[DOI]

Math. Program., May, 2023

Kernel Approximation on Algebraic Varieties.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., March, 2023

Near-linear convergence of the Random Osborne algorithm for Matrix Balancing.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Shifted Composition I: Harnack and Reverse Transport Inequalities.

[BibT_eX]

[DOI]

Sinho Chewi

CoRR, 2023

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule.

[BibT_eX]

[DOI]

CoRR, 2023

Faster high-accuracy log-concave sampling via algorithmic warm starts.

[BibT_eX]

[DOI]

Sinho Chewi

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory.

[BibT_eX]

[DOI]

SIAM J. Optim., September, 2022

Wasserstein Barycenters Are NP-Hard to Compute.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., 2022

Asymptotics for Semidiscrete Entropic Optimal Transport.

[BibT_eX]

[DOI]

Jonathan Niles-Weed

Austin J. Stromme

SIAM J. Math. Anal., 2022

Concentration of the Langevin Algorithm's Stationary Distribution.

[BibT_eX]

[DOI]

CoRR, 2022

Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions.

[BibT_eX]

[DOI]

CoRR, 2022

Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Online Learning over a Finite Action Set with Limited Switching.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Wasserstein barycenters can be computed in polynomial time in fixed dimension.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

Hardness results for Multimarginal Optimal Transport problems.

[BibT_eX]

[DOI]

Discret. Optim., 2021

Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2020

High-precision Wasserstein barycenters in polynomial time.

[BibT_eX]

[DOI]

CoRR, 2020

Random Osborne: a simple, practical algorithm for Matrix Balancing in near-linear time.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Best Arm Identification for Contaminated Bandits.

[BibT_eX]

[DOI]

Victor-Emmanuel Brunel

Alan Malek

J. Mach. Learn. Res., 2019

Massively scalable Sinkhorn distances via the Nyström method.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Approximating the Quadratic Transportation Metric in Near-Linear Time.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Inclusion of forbidden minors in random representable matroids.

[BibT_eX]

[DOI]

Elizabeth Yang

Discret. Math., 2017

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration.

[BibT_eX]

[DOI]