{"total":20,"rows":[{"id":"2305.18246","title":"Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo","created":"2023-05-29","cited_by_count":29,"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":"2401.02650","title":"Improving sample efficiency of high dimensional Bayesian optimization with MCMC","created":"2024-01-05","cited_by_count":9,"area":null},{"id":"2209.12771","title":"Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps","created":"2022-09-26","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":"2307.10167","title":"VITS : Variational Inference Thompson Sampling for contextual bandits","created":"2023-07-19","cited_by_count":6,"area":null},{"id":"2306.08803","title":"Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning","created":"2023-06-15","cited_by_count":5,"area":null},{"id":"2507.15290","title":"Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown","created":"2025-07-21","cited_by_count":4,"area":null},{"id":"2310.18919","title":"Posterior Sampling with Delayed Feedback for Reinforcement Learning with Linear Function Approximation","created":"2023-10-29","cited_by_count":3,"area":null},{"id":"2410.00660","title":"Stabilizing the Kumaraswamy Distribution","created":"2024-10-01","cited_by_count":3,"area":null},{"id":"2411.05979","title":"Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits","created":"2024-11-08","cited_by_count":3,"area":null},{"id":"2311.14359","title":"Thompson sampling for zero-inflated count outcomes with an application to the Drink Less mobile health study","created":"2023-11-24","cited_by_count":2,"area":null},{"id":"2401.11565","title":"Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis","created":"2024-01-21","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":"2206.12463","title":"Risk-averse Contextual Multi-armed Bandit Problem with Linear Payoffs","created":"2022-06-24","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":"2412.20824","title":"Isoperimetry is All We Need: Langevin Posterior Sampling for RL with Sublinear Regret","created":"2024-12-30","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":"2312.15595","title":"Zero-Inflated Bandits","created":"2023-12-25","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}],"next_cursor":null}