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. 2306.07903
  4. Cited By
Tight Memory-Regret Lower Bounds for Streaming Bandits

Tight Memory-Regret Lower Bounds for Streaming Bandits

13 June 2023
Shaoang Li
Lan Zhang
Junhao Wang
Xiang-Yang Li
ArXivPDFHTML

Papers citing "Tight Memory-Regret Lower Bounds for Streaming Bandits"

3 / 3 papers shown
Title
Optimal Streaming Algorithms for Multi-Armed Bandits
Optimal Streaming Algorithms for Multi-Armed Bandits
Tianyuan Jin
Keke Huang
Jing Tang
Xiaokui Xiao
33
13
0
23 Oct 2024
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
22
3
0
06 Sep 2023
Near Optimal Memory-Regret Tradeoff for Online Learning
Near Optimal Memory-Regret Tradeoff for Online Learning
Binghui Peng
A. Rubinstein
CLL
26
10
0
03 Mar 2023
1