{"total":18,"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":"2305.15703","title":"The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning","created":"2023-05-25","cited_by_count":27,"area":null},{"id":"2408.05804","title":"A Single Goal is All You Need: Skills and Exploration Emerge from Contrastive RL without Rewards, Demonstrations, or Subgoals","created":"2024-08-11","cited_by_count":23,"area":null},{"id":"2305.18258","title":"Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration","created":"2023-05-29","cited_by_count":20,"area":null},{"id":"2210.01907","title":"A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games","created":"2022-10-04","cited_by_count":16,"area":null},{"id":"2211.14250","title":"Model-Free Reinforcement Learning with the Decision-Estimation Coefficient","created":"2022-11-25","cited_by_count":11,"area":null},{"id":"2211.14932","title":"Eluder-based Regret for Stochastic Contextual MDPs","created":"2022-11-27","cited_by_count":9,"area":null},{"id":"2310.20007","title":"Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning","created":"2023-10-30","cited_by_count":7,"area":null},{"id":"2404.12648","title":"Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation","created":"2024-04-19","cited_by_count":6,"area":null},{"id":"2310.07518","title":"Exploiting Causal Graph Priors with Posterior Sampling for Reinforcement Learning","created":"2023-10-11","cited_by_count":5,"area":null},{"id":"2312.04464","title":"Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation","created":"2023-12-07","cited_by_count":4,"area":null},{"id":"2403.10379","title":"Regret Minimization via Saddle Point Optimization","created":"2024-03-15","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":"2310.06243","title":"Sample-Efficient Multi-Agent RL: An Optimization Perspective","created":"2023-10-10","cited_by_count":1,"area":null},{"id":"2407.13622","title":"Misspecified $Q$-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error","created":"2024-07-18","cited_by_count":0,"area":null},{"id":"2606.04845","title":"Bayesian learning for the stochastic shortest path problem","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2610.19513","title":"High-Probability Regret Bounds for Feel-Good Thompson Sampling","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}