{"total":9,"rows":[{"id":"2401.11665","title":"Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo","created":"2024-01-22","cited_by_count":10,"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":"2404.07266","title":"Sequential Decision Making with Expert Demonstrations under Unobserved Heterogeneity","created":"2024-04-10","cited_by_count":2,"area":null},{"id":"2502.00550","title":"Active Learning with Bayesian Multi-Fidelity Laplace Neural Operators for Oscillatory Parametric PDEs","created":"2025-02-01","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":"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":"2606.04845","title":"Bayesian learning for the stochastic shortest path problem","created":"2026-06-03","cited_by_count":0,"area":null}],"next_cursor":null}