{"total":51,"rows":[{"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":"2304.12567","title":"Proto-Value Networks: Scaling Representation Learning with Auxiliary Tasks","created":"2023-04-25","cited_by_count":42,"area":null},{"id":"2205.14571","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","created":"2022-05-29","cited_by_count":38,"area":null},{"id":"2208.09515","title":"Spectral Decomposition Representation for Reinforcement Learning","created":"2022-08-19","cited_by_count":36,"area":null},{"id":"2206.12020","title":"Provably Efficient Reinforcement Learning in Partially Observable Dynamical Systems","created":"2022-06-24","cited_by_count":35,"area":null},{"id":"2302.03201","title":"Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR","created":"2023-02-07","cited_by_count":32,"area":null},{"id":"2206.11889","title":"Provably Efficient Model-Free Constrained RL with Linear Function Approximation","created":"2022-06-23","cited_by_count":31,"area":null},{"id":"2206.05900","title":"Provable Benefit of Multitask Representation Learning in Reinforcement Learning","created":"2022-06-13","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":"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":"2302.09456","title":"Distributional Offline Policy Evaluation with Predictive Error Guarantees","created":"2023-02-19","cited_by_count":20,"area":"diffusion"},{"id":"2211.03959","title":"Pretraining in Deep Reinforcement Learning: A Survey","created":"2022-11-08","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":"2210.16976","title":"Representation Learning for General-sum Low-rank Markov Games","created":"2022-10-30","cited_by_count":15,"area":null},{"id":"2212.08765","title":"Latent Variable Representation for Reinforcement Learning","created":"2022-12-17","cited_by_count":15,"area":null},{"id":"2304.07278","title":"Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning","created":"2023-04-14","cited_by_count":15,"area":"offlinerl"},{"id":"2303.10859","title":"Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs","created":"2023-03-20","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":"2303.00694","title":"The Virtues of Laziness in Model-based RL: A Unified Objective and Algorithms","created":"2023-03-01","cited_by_count":12,"area":null},{"id":"2311.08384","title":"Offline Data Enhanced On-Policy Policy Gradient with Provable Guarantees","created":"2023-11-14","cited_by_count":11,"area":"offlinerl"},{"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":"2203.12786","title":"Bellman Residual Orthogonalization for Offline Reinforcement Learning","created":"2022-03-24","cited_by_count":10,"area":"offlinerl"},{"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":"2306.12356","title":"Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDP","created":"2023-06-21","cited_by_count":8,"area":null},{"id":"2405.17796","title":"Offline Oracle-Efficient Learning for Contextual MDPs via Layerwise Exploration-Exploitation Tradeoff","created":"2024-05-28","cited_by_count":8,"area":null},{"id":"2404.03774","title":"Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning","created":"2024-04-04","cited_by_count":6,"area":"deeprl"},{"id":"2210.13083","title":"Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees","created":"2022-10-24","cited_by_count":5,"area":null},{"id":"2306.10404","title":"The RL Perceptron: Generalisation Dynamics of Policy Learning in High Dimensions","created":"2023-06-17","cited_by_count":5,"area":null},{"id":"2309.09457","title":"Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles","created":"2023-09-18","cited_by_count":5,"area":null},{"id":"2406.07253","title":"Hybrid Reinforcement Learning from Offline Observation Alone","created":"2024-06-11","cited_by_count":5,"area":"deeprl"},{"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":"2406.11640","title":"Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions","created":"2024-06-17","cited_by_count":4,"area":"deeprl"},{"id":"2410.17538","title":"Primal-Dual Spectral Representation for Off-policy Evaluation","created":"2024-10-23","cited_by_count":4,"area":"deeprl"},{"id":"2411.15014","title":"On the Linear Speedup of Personalized Federated Reinforcement Learning with Shared Representations","created":"2024-11-22","cited_by_count":4,"area":"deeprl"},{"id":"2510.03207","title":"To Distill or Decide? Understanding the Algorithmic Trade-off in Partially Observable Reinforcement Learning","created":"2025-10-03","cited_by_count":3,"area":"deeprl"},{"id":"2411.06739","title":"Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2211.15205","title":"CIM: Constrained Intrinsic Motivation for Sparse-Reward Continuous Control","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2211.15792","title":"Provably Efficient Model-free RL in Leader-Follower MDP with Linear Function Approximation","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2306.12981","title":"Achieving Sample and Computational Efficient Reinforcement Learning by Action Space Reduction via Grouping","created":"2023-06-22","cited_by_count":1,"area":null},{"id":"2309.11984","title":"State Representations as Incentives for Reinforcement Learning Agents: A Sim2Real Analysis on Robotic Grasping","created":"2023-09-21","cited_by_count":1,"area":null},{"id":"2410.21601","title":"The Limits of Transfer Reinforcement Learning with Latent Low-rank Structure","created":"2024-10-28","cited_by_count":1,"area":"deeprl"},{"id":"2410.23434","title":"Model-free Low-Rank Reinforcement Learning via Leveraged Entry-wise Matrix Estimation","created":"2024-10-30","cited_by_count":1,"area":"deeprl"},{"id":"2503.02030","title":"Accelerating Multi-Task Temporal Difference Learning under Low-Rank Representation","created":"2025-03-03","cited_by_count":1,"area":"deeprl"},{"id":"2303.07397","title":"Fast exploration and learning of latent graphs with aliased observations","created":"2023-03-13","cited_by_count":0,"area":null},{"id":"2303.08856","title":"On the Benefits of Leveraging Structural Information in Planning Over the Learned Model","created":"2023-03-15","cited_by_count":0,"area":null},{"id":"2306.08762","title":"Near-Optimal Partially Observable Reinforcement Learning with Partial Online State Information","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2409.13108","title":"Disentangling Recognition and Decision Regrets in Image-Based Reinforcement Learning","created":"2024-09-19","cited_by_count":0,"area":"deeprl"},{"id":"2602.01453","title":"The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration","created":"2026-02-01","cited_by_count":0,"area":null},{"id":"2605.01242","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","created":"2026-05-02","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}