Memory-Query Tradeoffs for Randomized Convex Optimization

21 June 2023

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

11 / 11 papers shown

Title
Near Optimal Memory-Regret Tradeoff for Online Learning Binghui Peng A. Rubinstein CLL 60 10 0 03 Mar 2023
Online Prediction in Sub-linear Space Binghui Peng Fred Zhang 64 16 0 16 Jul 2022
Strong Memory Lower Bounds for Learning Natural Models Gavin Brown Mark Bun Adam D. Smith 64 12 0 09 Jun 2022
Memory Bounds for the Experts Problem Vaidehi Srinivas David P. Woodruff Ziyu Xu Samson Zhou 25 19 0 21 Apr 2022
When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning? Gavin Brown Mark Bun Vitaly Feldman Adam D. Smith Kunal Talwar 292 99 0 11 Dec 2020
An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications Haotian Jiang Y. Lee Zhao Song Sam Chiu-wai Wong 53 106 0 08 Apr 2020
The gradient complexity of linear regression M. Braverman Elad Hazan Max Simchowitz Blake E. Woodworth 32 24 0 06 Nov 2019
Lower Bounds for Parallel and Randomized Convex Optimization Jelena Diakonikolas Cristóbal Guzmán 63 44 0 05 Nov 2018
Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization Eric Balkanski Yaron Singer 42 31 0 12 Aug 2018
Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality M. Braverman A. Garg Tengyu Ma Huy Le Nguyen David P. Woodruff FedML 50 175 0 24 Jun 2015
Randomized Smoothing for Stochastic Optimization John C. Duchi Peter L. Bartlett Martin J. Wainwright 102 287 0 22 Mar 2011