( en | de | ru )

 

Disambiguation of "Sidford, Aaron"

Author of the publication

copydeleteadd this publication to your clipboard
Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss.

, , , and . COLT, volume 134 of Proceedings of Machine Learning Research, page 866-882. PMLR, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Aaron Sidford

Kurt Aaron

Siegfried Aaron

Else Aaron

Aaron Rosmarin

 

Other publications of authors with the same name

Efficient Õ(n/ε) Spectral Sketches for the Laplacian and its Pseudoinverse., and . CoRR, (2017)Semi-Streaming Bipartite Matching in Fewer Passes and Less Space., , and . CoRR, (2020)Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers., and . CoRR, (2020)Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification., , and . CoRR, (2022)Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space., , , , and . SODA, page 627-669. SIAM, (2022)A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions., , , and . SODA, page 3685-3723. SIAM, (2024)Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space., , , and . SIAM J. Comput., 50 (6): 1892-1922 (2021)Efficient Convex Optimization Requires Superlinear Memory., , , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 2390-2430. PMLR, (2022)Solving tall dense linear programs in nearly linear time., , , and . STOC, page 775-788. ACM, (2020)Constant girth approximation for directed graphs in subquadratic time., , , and . STOC, page 1010-1023. ACM, (2020)