ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2207.07974
  4. Cited By
Online Prediction in Sub-linear Space
v1v2 (latest)

Online Prediction in Sub-linear Space

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
16 July 2022
Binghui Peng
Fred Zhang
ArXiv (abs)PDFHTML

Papers citing "Online Prediction in Sub-linear Space"

15 / 15 papers shown
Title
Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
Weiyuan Gong
Tongyang Li
Xinzhao Wang
Zhiyu Zhang
96
0
0
10 Sep 2025
Communication Bounds for the Distributed Experts ProblemNeural Information Processing Systems (NeurIPS), 2025
Zhihao Jia
Qi Pang
Trung Tran
David Woodruff
Zhihao Zhang
Wenting Zheng
197
0
0
06 Jan 2025
Fine-grained Attention I/O Complexity: Comprehensive Analysis for
  Backward Passes
Fine-grained Attention I/O Complexity: Comprehensive Analysis for Backward Passes
Xiaoyu Li
Yingyu Liang
Zhenmei Shi
Zhao Song
Yufa Zhou
219
19
0
12 Oct 2024
Understanding Memory-Regret Trade-Off for Streaming Stochastic
  Multi-Armed Bandits
Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
Yuchen He
Zichun Ye
Chihao Zhang
269
3
0
30 May 2024
Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory
  Tradeoff for Feasibility Problems
Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility ProblemsIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2024
Moise Blanchard
212
1
0
10 Apr 2024
The I/O Complexity of Attention, or How Optimal is Flash Attention?
The I/O Complexity of Attention, or How Optimal is Flash Attention?
Barna Saha
Christopher Ye
131
5
0
12 Feb 2024
The sample complexity of multi-distribution learning
The sample complexity of multi-distribution learning
Binghui Peng
305
11
0
07 Dec 2023
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for
  Pure Exploration in Multi-armed Bandits
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed BanditsAnnual Conference Computational Learning Theory (COLT), 2023
Sepehr Assadi
Chen Wang
197
3
0
06 Sep 2023
Memory-Query Tradeoffs for Randomized Convex Optimization
Memory-Query Tradeoffs for Randomized Convex OptimizationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023
Xinyu Chen
Binghui Peng
180
7
0
21 Jun 2023
Tight Memory-Regret Lower Bounds for Streaming Bandits
Tight Memory-Regret Lower Bounds for Streaming Bandits
Shaoang Li
Lan Zhang
Junhao Wang
Xiang-Yang Li
185
3
0
13 Jun 2023
Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits
Tight Regret Bounds for Single-pass Streaming Multi-armed BanditsInternational Conference on Machine Learning (ICML), 2023
Chen Wang
147
6
0
03 Jun 2023
Streaming Algorithms for Learning with Experts: Deterministic Versus
  Robust
Streaming Algorithms for Learning with Experts: Deterministic Versus Robust
David P. Woodruff
Fred Zhang
Samson Zhou
127
6
0
03 Mar 2023
Near Optimal Memory-Regret Tradeoff for Online Learning
Near Optimal Memory-Regret Tradeoff for Online LearningIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023
Binghui Peng
A. Rubinstein
CLL
225
11
0
03 Mar 2023
Improved Space Bounds for Learning with Experts
Improved Space Bounds for Learning with Experts
Anders Aamand
Justin Y. Chen
Huy Le Nguyen
Sandeep Silwal
168
4
0
02 Mar 2023
Memory Bounds for Continual Learning
Memory Bounds for Continual LearningIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2022
Xi Chen
Christos H. Papadimitriou
Binghui Peng
CLLLRM
145
25
0
22 Apr 2022
1