Memory-Query Tradeoffs for Randomized Convex Optimization

21 June 2023

Papers citing "Memory-Query Tradeoffs for Randomized Convex Optimization"

7 / 7 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 26 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
Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes Moise Blanchard Junhui Zhang P. Jaillet 17 4 0 16 Jun 2023
Near Optimal Memory-Regret Tradeoff for Online Learning Binghui Peng A. Rubinstein CLL 15 10 0 03 Mar 2023
Efficient Convex Optimization Requires Superlinear Memory A. Marsden Vatsal Sharan Aaron Sidford Gregory Valiant 11 14 0 29 Mar 2022
When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning? Gavin Brown Mark Bun Vitaly Feldman Adam D. Smith Kunal Talwar 245 80 0 11 Dec 2020