Coreset-based Task Selection For Sample-efficient Meta-reinforcement Learning

Abstract

We study task selection to enhance sample efficiency in model-agnostic meta-reinforcement learning (MAML-RL). Traditional meta-RL typically assumes that all available tasks are equally important, which can lead to task redundancy when they share significant similarities. To address this, we propose a coreset-based task selection approach that selects a weighted subset of tasks based on how diverse they are in gradient space, prioritizing the most informative and diverse tasks. Such task selection reduces the number of samples needed to find an \(\epsilon\)-close stationary solution by a factor of O(1/\(\epsilon\)). Consequently, it guarantees a faster adaptation to unseen tasks while focusing training on the most relevant tasks. As a case study, we incorporate task selection to MAML-LQR (Toso et al., 2024b), and prove a sample complexity reduction proportional to O(log(1/\(\epsilon\))) when the task specific cost also satisfy gradient dominance. Our theoretical guarantees underscore ta

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyzhan2025coreset

Related papers

• Information-theoretic Task Selection For Meta-reinforcement Learning (2020)0.00
• Sample Efficient Myopic Exploration Through Multitask Reinforcement Learning With Diverse Tasks (2024)0.00
• Model-based Adversarial Meta-reinforcement Learning (2020)0.00
• A Model-based Approach For Sample-efficient Multi-task Reinforcement Learning (2019)0.00
• Shared-unique Features And Task-aware Prioritized Sampling On Multi-task Reinforcement Learning (2024)0.00
• A Tutorial On Meta-reinforcement Learning (2023)10.85
• Meta-reinforcement Learning With Universal Policy Adaptation: Provable Near-optimality Under All-task Optimum Comparator (2024)0.00
• On The Convergence Theory Of Debiased Model-agnostic Meta-reinforcement Learning (2020)0.00