{"total":40,"rows":[{"id":"2103.12923","title":"Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation","created":"2021-03-24","cited_by_count":53,"area":null},{"id":"2106.07841","title":"Randomized Exploration for Reinforcement Learning with General Value Function Approximation","created":"2021-06-15","cited_by_count":49,"area":null},{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"area":null},{"id":"2107.14702","title":"Towards General Function Approximation in Zero-Sum Markov Games","created":"2021-07-30","cited_by_count":43,"area":null},{"id":"2106.10268","title":"MADE: Exploration via Maximizing Deviation from Explored Regions","created":"2021-06-18","cited_by_count":40,"area":null},{"id":"2206.07659","title":"Model-based RL with Optimistic Posterior Sampling: Structural Conditions and Sample Complexity","created":"2022-06-15","cited_by_count":32,"area":null},{"id":"2208.10904","title":"A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning","created":"2022-08-23","cited_by_count":31,"area":null},{"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":"2203.12922","title":"Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies","created":"2022-03-24","cited_by_count":27,"area":null},{"id":"2105.06022","title":"Principled Exploration via Optimistic Bootstrapping and Backward Induction","created":"2021-05-13","cited_by_count":26,"area":null},{"id":"2206.04640","title":"Regret Bounds for Information-Directed Reinforcement Learning","created":"2022-06-09","cited_by_count":24,"area":null},{"id":"2205.07704","title":"From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses","created":"2022-05-16","cited_by_count":22,"area":null},{"id":"2306.07745","title":"Kernelized Reinforcement Learning with Order Optimal Regret Bounds","created":"2023-06-13","cited_by_count":20,"area":null},{"id":"2301.13446","title":"Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both Worlds in Stochastic and Deterministic Environments","created":"2023-01-31","cited_by_count":19,"area":null},{"id":"2111.00633","title":"Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning","created":"2021-11-01","cited_by_count":18,"area":null},{"id":"2202.10678","title":"Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning","created":"2022-02-22","cited_by_count":18,"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":"2305.00477","title":"Posterior Sampling for Deep Reinforcement Learning","created":"2023-04-30","cited_by_count":16,"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":"2212.13540","title":"Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2022-12-27","cited_by_count":13,"area":null},{"id":"2209.14414","title":"Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees","created":"2022-09-28","cited_by_count":12,"area":null},{"id":"2203.08248","title":"Non-Linear Reinforcement Learning in Large Action Spaces: Structural Conditions and Sample-efficiency of Posterior Sampling","created":"2022-03-15","cited_by_count":10,"area":null},{"id":"2107.06466","title":"Going Beyond Linear RL: Sample Efficient Neural Function Approximation","created":"2021-07-14","cited_by_count":9,"area":null},{"id":"2302.00727","title":"Sample Complexity of Kernel-Based Q-Learning","created":"2023-02-01","cited_by_count":8,"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":"2207.12805","title":"Neural Design for Genetic Perturbation Experiments","created":"2022-07-26","cited_by_count":6,"area":null},{"id":"2211.08998","title":"Data-pooling Reinforcement Learning for Personalized Healthcare Intervention","created":"2022-11-16","cited_by_count":6,"area":null},{"id":"2410.22908","title":"Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents","created":"2024-10-30","cited_by_count":6,"area":null},{"id":"2112.14195","title":"Exponential Family Model-Based Reinforcement Learning via Score Matching","created":"2021-12-28","cited_by_count":5,"area":null},{"id":"2106.12200","title":"Random Effect Bandits","created":"2021-06-23","cited_by_count":4,"area":null},{"id":"2204.10349","title":"Provably Efficient Kernelized Q-Learning","created":"2022-04-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":"2205.09056","title":"Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs","created":"2022-05-18","cited_by_count":2,"area":null},{"id":"2312.08559","title":"Fair Active Learning in Low-Data Regimes","created":"2023-12-13","cited_by_count":2,"area":null},{"id":"2308.07843","title":"Dyadic Reinforcement Learning","created":"2023-08-15","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":"2301.03142","title":"Exploration in Model-based Reinforcement Learning with Randomized Reward","created":"2023-01-09","cited_by_count":0,"area":null},{"id":"2407.05704","title":"Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization","created":"2024-07-08","cited_by_count":0,"area":null},{"id":"2605.09277","title":"Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits","created":"2026-05-10","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}],"next_cursor":null}