{"total":27,"rows":[{"id":"2205.14571","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","created":"2022-05-29","cited_by_count":38,"area":null},{"id":"2207.02575","title":"Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design","created":"2022-07-06","cited_by_count":33,"area":null},{"id":"2306.12371","title":"Optimistic Active Exploration of Dynamical Systems","created":"2023-06-21","cited_by_count":32,"area":null},{"id":"2206.10770","title":"On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL","created":"2022-06-21","cited_by_count":27,"area":null},{"id":"2301.13087","title":"Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation","created":"2023-01-30","cited_by_count":17,"area":null},{"id":"2206.11183","title":"Active Learning with Safety Constraints","created":"2022-06-22","cited_by_count":16,"area":null},{"id":"2304.08944","title":"Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning","created":"2023-04-18","cited_by_count":15,"area":null},{"id":"2308.14642","title":"Rate-Optimal Policy Optimization for Linear Markov Decision Processes","created":"2023-08-28","cited_by_count":14,"area":null},{"id":"2403.11574","title":"Offline Multitask Representation Learning for Reinforcement Learning","created":"2024-03-18","cited_by_count":14,"area":null},{"id":"2210.00701","title":"Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation","created":"2022-10-03","cited_by_count":13,"area":null},{"id":"2305.11032","title":"Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL","created":"2023-05-18","cited_by_count":13,"area":null},{"id":"2310.11550","title":"Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback","created":"2023-10-17","cited_by_count":13,"area":null},{"id":"2307.04354","title":"Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data","created":"2023-07-10","cited_by_count":11,"area":null},{"id":"2210.15755","title":"Confident Approximate Policy Iteration for Efficient Local Planning in $q^\\pi$-realizable MDPs","created":"2022-10-27","cited_by_count":8,"area":null},{"id":"2303.05606","title":"Variance-aware robust reinforcement learning with linear function approximation under heavy-tailed rewards","created":"2023-03-09","cited_by_count":8,"area":null},{"id":"2302.06025","title":"Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits","created":"2023-02-12","cited_by_count":7,"area":null},{"id":"2303.10165","title":"Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs","created":"2023-03-17","cited_by_count":7,"area":null},{"id":"2311.05638","title":"Towards Instance-Optimality in Online PAC Reinforcement Learning","created":"2023-10-31","cited_by_count":7,"area":null},{"id":"2208.05633","title":"Best Policy Identification in Linear MDPs","created":"2022-08-11","cited_by_count":4,"area":null},{"id":"2210.05355","title":"Multi-User Reinforcement Learning with Low Rank Rewards","created":"2022-10-11","cited_by_count":4,"area":null},{"id":"2303.00177","title":"Finite-sample Guarantees for Nash Q-learning with Linear Function Approximation","created":"2023-03-01","cited_by_count":4,"area":null},{"id":"2305.08350","title":"Uniform-PAC Guarantees for Model-Based RL with Bounded Eluder Dimension","created":"2023-05-15","cited_by_count":3,"area":null},{"id":"2205.15891","title":"One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning","created":"2022-05-31","cited_by_count":2,"area":null},{"id":"2310.07811","title":"Online RL in Linearly $q^\\pi$-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore","created":"2023-10-11","cited_by_count":2,"area":null},{"id":"2602.17876","title":"Interactive Learning of Single-Index Models via Stochastic Gradient Descent","created":"2026-02-19","cited_by_count":1,"area":null},{"id":"2404.08846","title":"Experimental Design for Active Transductive Inference in Large Language Models","created":"2024-04-12","cited_by_count":0,"area":null},{"id":"2602.01453","title":"The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration","created":"2026-02-01","cited_by_count":0,"area":null}],"next_cursor":null}