Arun Jambulapati

Victor Reis

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Black-Box k-to-1-PCA Reductions: Theory and Applications.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Testing Causality for High Dimensional Data.

[BibT_eX]

[DOI]

CoRR, 2023

Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Structured Semidefinite Programming for Recovering Structured Preconditioners.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Sparsifying Sums of Norms.

[BibT_eX]

[DOI]

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

ReSQueing Parallel and Private Stochastic Convex Optimization.

[BibT_eX]

[DOI]

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

2022

A Slightly Improved Bound for the KLS Constant.

[BibT_eX]

[DOI]

Yin Tat Lee

Santosh S. Vempala

CoRR, 2022

Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities.

[BibT_eX]

[DOI]

CoRR, 2022

Improved iteration complexities for overconstrained p-norm regression.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Faster maxflow via improved dynamic spectral vertex sparsifiers.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Optimal and Adaptive Monteiro-Svaiter Acceleration.

[BibT_eX]

[DOI]

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

RECAPP: Crafting a More Efficient Catalyst for Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Improved Iteration Complexities for Overconstrained p-Norm Regression.

[BibT_eX]

[DOI]

CoRR, 2021

Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Robust Regression Revisited: Acceleration and Improved Estimation Rates.

[BibT_eX]

[DOI]

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

Stochastic Bias-Reduced Gradient Methods.

[BibT_eX]

[DOI]

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

Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

2020

Positive semidefinite programming: mixed, parallel, and width-independent.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing.

[BibT_eX]

[DOI]

Jerry Li

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Acceleration with a Ball Optimization Oracle.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

A Direct Õ(1/ε) Iteration Parallel Algorithm for Optimal Transport.

[BibT_eX]

[DOI]

CoRR, 2019

Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Amin Saberi

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport.

[BibT_eX]

[DOI]

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

Parallel Reachability in Almost Linear Work and Square Root Depth.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric M-Matrices.

[BibT_eX]

[DOI]

Kirankumar Shiragur

CoRR, 2018

Towards Optimal Running Times for Optimal Transport.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient Õ(n/∊) Spectral Sketches for the Laplacian and its Pseudoinverse.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Efficient Õ(n/ε) Spectral Sketches for the Laplacian and its Pseudoinverse.

[BibT_eX]

[DOI]