{"total":24,"rows":[{"id":"2102.13028","title":"Batched Neural Bandits","created":"2021-02-25","cited_by_count":22,"area":null},{"id":"2110.00202","title":"Batched Thompson Sampling","created":"2021-10-01","cited_by_count":19,"area":null},{"id":"2206.03520","title":"Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits","created":"2022-06-07","cited_by_count":11,"area":null},{"id":"2309.00591","title":"Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms","created":"2023-09-01","cited_by_count":10,"area":null},{"id":"2310.14129","title":"Optimal Batched Best Arm Identification","created":"2023-10-21","cited_by_count":8,"area":null},{"id":"2406.04137","title":"Optimal Batched Linear Bandits","created":"2024-06-06","cited_by_count":7,"area":null},{"id":"2110.00158","title":"Asymptotic Performance of Thompson Sampling in the Batched Multi-Armed Bandits","created":"2021-10-01","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":"2602.07472","title":"Bandit Allocational Instability","created":"2026-02-07","cited_by_count":3,"area":null},{"id":"2402.07391","title":"Replicability is Asymptotically Free in Multi-armed Bandits","created":"2024-02-12","cited_by_count":2,"area":null},{"id":"2405.05733","title":"Batched Stochastic Bandit for Nondegenerate Functions","created":"2024-05-09","cited_by_count":2,"area":null},{"id":"2507.08438","title":"Optimal and Practical Batched Linear Bandit Algorithm","created":"2025-07-11","cited_by_count":2,"area":null},{"id":"2606.00984","title":"Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates","created":"2026-05-31","cited_by_count":2,"area":null},{"id":"2312.13875","title":"Best Arm Identification in Batched Multi-armed Bandit Problems","created":"2023-12-21","cited_by_count":1,"area":null},{"id":"2312.15549","title":"Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs","created":"2023-12-24","cited_by_count":1,"area":null},{"id":"2406.00424","title":"A Batch Sequential Halving Algorithm without Performance Degradation","created":"2024-06-01","cited_by_count":1,"area":null},{"id":"2211.08311","title":"On Penalization in Stochastic Multi-armed Bandits","created":"2022-11-15","cited_by_count":0,"area":null},{"id":"2310.14751","title":"Efficient and Interpretable Bandit Algorithms","created":"2023-10-23","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":"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":"2502.07514","title":"A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond","created":"2025-02-11","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},{"id":"2609.22690","title":"Multi-Armed Bernoulli Bandits via Minimax Single-Arm Stopping","created":"2026-09-19","cited_by_count":0,"area":null}],"next_cursor":null}