ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2204.09837
  4. Cited By
Memory Bounds for the Experts Problem

Memory Bounds for the Experts Problem

21 April 2022
Vaidehi Srinivas
David P. Woodruff
Ziyu Xu
Samson Zhou
ArXiv (abs)PDFHTML

Papers citing "Memory Bounds for the Experts Problem"

16 / 16 papers shown
Title
Communication Bounds for the Distributed Experts Problem
Zhihao Jia
Qi Pang
Trung Tran
David Woodruff
Zhihao Zhang
Wenting Zheng
99
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
94
18
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
94
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 Problems
Moise Blanchard
116
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
58
5
0
12 Feb 2024
Robust Learning for Smoothed Online Convex Optimization with Feedback
  Delay
Robust Learning for Smoothed Online Convex Optimization with Feedback Delay
Pengfei Li
Jianyi Yang
Adam Wierman
Shaolei Ren
74
4
0
31 Oct 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 Bandits
Sepehr Assadi
Chen Wang
70
3
0
06 Sep 2023
Memory-Query Tradeoffs for Randomized Convex Optimization
Memory-Query Tradeoffs for Randomized Convex Optimization
Xinyu Chen
Binghui Peng
94
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
96
2
0
13 Jun 2023
Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits
Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits
Chen Wang
55
5
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
53
6
0
03 Mar 2023
Near Optimal Memory-Regret Tradeoff for Online Learning
Near Optimal Memory-Regret Tradeoff for Online Learning
Binghui Peng
A. Rubinstein
CLL
79
10
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
71
4
0
02 Mar 2023
Online Prediction in Sub-linear Space
Online Prediction in Sub-linear Space
Binghui Peng
Fred Zhang
73
16
0
16 Jul 2022
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits
Arpit Agarwal
S. Khanna
Prathamesh Patil
135
11
0
02 May 2022
Memory Bounds for Continual Learning
Memory Bounds for Continual Learning
Xi Chen
Christos H. Papadimitriou
Binghui Peng
CLLLRM
74
24
0
22 Apr 2022
1