{"total":28,"rows":[{"id":"2206.11254","title":"Langevin Monte Carlo for Contextual Bandits","created":"2022-06-22","cited_by_count":22,"area":null},{"id":"2106.01420","title":"Parallelizing Thompson Sampling","created":"2021-06-02","cited_by_count":20,"area":null},{"id":"2102.09703","title":"Near-Optimal Randomized Exploration for Tabular Markov Decision Processes","created":"2021-02-19","cited_by_count":15,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","cited_by_count":12,"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":"2401.11665","title":"Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo","created":"2024-01-22","cited_by_count":10,"area":null},{"id":"2311.05794","title":"An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed Bandits","created":"2023-11-09","cited_by_count":9,"area":null},{"id":"2405.07839","title":"Constrained Exploration via Reflected Replica Exchange Stochastic Gradient Langevin Dynamics","created":"2024-05-13","cited_by_count":7,"area":null},{"id":"2307.10167","title":"VITS : Variational Inference Thompson Sampling for contextual bandits","created":"2023-07-19","cited_by_count":6,"area":null},{"id":"2206.08556","title":"Thompson Sampling for Robust Transfer in Multi-Task Bandits","created":"2022-06-17","cited_by_count":3,"area":null},{"id":"2405.04393","title":"Efficient Online Set-valued Classification with Bandit Feedback","created":"2024-05-07","cited_by_count":3,"area":null},{"id":"2602.07472","title":"Bandit Allocational Instability","created":"2026-02-07","cited_by_count":3,"area":null},{"id":"2102.07929","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment","created":"2021-02-16","cited_by_count":2,"area":null},{"id":"2108.06812","title":"Batched Thompson Sampling for Multi-Armed Bandits","created":"2021-08-15","cited_by_count":2,"area":null},{"id":"2304.14989","title":"Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards","created":"2023-04-28","cited_by_count":2,"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":"2511.02123","title":"Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits","created":"2025-11-03","cited_by_count":2,"area":null},{"id":"2602.06014","title":"Optimism Stabilizes Thompson Sampling for Adaptive Inference","created":"2026-02-05","cited_by_count":2,"area":null},{"id":"2302.09440","title":"Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits","created":"2023-02-18","cited_by_count":1,"area":null},{"id":"2402.15127","title":"Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention","created":"2024-02-23","cited_by_count":1,"area":null},{"id":"2502.14379","title":"Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling","created":"2025-02-20","cited_by_count":1,"area":null},{"id":"2510.05023","title":"Rethinking Langevin Thompson Sampling from A Stochastic Approximation Perspective","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2309.06349","title":"Generalized Regret Analysis of Thompson Sampling using Fractional Posteriors","created":"2023-09-12","cited_by_count":0,"area":null},{"id":"2312.15595","title":"Zero-Inflated Bandits","created":"2023-12-25","cited_by_count":0,"area":null},{"id":"2405.01010","title":"Efficient and Adaptive Posterior Sampling Algorithms for Bandits","created":"2024-05-02","cited_by_count":0,"area":null},{"id":"2505.02383","title":"Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret","created":"2025-05-05","cited_by_count":0,"area":null},{"id":"2605.10289","title":"Sample-Mean Anchored Thompson Sampling for Offline-to-Online Learning with Distribution Shift","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2607.23679","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","created":"2026-07-26","cited_by_count":0,"area":null}],"next_cursor":null}