Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2004.09454
Cited By
v1
v2 (latest)
Collaborative Top Distribution Identifications with Limited Interaction
IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020
20 April 2020
Nikolai Karpov
Qin Zhang
Yuanshuo Zhou
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Collaborative Top Distribution Identifications with Limited Interaction"
21 / 21 papers shown
Robust Batched Bandits
Yunwen Guo
Yunlun Shu
Gongyi Zhuo
Tianyu Wang
129
0
0
04 Oct 2025
Near Optimal Best Arm Identification for Clustered Bandits
Yash
Nikhil Karamchandani
Avishek Ghosh
258
0
0
15 May 2025
The Batch Complexity of Bandit Pure Exploration
Adrienne Tuynman
Rémy Degenne
422
2
0
03 Feb 2025
Breaking the
log
(
1
/
Δ
2
)
\log(1/\Delta_2)
lo
g
(
1/
Δ
2
)
Barrier: Better Batched Best Arm Identification with Adaptive Grids
Tianyuan Jin
Qin Zhang
Dongruo Zhou
280
0
0
29 Jan 2025
Batched Stochastic Bandit for Nondegenerate Functions
IEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2024
Yu Liu
Yunlu Shu
Tianyu Wang
613
2
0
09 May 2024
Optimal Regret Bounds for Collaborative Learning in Bandits
International Conference on Algorithmic Learning Theory (ALT), 2023
Amitis Shidani
Sattar Vakili
250
1
0
15 Dec 2023
Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication
IEEE Conference on Decision and Control (CDC), 2023
William Chang
Yuanhao Lu
335
2
0
10 Nov 2023
Optimal Batched Best Arm Identification
Neural Information Processing Systems (NeurIPS), 2023
Tianyuan Jin
Yu Yang
Jing Tang
Xiaokui Xiao
Pan Xu
315
7
0
21 Oct 2023
Pure Exploration in Asynchronous Federated Bandits
Conference on Uncertainty in Artificial Intelligence (UAI), 2023
Zichen Wang
Chuanhao Li
Chenyu Song
Lianghui Wang
Quanquan Gu
Huazheng Wang
FedML
322
6
0
17 Oct 2023
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
Annual Conference Computational Learning Theory (COLT), 2023
Sepehr Assadi
Chen Wang
365
4
0
06 Sep 2023
Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits
International Conference on Machine Learning (ICML), 2023
Chen Wang
218
8
0
03 Jun 2023
A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization
Yasong Feng
Weijian Luo
Yimin Huang
Tianyu Wang
410
10
0
03 Feb 2023
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits
AAAI Conference on Artificial Intelligence (AAAI), 2023
Nikolai Karpov
Qin Zhang
412
2
0
26 Jan 2023
Federated Best Arm Identification with Heterogeneous Clients
IEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2022
Zhirui Chen
P. Karthik
Vincent Y. F. Tan
Yeow Meng Chee
FedML
353
9
0
14 Oct 2022
Communication-Efficient Collaborative Best Arm Identification
AAAI Conference on Artificial Intelligence (AAAI), 2022
Nikolai Karpov
Qin Zhang
FedML
382
6
0
18 Aug 2022
Parallel Best Arm Identification in Heterogeneous Environments
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022
Nikolai Karpov
Qin Zhang
476
8
0
16 Jul 2022
Near-Optimal Collaborative Learning in Bandits
Neural Information Processing Systems (NeurIPS), 2022
Clémence Réda
Sattar Vakili
E. Kaufmann
FedML
347
23
0
31 May 2022
Collaborative Pure Exploration in Kernel Bandit
International Conference on Learning Representations (ICLR), 2021
Yihan Du
Wei Chen
Yuko Kuroki
Longbo Huang
512
13
0
29 Oct 2021
Lipschitz Bandits with Batched Feedback
Yasong Feng
Zengfeng Huang
Tianyu Wang
475
18
0
19 Oct 2021
Online Learning for Cooperative Multi-Player Multi-Armed Bandits
IEEE Conference on Decision and Control (CDC), 2021
William Chang
Mehdi Jafarnia-Jahromi
Rahul Jain
292
7
0
07 Sep 2021
Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design
Yufei Ruan
Jiaqi Yang
Yuanshuo Zhou
OffRL
490
64
0
04 Jul 2020
1
Page 1 of 1
