{"total":49,"rows":[{"id":"2102.00815","title":"Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms","created":"2021-02-01","cited_by_count":223,"area":null},{"id":"2210.06718","title":"Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient","created":"2022-10-13","cited_by_count":161,"area":null},{"id":"2102.07035","title":"Model-free Representation Learning and Exploration in Low-rank MDPs","created":"2021-02-14","cited_by_count":82,"area":null},{"id":"2102.04939","title":"RL for Latent MDPs: Regret Guarantees and a Lower Bound","created":"2021-02-09","cited_by_count":70,"area":null},{"id":"2110.00871","title":"Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning","created":"2021-10-02","cited_by_count":66,"area":null},{"id":"2212.06132","title":"Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes","created":"2022-12-12","cited_by_count":57,"area":null},{"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":"2205.11507","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs","created":"2022-05-23","cited_by_count":52,"area":null},{"id":"2202.00063","title":"Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approach","created":"2022-01-31","cited_by_count":51,"area":null},{"id":"2101.12745","title":"Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP","created":"2021-01-29","cited_by_count":45,"area":null},{"id":"2111.03289","title":"Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs","created":"2021-11-05","cited_by_count":44,"area":null},{"id":"2101.00494","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost","created":"2021-01-02","cited_by_count":40,"area":null},{"id":"2302.10371","title":"Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency","created":"2023-02-21","cited_by_count":40,"area":null},{"id":"2102.04168","title":"Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature","created":"2021-02-08","cited_by_count":32,"area":null},{"id":"2206.09421","title":"Guarantees for Epsilon-Greedy Reinforcement Learning with Function Approximation","created":"2022-06-19","cited_by_count":31,"area":null},{"id":"2206.11489","title":"Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation","created":"2022-06-23","cited_by_count":30,"area":null},{"id":"2110.08847","title":"Provable RL with Exogenous Distractors via Multistep Inverse Dynamics","created":"2021-10-17","cited_by_count":28,"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":"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":"2202.06450","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","created":"2022-02-14","cited_by_count":24,"area":null},{"id":"2103.04972","title":"Provably Efficient Cooperative Multi-Agent Reinforcement Learning with Function Approximation","created":"2021-03-08","cited_by_count":23,"area":null},{"id":"2304.05889","title":"Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RL","created":"2023-04-12","cited_by_count":22,"area":null},{"id":"2206.02072","title":"Deciding What to Model: Value-Equivalent Sampling for Reinforcement Learning","created":"2022-06-04","cited_by_count":19,"area":null},{"id":"2102.02049","title":"On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function","created":"2021-02-03","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":"2307.03997","title":"Efficient Model-Free Exploration in Low-Rank MDPs","created":"2023-07-08","cited_by_count":16,"area":null},{"id":"2103.12726","title":"Policy Information Capacity: Information-Theoretic Measure for Task Complexity in Deep Reinforcement Learning","created":"2021-03-23","cited_by_count":15,"area":null},{"id":"2311.15238","title":"A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation","created":"2023-11-26","cited_by_count":14,"area":null},{"id":"2106.11519","title":"Agnostic Reinforcement Learning with Low-Rank MDPs and Rich Observations","created":"2021-06-22","cited_by_count":13,"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":"2206.12081","title":"Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings","created":"2022-06-24","cited_by_count":12,"area":null},{"id":"2310.06793","title":"Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning","created":"2023-10-10","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":"2310.06113","title":"When is Agnostic Reinforcement Learning Statistically Tractable?","created":"2023-10-09","cited_by_count":9,"area":null},{"id":"2206.08364","title":"Interaction-Grounded Learning with Action-inclusive Feedback","created":"2022-06-16","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":"2107.07394","title":"Explore and Control with Adversarial Surprise","created":"2021-07-12","cited_by_count":6,"area":null},{"id":"2406.01389","title":"RL in Latent MDPs is Tractable: Online Guarantees via Off-Policy Evaluation","created":"2024-06-03","cited_by_count":6,"area":null},{"id":"2403.09701","title":"A Natural Extension To Online Algorithms For Hybrid RL With Limited Coverage","created":"2024-03-07","cited_by_count":5,"area":null},{"id":"2204.10349","title":"Provably Efficient Kernelized Q-Learning","created":"2022-04-21","cited_by_count":4,"area":null},{"id":"2306.13053","title":"Context-lumpable stochastic bandits","created":"2023-06-22","cited_by_count":4,"area":null},{"id":"2310.07596","title":"Prospective Side Information for Latent MDPs","created":"2023-10-11","cited_by_count":4,"area":null},{"id":"2311.07876","title":"Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback","created":"2023-11-14","cited_by_count":4,"area":null},{"id":"2202.05444","title":"Computational-Statistical Gaps in Reinforcement Learning","created":"2022-02-11","cited_by_count":3,"area":null},{"id":"2410.03016","title":"Learning a Fast Mixing Exogenous Block MDP using a Single Trajectory","created":"2024-10-03","cited_by_count":3,"area":null},{"id":"2601.16922","title":"Group-realizable multi-group learning by minimizing empirical risk","created":"2026-01-23","cited_by_count":3,"area":null},{"id":"2410.14992","title":"Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span","created":"2024-10-19","cited_by_count":1,"area":null},{"id":"2601.20694","title":"Is Pure Exploitation Sufficient in Exogenous MDPs with Linear Function Approximation?","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2605.06474","title":"Q-MMR: Off-Policy Evaluation via Recursive Reweighting and Moment Matching","created":"2026-05-07","cited_by_count":0,"area":null}],"next_cursor":null}