{"total":40,"rows":[{"id":"2110.09722","title":"Lipschitz Bandits with Batched Feedback","created":"2021-10-19","cited_by_count":21,"area":null},{"id":"2109.05700","title":"Exploiting Heterogeneity in Robust Federated Best-Arm Identification","created":"2021-09-13","cited_by_count":20,"area":null},{"id":"2206.00121","title":"Near-Optimal Collaborative Learning in Bandits","created":"2022-05-31","cited_by_count":18,"area":null},{"id":"2206.04835","title":"Communication Efficient Distributed Learning for Kernelized Contextual Bandits","created":"2022-06-10","cited_by_count":15,"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":"2312.04027","title":"The sample complexity of multi-distribution learning","created":"2023-12-07","cited_by_count":12,"area":null},{"id":"2208.09215","title":"Almost Cost-Free Communication in Federated Best Arm Identification","created":"2022-08-19","cited_by_count":11,"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":"2110.04396","title":"When to Call Your Neighbor? Strategic Communication in Cooperative Stochastic Bandits","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2210.07780","title":"Federated Best Arm Identification with Heterogeneous Clients","created":"2022-10-14","cited_by_count":8,"area":null},{"id":"2211.02212","title":"Distributed Linear Bandits under Communication Constraints","created":"2022-11-04","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":"2106.04207","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","created":"2021-06-08","cited_by_count":5,"area":null},{"id":"2208.09029","title":"Communication-Efficient Collaborative Best Arm Identification","created":"2022-08-18","cited_by_count":5,"area":null},{"id":"2208.11530","title":"Collaborative Algorithms for Online Personalized Mean Estimation","created":"2022-08-24","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":"2410.17835","title":"Optimal Streaming Algorithms for Multi-Armed Bandits","created":"2024-10-23","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":"2309.11702","title":"Incentivized Communication for Federated Bandits","created":"2023-09-21","cited_by_count":3,"area":null},{"id":"2402.17732","title":"Batched Nonparametric Contextual Bandits","created":"2024-02-27","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":"2303.17043","title":"Federated Learning for Heterogeneous Bandits with Unobserved Contexts","created":"2023-03-29","cited_by_count":1,"area":null},{"id":"2311.01695","title":"Communication-Efficient Federated Non-Linear Bandit Optimization","created":"2023-11-03","cited_by_count":1,"area":null},{"id":"2411.07094","title":"Differentially-Private Collaborative Online Personalized Mean Estimation","created":"2024-11-11","cited_by_count":1,"area":null},{"id":"2201.12482","title":"Collaborative Learning in General Graphs with Limited Memorization: Complexity, Learnability, and Reliability","created":"2022-01-29","cited_by_count":0,"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":"2403.11603","title":"Fair Distributed Cooperative Bandit Learning on Networks for Intelligent Internet of Things Systems (Technical Report)","created":"2024-03-18","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":"2506.10313","title":"Collaborative Min-Max Regret in Grouped Multi-Armed Bandits","created":"2025-06-12","cited_by_count":0,"area":null},{"id":"2506.22480","title":"Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Bandits","created":"2025-06-22","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},{"id":"2511.03708","title":"The Adaptivity Barrier in Batched Nonparametric Bandits: Sharp Characterization of the Price of Unknown Margin","created":"2025-11-05","cited_by_count":0,"area":null}],"next_cursor":null}