{"total":17,"rows":[{"id":"2412.06126","title":"UCB algorithms for multi-armed bandits: Precise regret and adaptive inference","created":"2024-12-09","cited_by_count":19,"area":null},{"id":"2205.12086","title":"Information-Directed Selection for Top-Two Algorithms","created":"2022-05-24","cited_by_count":15,"area":null},{"id":"2101.08699","title":"An empirical evaluation of active inference in multi-armed bandits","created":"2021-01-21","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":"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":"2111.02314","title":"Online Learning of Energy Consumption for Navigation of Electric Vehicles","created":"2021-11-03","cited_by_count":7,"area":null},{"id":"2303.06058","title":"A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms","created":"2023-03-10","cited_by_count":4,"area":null},{"id":"2302.01544","title":"Optimality of Thompson Sampling with Noninformative Priors for Pareto Bandits","created":"2023-02-03","cited_by_count":3,"area":null},{"id":"2201.12955","title":"Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework","created":"2022-01-31","cited_by_count":2,"area":null},{"id":"2102.02472","title":"Transfer Learning in Bandits with Latent Continuity","created":"2021-02-04","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":"2308.14350","title":"Simple Modification of the Upper Confidence Bound Algorithm by Generalized Weighted Averages","created":"2023-08-28","cited_by_count":1,"area":null},{"id":"2410.02279","title":"On Lai's Upper Confidence Bound in Multi-Armed Bandits","created":"2024-10-03","cited_by_count":1,"area":null},{"id":"2501.03132","title":"Communication Bounds for the Distributed Experts Problem","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2301.07156","title":"A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles","created":"2023-01-17","cited_by_count":0,"area":null},{"id":"2406.14071","title":"Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits","created":"2024-06-20","cited_by_count":0,"area":null},{"id":"2605.31034","title":"Annealed Softmax Greedy in Many-Armed Bayesian Bandits","created":"2026-05-29","cited_by_count":0,"area":null}],"next_cursor":null}