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. 2205.00984
  4. Cited By
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits

A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits

2 May 2022
Arpit Agarwal
S. Khanna
Prathamesh Patil
ArXiv (abs)PDFHTML

Papers citing "A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits"

4 / 4 papers shown
Title
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
98
2
0
13 Jun 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
Online Prediction in Sub-linear Space
Online Prediction in Sub-linear Space
Binghui Peng
Fred Zhang
79
16
0
16 Jul 2022
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing,
  Noisy Comparisons, and Multi-Armed Bandits
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
Sepehr Assadi
Chen Wang
105
17
0
09 Apr 2020
1