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

9 April 2020
Sepehr Assadi
Chen Wang
ArXivPDFHTML

Papers citing "Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits"

5 / 5 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
41
13
0
23 Oct 2024
Optimal Batched Best Arm Identification
Optimal Batched Best Arm Identification
Tianyuan Jin
Yu Yang
Jing Tang
Xiaokui Xiao
Pan Xu
41
3
0
21 Oct 2023
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
Improved Space Bounds for Learning with Experts
Improved Space Bounds for Learning with Experts
Anders Aamand
Justin Y. Chen
Huy Le Nguyen
Sandeep Silwal
40
4
0
02 Mar 2023
Online Prediction in Sub-linear Space
Online Prediction in Sub-linear Space
Binghui Peng
Fred Zhang
23
16
0
16 Jul 2022
1