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. 2309.03145
  4. Cited By
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

6 September 2023
Sepehr Assadi
Chen Wang
ArXivPDFHTML

Papers citing "The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits"

4 / 4 papers shown
Title
Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
Zichun Ye
Chihao Zhang
Jiahao Zhao
37
1
0
04 Mar 2025
Optimal Streaming Algorithms for Multi-Armed Bandits
Optimal Streaming Algorithms for Multi-Armed Bandits
Tianyuan Jin
Keke Huang
Jing Tang
Xiaokui Xiao
38
13
0
23 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
30
3
0
30 May 2024
Near Optimal Memory-Regret Tradeoff for Online Learning
Near Optimal Memory-Regret Tradeoff for Online Learning
Binghui Peng
A. Rubinstein
CLL
34
10
0
03 Mar 2023
1