Lower Bounds for Parallel and Randomized Convex Optimization

5 November 2018

Papers citing "Lower Bounds for Parallel and Randomized Convex Optimization"

9 / 9 papers shown

Title
Memory-Query Tradeoffs for Randomized Convex Optimization X. Chen Binghui Peng 34 6 0 21 Jun 2023
Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression Yutong He Xinmeng Huang Yiming Chen W. Yin Kun Yuan 28 7 0 12 May 2023
ReSQueing Parallel and Private Stochastic Convex Optimization Y. Carmon A. Jambulapati Yujia Jin Y. Lee Daogao Liu Aaron Sidford Kevin Tian FedML 12 12 0 01 Jan 2023
Efficient Convex Optimization Requires Superlinear Memory A. Marsden Vatsal Sharan Aaron Sidford Gregory Valiant 24 14 0 29 Mar 2022
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness A. Garg Robin Kothari Praneeth Netrapalli Suhail Sherif 14 13 0 02 Dec 2021
Stochastic Bias-Reduced Gradient Methods Hilal Asi Y. Carmon A. Jambulapati Yujia Jin Aaron Sidford 14 29 0 17 Jun 2021
Lower Bounds and Optimal Algorithms for Personalized Federated Learning Filip Hanzely Slavomír Hanzely Samuel Horváth Peter Richtárik FedML 36 186 0 05 Oct 2020
Optimal Complexity in Decentralized Training Yucheng Lu Christopher De Sa 25 71 0 15 Jun 2020
Complexity of Highly Parallel Non-Smooth Convex Optimization Sébastien Bubeck Qijia Jiang Y. Lee Yuanzhi Li Aaron Sidford 17 55 0 25 Jun 2019