Efficient Convex Optimization Requires Superlinear Memory

Efficient Convex Optimization Requires Superlinear Memory

29 March 2022

Gregory Valiant

Papers citing "Efficient Convex Optimization Requires Superlinear Memory"

13 / 13 papers shown

Title
Fine-grained Attention I/O Complexity: Comprehensive Analysis for Backward Passes Xiaoyu Li Yingyu Liang Zhenmei Shi Zhao-quan Song Yufa Zhou 52 15 0 12 Oct 2024
Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems Moise Blanchard 28 1 0 10 Apr 2024
The I/O Complexity of Attention, or How Optimal is Flash Attention? Barna Saha Christopher Ye 19 5 0 12 Feb 2024
Tight Time-Space Lower Bounds for Constant-Pass Learning Xin Lyu Avishay Tal Hongxun Wu Junzhao Yang 19 1 0 12 Oct 2023
Memory-Query Tradeoffs for Randomized Convex Optimization X. Chen Binghui Peng 29 6 0 21 Jun 2023
Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes Moise Blanchard Junhui Zhang P. Jaillet 19 4 0 16 Jun 2023
Tight Memory-Regret Lower Bounds for Streaming Bandits Shaoang Li Lan Zhang Junhao Wang Xiang-Yang Li 14 2 0 13 Jun 2023
Near Optimal Memory-Regret Tradeoff for Online Learning Binghui Peng A. Rubinstein CLL 18 10 0 03 Mar 2023
Improved Space Bounds for Learning with Experts Anders Aamand Justin Y. Chen Huy Le Nguyen Sandeep Silwal 18 4 0 02 Mar 2023
Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal Moise Blanchard Junhui Zhang P. Jaillet 11 5 0 09 Feb 2023
Online Prediction in Sub-linear Space Binghui Peng Fred Zhang 18 16 0 16 Jul 2022
Strong Memory Lower Bounds for Learning Natural Models Gavin Brown Mark Bun Adam D. Smith 32 12 0 09 Jun 2022
Memory Bounds for Continual Learning Xi Chen Christos H. Papadimitriou Binghui Peng CLL LRM 20 22 0 22 Apr 2022