{"total":27,"rows":[{"id":"2110.01463","title":"Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits","created":"2021-10-04","cited_by_count":31,"area":null},{"id":"2110.11665","title":"Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes","created":"2021-10-22","cited_by_count":24,"area":null},{"id":"2203.01303","title":"An Analysis of Ensemble Sampling","created":"2022-03-02","cited_by_count":24,"area":null},{"id":"2203.15589","title":"On Kernelized Multi-Armed Bandits with Constraints","created":"2022-03-29","cited_by_count":23,"area":null},{"id":"2201.09910","title":"Learning Neural Contextual Bandits Through Perturbed Rewards","created":"2022-01-24","cited_by_count":17,"area":null},{"id":"2212.13540","title":"Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2022-12-27","cited_by_count":13,"area":null},{"id":"2311.07565","title":"Exploration via linearly perturbed loss minimisation","created":"2023-11-13","cited_by_count":13,"area":null},{"id":"2105.09232","title":"Diffusion Approximations for Thompson Sampling in the Small Gap Regime","created":"2021-05-19","cited_by_count":12,"area":null},{"id":"2202.11474","title":"Residual Bootstrap Exploration for Stochastic Linear Bandit","created":"2022-02-23","cited_by_count":8,"area":null},{"id":"2110.11202","title":"Anti-Concentrated Confidence Bonuses for Scalable Exploration","created":"2021-10-21","cited_by_count":7,"area":null},{"id":"2311.08376","title":"Ensemble sampling for linear bandits: small ensembles suffice","created":"2023-11-14","cited_by_count":7,"area":null},{"id":"2206.05404","title":"Squeeze All: Novel Estimator and Self-Normalized Bound for Linear Contextual Bandits","created":"2022-06-11","cited_by_count":6,"area":null},{"id":"2411.03932","title":"Improved Regret of Linear Ensemble Sampling","created":"2024-11-06","cited_by_count":6,"area":null},{"id":"2302.01543","title":"Multiplier Bootstrap-based Exploration","created":"2023-02-03","cited_by_count":3,"area":null},{"id":"2406.05710","title":"Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits","created":"2024-06-09","cited_by_count":3,"area":null},{"id":"2510.10730","title":"Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits","created":"2025-10-12","cited_by_count":2,"area":null},{"id":"2103.04387","title":"CORe: Capitalizing On Rewards in Bandit Exploration","created":"2021-03-07","cited_by_count":1,"area":null},{"id":"2104.05613","title":"An Efficient Algorithm for Deep Stochastic Contextual Bandits","created":"2021-04-12","cited_by_count":1,"area":null},{"id":"2205.03820","title":"Some performance considerations when using multi-armed bandit algorithms in the presence of missing data","created":"2022-05-08","cited_by_count":1,"area":null},{"id":"2406.10686","title":"Graph Neural Thompson Sampling","created":"2024-06-15","cited_by_count":1,"area":null},{"id":"2601.00461","title":"Laplacian Kernelized Bandit","created":"2026-01-01","cited_by_count":1,"area":null},{"id":"2307.03587","title":"Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits","created":"2023-07-07","cited_by_count":0,"area":null},{"id":"2312.15595","title":"Zero-Inflated Bandits","created":"2023-12-25","cited_by_count":0,"area":null},{"id":"2506.14479","title":"Adaptive Data Augmentation for Thompson Sampling","created":"2025-06-17","cited_by_count":0,"area":null},{"id":"2510.17390","title":"Exploration via Feature Perturbation in Contextual Bandits","created":"2025-10-20","cited_by_count":0,"area":null},{"id":"2609.13954","title":"Linear Ensemble Sampling with Smaller Ensembles","created":"2026-09-12","cited_by_count":0,"area":null},{"id":"2610.17818","title":"Follow the Perturbed Leader for Linear Bandits: $\\sqrt{T}$ Regret over General Convex Sets","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}