Near Optimal Memory-Regret Tradeoff for Online Learning

3 March 2023

Papers citing "Near Optimal Memory-Regret Tradeoff for Online Learning"

12 / 12 papers shown

Title
Communication Bounds for the Distributed Experts Problem Zhihao Jia Qi Pang Trung Tran David Woodruff Zhihao Zhang Wenting Zheng 60 0 0 06 Jan 2025
Fine-grained Attention I/O Complexity: Comprehensive Analysis for Backward Passes Xiaoyu Li Yingyu Liang Zhenmei Shi Zhao-quan Song Yufa Zhou 54 15 0 12 Oct 2024
The complexity of approximate (coarse) correlated equilibrium for incomplete information games Binghui Peng Aviad Rubinstein 30 2 0 04 Jun 2024
Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits Yuchen He Zichun Ye Chihao Zhang 25 3 0 30 May 2024
Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems Moise Blanchard 43 1 0 10 Apr 2024
The I/O Complexity of Attention, or How Optimal is Flash Attention? Barna Saha Christopher Ye 26 5 0 12 Feb 2024
The sample complexity of multi-distribution learning Binghui Peng 41 8 0 07 Dec 2023
Memory-Query Tradeoffs for Randomized Convex Optimization Xinyu Chen Binghui Peng 36 6 0 21 Jun 2023
Streaming Algorithms for Learning with Experts: Deterministic Versus Robust David P. Woodruff Fred Zhang Samson Zhou 18 6 0 03 Mar 2023
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games Ioannis Anagnostides C. Daskalakis Gabriele Farina Maxwell Fishelson Noah Golowich T. Sandholm 56 53 0 11 Nov 2021
Smoothed Analysis with Adaptive Adversaries Nika Haghtalab Tim Roughgarden Abhishek Shetty AAML 54 49 0 16 Feb 2021
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