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. 1608.06031
  4. Cited By
Towards Instance Optimal Bounds for Best Arm Identification

Towards Instance Optimal Bounds for Best Arm Identification

22 August 2016
Lijie Chen
Jian Li
Mingda Qiao
ArXivPDFHTML

Papers citing "Towards Instance Optimal Bounds for Best Arm Identification"

12 / 12 papers shown
Title
On the Problem of Best Arm Retention
On the Problem of Best Arm Retention
Houshuang Chen
Yuchen He
Chihao Zhang
41
0
0
16 Apr 2025
Optimal Streaming Algorithms for Multi-Armed Bandits
Optimal Streaming Algorithms for Multi-Armed Bandits
Tianyuan Jin
Keke Huang
Jing Tang
Xiaokui Xiao
46
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
51
3
0
21 Oct 2023
Multi-Armed Bandits and Quantum Channel Oracles
Multi-Armed Bandits and Quantum Channel Oracles
Simon Buchholz
Jonas M. Kubler
Bernhard Schölkopf
25
1
0
20 Jan 2023
Parallel Best Arm Identification in Heterogeneous Environments
Parallel Best Arm Identification in Heterogeneous Environments
Nikolai Karpov
Qin Zhang
51
8
0
16 Jul 2022
Mean-based Best Arm Identification in Stochastic Bandits under Reward
  Contamination
Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination
Arpan Mukherjee
A. Tajer
Pin-Yu Chen
Payel Das
AAML
FedML
34
9
0
14 Nov 2021
Collaborative Pure Exploration in Kernel Bandit
Collaborative Pure Exploration in Kernel Bandit
Yihan Du
Wei Chen
Yuko Kuroki
Longbo Huang
47
10
0
29 Oct 2021
Quantum exploration algorithms for multi-armed bandits
Quantum exploration algorithms for multi-armed bandits
Daochen Wang
Xuchen You
Tongyang Li
Andrew M. Childs
38
27
0
14 Jul 2020
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Lijie Chen
Anupam Gupta
Jiacheng Li
Mingda Qiao
Ruosong Wang
24
47
0
04 Jun 2017
Practical Algorithms for Best-K Identification in Multi-Armed Bandits
Practical Algorithms for Best-K Identification in Multi-Armed Bandits
Haotian Jiang
Jian Li
Mingda Qiao
19
14
0
19 May 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
Lijie Chen
Jian Li
Mingda Qiao
18
58
0
13 Feb 2017
Learning the distribution with largest mean: two bandit frameworks
Learning the distribution with largest mean: two bandit frameworks
E. Kaufmann
Aurélien Garivier
30
19
0
31 Jan 2017
1