{"total":24,"rows":[{"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":"2505.23150","title":"Bigger, Regularized, Categorical: High-Capacity Value Functions are Efficient Multi-Task Learners","created":"2025-05-29","cited_by_count":23,"area":null},{"id":"2211.03959","title":"Pretraining in Deep Reinforcement Learning: A Survey","created":"2022-11-08","cited_by_count":18,"area":null},{"id":"2212.12809","title":"Understanding the Complexity Gains of Single-Task RL with a Curriculum","created":"2022-12-24","cited_by_count":17,"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":"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":"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":"2306.10694","title":"On the Model-Misspecification in Reinforcement Learning","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2302.04441","title":"Multi-task Representation Learning for Pure Exploration in Linear Bandits","created":"2023-02-09","cited_by_count":6,"area":null},{"id":"2404.05051","title":"Skill Transfer and Discovery for Sim-to-Real Learning: A Representation-Based Viewpoint","created":"2024-04-07","cited_by_count":6,"area":null},{"id":"2206.12441","title":"Joint Representation Training in Sequential Tasks with Shared Structure","created":"2022-06-24","cited_by_count":5,"area":null},{"id":"2503.01885","title":"Learning Policy Committees for Effective Personalization in MDPs with Diverse Tasks","created":"2025-02-26","cited_by_count":4,"area":null},{"id":"2404.00099","title":"Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processes","created":"2024-03-29","cited_by_count":3,"area":null},{"id":"2406.03437","title":"Transfer Learning for Latent Variable Network Models","created":"2024-06-05","cited_by_count":3,"area":null},{"id":"2308.05471","title":"Provably Efficient Algorithm for Nonstationary Low-Rank MDPs","created":"2023-08-10","cited_by_count":2,"area":null},{"id":"2503.00174","title":"Optimal Transfer Learning for Missing Not-at-Random Matrix Completion","created":"2025-02-28","cited_by_count":2,"area":null},{"id":"2307.11704","title":"JoinGym: An Efficient Query Optimization Environment for Reinforcement Learning","created":"2023-07-21","cited_by_count":1,"area":null},{"id":"2310.10818","title":"Uncertainty-aware transfer across tasks using hybrid model-based successor feature reinforcement learning","created":"2023-10-16","cited_by_count":1,"area":null},{"id":"2406.03845","title":"Open Problem: Active Representation Learning","created":"2024-06-06","cited_by_count":1,"area":null},{"id":"2601.21924","title":"One-Step Bellman Alignment Enables Provably Efficient Transfer in Online RL","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2310.13550","title":"Provable Benefits of Multi-task RL under Non-Markovian Decision Making Processes","created":"2023-10-20","cited_by_count":0,"area":null},{"id":"2603.07921","title":"Robust Transfer Learning with Side Information","created":"2026-03-09","cited_by_count":0,"area":null}],"next_cursor":null}