Jason M. Altschuler

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 33

Top Topics

Stationary Distribution

Added Advantage

Top Venues

Publications

Jinho Bok, Weijie Su, Jason M. Altschuler
Shifted Interpolation for Differential Privacy. CoRR (2024)
Jason M. Altschuler, Sinho Chewi
Shifted Composition II: Shift Harnack Inequalities and Curvature Upper Bounds. CoRR (2024)
Jason M. Altschuler, Jinho Bok, Kunal Talwar
On the Privacy of Noisy Stochastic Gradient Descent for Convex Optimization. SIAM J. Comput. 53 (4) (2024)
Jason M. Altschuler, Sinho Chewi
Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts. J. ACM 71 (3) (2024)
Jason M. Altschuler, Pablo A. Parrilo
Near-linear convergence of the Random Osborne algorithm for Matrix Balancing. Math. Program. 198 (1) (2023)
Jason M. Altschuler, Sinho Chewi
Faster high-accuracy log-concave sampling via algorithmic warm starts. FOCS (2023)
Jason M. Altschuler, Kunal Talwar
Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling. COLT (2023)
Jason M. Altschuler, Enric Boix-Adserà
Polynomial-time algorithms for multimarginal optimal transport problems with structure. Math. Program. 199 (1) (2023)
Jason M. Altschuler, Pablo A. Parrilo
Kernel Approximation on Algebraic Varieties. SIAM J. Appl. Algebra Geom. 7 (1) (2023)
Jason M. Altschuler, Sinho Chewi
Faster high-accuracy log-concave sampling via algorithmic warm starts. CoRR (2023)
Jason M. Altschuler, Sinho Chewi
Shifted Composition I: Harnack and Reverse Transport Inequalities. CoRR (2023)
Jason M. Altschuler, Pablo A. Parrilo
Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule. CoRR (2023)
Jason M. Altschuler, Kunal Talwar
Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss. NeurIPS (2022)
Jason M. Altschuler, Enric Boix-Adserà
Wasserstein Barycenters Are NP-Hard to Compute. SIAM J. Math. Data Sci. 4 (1) (2022)
Jason M. Altschuler, Pablo A. Parrilo
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory. SIAM J. Optim. 32 (3) (2022)
Jason M. Altschuler, Kunal Talwar
Concentration of the Langevin Algorithm's Stationary Distribution. CoRR (2022)
Jason M. Altschuler, Kunal Talwar
Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss. CoRR (2022)
Jason M. Altschuler, Jonathan Niles-Weed, Austin J. Stromme
Asymptotics for Semidiscrete Entropic Optimal Transport. SIAM J. Math. Anal. 54 (2) (2022)
Jason M. Altschuler
Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions. CoRR (2022)
Jason M. Altschuler, Enric Boix-Adserà
Wasserstein barycenters are NP-hard to compute. CoRR (2021)
Jason M. Altschuler, Enric Boix-Adserà
Hardness results for Multimarginal Optimal Transport problems. Discret. Optim. 42 (2021)
Jason M. Altschuler, Kunal Talwar
Online Learning over a Finite Action Set with Limited Switching. Math. Oper. Res. 46 (1) (2021)
Jason M. Altschuler, Pablo A. Parrilo
Kernel approximation on algebraic varieties. CoRR (2021)
Jason M. Altschuler, Enric Boix-Adserà
Wasserstein barycenters can be computed in polynomial time in fixed dimension. J. Mach. Learn. Res. 22 (2021)
Jason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. Stromme
Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent. CoRR (2021)
Jason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. Stromme
Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent. NeurIPS (2021)
Jason M. Altschuler, Pablo A. Parrilo
Random Osborne: a simple, practical algorithm for Matrix Balancing in near-linear time. CoRR (2020)
Jason M. Altschuler, Pablo A. Parrilo
Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution. SIAM J. Control. Optim. 58 (1) (2020)
Jason M. Altschuler, Pablo A. Parrilo
Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory. CoRR (2020)
Jason M. Altschuler, Enric Boix-Adserà
Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure. CoRR (2020)
Jason M. Altschuler, Enric Boix-Adserà
Hardness results for Multimarginal Optimal Transport problems. CoRR (2020)
Jason M. Altschuler, Enric Boix-Adserà
High-precision Wasserstein barycenters in polynomial time. CoRR (2020)
Jason M. Altschuler, Pablo A. Parrilo
Lyapunov Exponent of Rank One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution. CDC (2019)