Jason M. Altschuler

63 papers A* 9Journal 51Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algorithmic warm starts for Hamiltonian Monte Carlo. CoRR Matthew S. Zhang, Jason M. Altschuler, Sinho Chewi
2026	J	`jnl`	Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm. J. ACM Xufeng Cai, Jason M. Altschuler, Jelena Diakonikolas
2026	J	`jnl`	Shifted Composition II: Shift Harnack Inequalities and Curvature Upper Bounds. IEEE Trans. Inf. Theory Jason M. Altschuler, Sinho Chewi
2025	A*	`conf`	Accelerating Proximal Gradient Descent via Silver Stepsizes. COLT Jinho Bok, Jason M. Altschuler
2025	J	`jnl`	Acceleration by Stepsize Hedging: Multi-Step Descent and the Silver Stepsize Schedule. J. ACM Jason M. Altschuler, Pablo A. Parrilo
2025	J	`jnl`	Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization. Math. Program. Jason M. Altschuler, Pablo A. Parrilo
2025	J	`jnl`	Min-Max Optimization Is Strictly Easier Than Variational Inequalities. CoRR Henry Shugart, Jason M. Altschuler
2025	J	`jnl`	Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm. CoRR Xufeng Cai, Jason M. Altschuler, Jelena Diakonikolas
2025	J	`jnl`	Negative Stepsizes Make Gradient-Descent-Ascent Converge. CoRR Henry Shugart, Jason M. Altschuler
2025	J	`jnl`	Optimized methods for composite optimization: a reduction perspective. CoRR Jinho Bok, Jason M. Altschuler
2025	J	`jnl`	Resolving the Mixing Time of the Langevin Algorithm to Its Stationary Distribution for Log-Concave Sampling. SIAM J. Math. Data Sci. Jason M. Altschuler, Kunal Talwar
2025	J	`jnl`	Shifted Composition I: Harnack and Reverse Transport Inequalities. IEEE Trans. Inf. Theory Jason M. Altschuler, Sinho Chewi
2025	J	`jnl`	Shifted Composition IV: Underdamped Langevin and Numerical Discretizations with Partial Acceleration. CoRR Jason M. Altschuler, Sinho Chewi, Matthew S. Zhang
2024	J	`jnl`	Accelerating Proximal Gradient Descent via Silver Stepsizes. CoRR Jinho Bok, Jason M. Altschuler
2024	J	`jnl`	Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule. CoRR Jason M. Altschuler, Pablo A. Parrilo
2024	J	`jnl`	Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts. J. ACM Jason M. Altschuler, Sinho Chewi
2024	J	`jnl`	On the Privacy of Noisy Stochastic Gradient Descent for Convex Optimization. SIAM J. Comput. Jason M. Altschuler, Jinho Bok, Kunal Talwar
2024	J	`jnl`	Shifted Composition II: Shift Harnack Inequalities and Curvature Upper Bounds. CoRR Jason M. Altschuler, Sinho Chewi
2024	J	`jnl`	Shifted Composition III: Local Error Framework for KL Divergence. CoRR Jason M. Altschuler, Sinho Chewi
2024	A*	`conf`	Shifted Interpolation for Differential Privacy. ICML Jinho Bok, Weijie J. Su, Jason M. Altschuler
2024	J	`jnl`	Shifted Interpolation for Differential Privacy. CoRR Jinho Bok, Weijie Su, Jason M. Altschuler
2023	J	`jnl`	Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule. CoRR Jason M. Altschuler, Pablo A. Parrilo
2023	A*	`conf`	Faster high-accuracy log-concave sampling via algorithmic warm starts. FOCS Jason M. Altschuler, Sinho Chewi
2023	J	`jnl`	Faster high-accuracy log-concave sampling via algorithmic warm starts. CoRR Jason M. Altschuler, Sinho Chewi
2023	J	`jnl`	Kernel Approximation on Algebraic Varieties. SIAM J. Appl. Algebra Geom. Jason M. Altschuler, Pablo A. Parrilo
2023	J	`jnl`	Near-linear convergence of the Random Osborne algorithm for Matrix Balancing. Math. Program. Jason M. Altschuler, Pablo A. Parrilo
2023	J	`jnl`	Polynomial-time algorithms for multimarginal optimal transport problems with structure. Math. Program. Jason M. Altschuler, Enric Boix-Adserà
2023	A*	`conf`	Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling. COLT Jason M. Altschuler, Kunal Talwar
2023	J	`jnl`	Shifted Composition I: Harnack and Reverse Transport Inequalities. CoRR Jason M. Altschuler, Sinho Chewi
2022	J	`jnl`	Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory. SIAM J. Optim. Jason M. Altschuler, Pablo A. Parrilo
2022	J	`jnl`	Asymptotics for Semidiscrete Entropic Optimal Transport. SIAM J. Math. Anal. Jason M. Altschuler, Jonathan Niles-Weed, Austin J. Stromme
2022	J	`jnl`	Concentration of the Langevin Algorithm's Stationary Distribution. CoRR Jason M. Altschuler, Kunal Talwar
2022	J	`jnl`	Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions. CoRR Jason M. Altschuler
2022	A*	`conf`	Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss. NeurIPS Jason M. Altschuler, Kunal Talwar
2022	J	`jnl`	Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss. CoRR Jason M. Altschuler, Kunal Talwar
2022	—	`—`	Transport and Beyond: Efficient Optimization over Probability Distributions Jason M. Altschuler
2022	J	`jnl`	Wasserstein Barycenters Are NP-Hard to Compute. SIAM J. Math. Data Sci. Jason M. Altschuler, Enric Boix-Adserà
2021	A*	`conf`	Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent. NeurIPS Jason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. Stromme
2021	J	`jnl`	Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent. CoRR Jason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. Stromme
2021	J	`jnl`	Hardness results for Multimarginal Optimal Transport problems. Discret. Optim. Jason M. Altschuler, Enric Boix-Adserà
2021	J	`jnl`	Kernel approximation on algebraic varieties. CoRR Jason M. Altschuler, Pablo A. Parrilo
2021	J	`jnl`	Online Learning over a Finite Action Set with Limited Switching. Math. Oper. Res. Jason M. Altschuler, Kunal Talwar
2021	J	`jnl`	Wasserstein barycenters are NP-hard to compute. CoRR Jason M. Altschuler, Enric Boix-Adserà
2021	J	`jnl`	Wasserstein barycenters can be computed in polynomial time in fixed dimension. J. Mach. Learn. Res. Jason M. Altschuler, Enric Boix-Adserà
2020	J	`jnl`	Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory. CoRR Jason M. Altschuler, Pablo A. Parrilo
2020	J	`jnl`	Hardness results for Multimarginal Optimal Transport problems. CoRR Jason M. Altschuler, Enric Boix-Adserà
2020	J	`jnl`	High-precision Wasserstein barycenters in polynomial time. CoRR Jason M. Altschuler, Enric Boix-Adserà
2020	J	`jnl`	Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution. SIAM J. Control. Optim. Jason M. Altschuler, Pablo A. Parrilo
2020	J	`jnl`	Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure. CoRR Jason M. Altschuler, Enric Boix-Adserà
2020	J	`jnl`	Random Osborne: a simple, practical algorithm for Matrix Balancing in near-linear time. CoRR Jason M. Altschuler, Pablo A. Parrilo
2019	J	`jnl`	Best Arm Identification for Contaminated Bandits. J. Mach. Learn. Res. Jason M. Altschuler, Victor-Emmanuel Brunel, Alan Malek
2019	—	`conf`	Lyapunov Exponent of Rank One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution. CDC Jason M. Altschuler, Pablo A. Parrilo
2019	A*	`conf`	Massively scalable Sinkhorn distances via the Nyström method. NeurIPS Jason M. Altschuler, Francis R. Bach, Alessandro Rudi, Jonathan Niles-Weed
2018	J	`jnl`	Approximating the Quadratic Transportation Metric in Near-Linear Time. CoRR Jason M. Altschuler, Francis R. Bach, Alessandro Rudi, Jonathan Weed
2018	J	`jnl`	Best Arm Identification for Contaminated Bandits. CoRR Jason M. Altschuler, Victor-Emmanuel Brunel, Alan Malek
2018	J	`jnl`	Massively scalable Sinkhorn distances via the Nyström method. CoRR Jason M. Altschuler, Francis R. Bach, Alessandro Rudi, Jonathan Weed
2018	A*	`conf`	Online learning over a finite action set with limited switching. COLT Jason M. Altschuler, Kunal Talwar
2018	J	`jnl`	Online learning over a finite action set with limited switching. CoRR Jason M. Altschuler, Kunal Talwar
2017	J	`jnl`	Inclusion of forbidden minors in random representable matroids. Discret. Math. Jason M. Altschuler, Elizabeth Yang
2017	—	`conf`	Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. NIPS Jason M. Altschuler, Jonathan Weed, Philippe Rigollet
2017	J	`jnl`	Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. CoRR Jason M. Altschuler, Jonathan Weed, Philippe Rigollet
2016	A*	`conf`	Greedy Column Subset Selection: New Bounds and Distributed Algorithms. ICML Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam
2016	J	`jnl`	Greedy Column Subset Selection: New Bounds and Distributed Algorithms. CoRR Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam