Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal

9 February 2023

Papers citing "Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal"

4 / 4 papers shown

Title
Memory-Query Tradeoffs for Randomized Convex Optimization Xinyu Chen Binghui Peng 36 6 0 21 Jun 2023
Near Optimal Memory-Regret Tradeoff for Online Learning Binghui Peng A. Rubinstein CLL 28 10 0 03 Mar 2023
Efficient Convex Optimization Requires Superlinear Memory A. Marsden Vatsal Sharan Aaron Sidford Gregory Valiant 29 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 253 93 0 11 Dec 2020