{"total":21,"rows":[{"id":"2110.09722","title":"Lipschitz Bandits with Batched Feedback","created":"2021-10-19","cited_by_count":21,"area":null},{"id":"2206.00121","title":"Near-Optimal Collaborative Learning in Bandits","created":"2022-05-31","cited_by_count":18,"area":null},{"id":"2110.15771","title":"Collaborative Pure Exploration in Kernel Bandit","created":"2021-10-29","cited_by_count":13,"area":null},{"id":"2109.03818","title":"Online Learning for Cooperative Multi-Player Multi-Armed Bandits","created":"2021-09-07","cited_by_count":12,"area":null},{"id":"2302.01539","title":"A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization","created":"2023-02-03","cited_by_count":9,"area":null},{"id":"2306.02208","title":"Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits","created":"2023-06-03","cited_by_count":9,"area":null},{"id":"2210.07780","title":"Federated Best Arm Identification with Heterogeneous Clients","created":"2022-10-14","cited_by_count":8,"area":null},{"id":"2310.14129","title":"Optimal Batched Best Arm Identification","created":"2023-10-21","cited_by_count":8,"area":null},{"id":"2311.06210","title":"Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication","created":"2023-11-10","cited_by_count":8,"area":null},{"id":"2207.08015","title":"Parallel Best Arm Identification in Heterogeneous Environments","created":"2022-07-16","cited_by_count":6,"area":null},{"id":"2310.11015","title":"Pure Exploration in Asynchronous Federated Bandits","created":"2023-10-17","cited_by_count":6,"area":null},{"id":"2208.09029","title":"Communication-Efficient Collaborative Best Arm Identification","created":"2022-08-18","cited_by_count":5,"area":null},{"id":"2309.03145","title":"The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits","created":"2023-09-06","cited_by_count":5,"area":null},{"id":"2301.11442","title":"Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits","created":"2023-01-26","cited_by_count":3,"area":null},{"id":"2502.01425","title":"The Batch Complexity of Bandit Pure Exploration","created":"2025-02-03","cited_by_count":3,"area":null},{"id":"2503.08961","title":"Multiplayer Information Asymmetric Contextual Bandits","created":"2025-03-11","cited_by_count":3,"area":null},{"id":"2405.05733","title":"Batched Stochastic Bandit for Nondegenerate Functions","created":"2024-05-09","cited_by_count":2,"area":null},{"id":"2312.09674","title":"Optimal Regret Bounds for Collaborative Learning in Bandits","created":"2023-12-15","cited_by_count":0,"area":null},{"id":"2501.17370","title":"Breaking the $\\log(1/\\Delta_2)$ Barrier: Better Batched Best Arm Identification with Adaptive Grids","created":"2025-01-29","cited_by_count":0,"area":null},{"id":"2505.10147","title":"Near Optimal Best Arm Identification for Clustered Bandits","created":"2025-05-15","cited_by_count":0,"area":null},{"id":"2510.03798","title":"Batched Bandits with Heavy-Tailed Rewards","created":"2025-10-04","cited_by_count":0,"area":null}],"next_cursor":null}