Meta-reinforcement learning with minimum attention
On the map: Deep reinforcement learning methods → Deep RL algorithms and representations
Abstract (arXiv)
Minimum attention applies the least action principle in changes of control concerning state and time, first proposed by Brockett. The involved regularization is highly relevant in emulating biological control, such as motor learning. We apply minimum attention in reinforcement learning (RL) as part of the rewards and investigate its connection to meta-learning and stabilization. Specifically, model-based meta-learning with minimum attention is explored in high-dimensional nonlinear dynamics. Ensemble-based model learning and gradient-based meta-policy learning are alternately performed. Empirically, minimum attention improves fast adaptation in few shots and reduces variance from perturbations of the model and environment, compared to model-free and model-based RL baseline, and yields consistent gain when integrated into modern world models (DreamerV3, MAMBA). Furthermore, the minimum attention demonstrates an improvement in energy efficiency.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 21 of its 29 references that are in the map. First posted on arXiv 22 May 2025.
Builds on
21 of 29 references.
Closest ancestors · 1
Same direction, newest first
Other references · 20
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Trust Region Policy Optimizationcited by 2,580
- 2023Mastering Diverse Domains through World Modelscited by 1,253
- 2018DeepMind Control Suitecited by 956
- 2018Learning to Adapt in Dynamic, Real-World Environments Through Meta-Reinforcement Learningcited by 276
- 2018Model-Ensemble Trust-Region Policy Optimizationcited by 219
- 2019Robust Learning with Jacobian Regularizationcited by 129
- 2018Model-Based Reinforcement Learning via Meta-Policy Optimizationcited by 101
- 2020Context-aware Dynamics Model for Generalization in Model-Based Reinforcement Learningcited by 98
- 2021Differentiable Particle Filtering via Entropy-Regularized Optimal Transportcited by 59
8 more
- 2020The Advantage of Conditional Meta-Learning for Biased Regularization and Fine-Tuningcited by 40
- 2021Policy Smoothing for Provably Robust Reinforcement Learningcited by 40
- 2020Model-based Reinforcement Learning for Semi-Markov Decision Processes with Neural ODEscited by 32
- 2022Convergence of Policy Gradient for Entropy Regularized MDPs with Neural Network Approximation in the Mean-Field Regimecited by 21
- 2023Is Model Ensemble Necessary? Model-based RL via a Single Model with Lipschitz Regularized Value Functioncited by 19
- 2020Online Meta-Critic Learning for Off-Policy Actor-Critic Methodscited by 17
- 2022Adversarially Robust Models may not Transfer Better: Sufficient Conditions for Domain Transferability from the View of Regularizationcited by 8
- 2019On the Existence and Computation of Minimum Attention Optimal Control Lawscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Meta-Reinforcement Learning with Universal Policy Adaptation: Provable Near-Optimality under All-task Optimum Comparator
- 2024Hierarchical Meta-Reinforcement Learning via Automated Macro-Action Discovery
- 2024Towards an Adaptable and Generalizable Optimization Engine in Decision and Control: A Meta Reinforcement Learning Approach
- 2023Comparing the Efficacy of Fine-Tuning and Meta-Learning for Few-Shot Policy Imitation
- 2023Stepsize Learning for Policy Gradient Methods in Contextual Markov Decision Processes
- 2024Constrained Meta Agnostic Reinforcement Learning
- 2022Robotic Control Using Model Based Meta Adaption
- 2024Theoretical Analysis of Meta Reinforcement Learning: Generalization Bounds and Convergence Guarantees