paper-with-me

Papers

Bootstrapped Meta-Learning

2021-09-09 · ICLR 2022 4 · Sebastian Flennerhag, Yannick Schroecker, Tom Zahavy, Hado van Hasselt, David Silver, Satinder Singh

Meta-learning empowers artificial intelligence to increase its efficiency by learning how to learn. Unlocking this potential involves overcoming a challenging meta-optimisation problem. We propose an algorithm that tackles this problem by letting the meta-learner teach itself. The algorithm first bootstraps a target from the meta-learner, then optimises the meta-learner by minimising the distance to that target under a chosen (pseudo-)metric. Focusing on meta-learning with gradients, we establish conditions that guarantee performance improvements and show that the metric can control meta-optimisation. Meanwhile, the bootstrapping mechanism can extend the effective meta-learning horizon without requiring backpropagation through all updates. We achieve a new state-of-the art for model-free agents on the Atari ALE benchmark and demonstrate that it yields both performance and efficiency gains in multi-task meta-learning. Finally, we explore how bootstrapping opens up new possibilities and find that it can meta-learn efficient exploration in an epsilon-greedy Q-learning agent, without backpropagating through the update rule.

📄 PDF Abstract BibTeX arXiv:2109.04504

Code (1)

l4fl4m3/bmg pytorch

Tasks

Efficient ExplorationFew-Shot LearningMeta-LearningQ-Learning

Methods 이 논문이 사용한 방법론

MAML 설명 없음
Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…

Similar Papers 제목 키워드 기반

Unleash Model Potential: Bootstrapped Meta Self-supervised Learning

2023-08-28 · Jingyao Wang, Zeen Song, Wenwen Qiang, Changwen Zheng

The long-term goal of machine learning is to learn general visual representations from a small amount of data without supervision, mimicking three advantages of human cognition: i) no need for labels, ii) robustness to d…

Meta-LearningmodelSelf-Supervised Learning

Optimistic Meta-Gradients

2023-01-09 · NeurIPS 2023 11

We study the connection between gradient-based meta-learning and convex op-timisation. We observe that gradient descent with momentum is a special case of meta-gradients, and building on recent results in optimisation, w…

Meta-Learning

Meta-Gradient Reinforcement Learning

2018-05-24 · NeurIPS 2018 12 · Zhongwen Xu, Hado van Hasselt, David Silver

The goal of reinforcement learning algorithms is to estimate and/or optimise the value function. However, unlike supervised learning, no teacher or oracle is available to provide the true value function. Instead, the maj…

Meta-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Choice Between Partial Trajectories: Disentangling Goals from Beliefs

2024-10-30 · Henrik Marklund, Benjamin Van Roy

As AI agents generate increasingly sophisticated behaviors, manually encoding human preferences to guide these agents becomes more challenging. To address this, it has been suggested that agents instead learn preferences…

Deep Exploration via Bootstrapped DQN

2016-02-15 · NeurIPS 2016 12 · Ian Osband, Charles Blundell, Alexander Pritzel, Benjamin Van Roy

Efficient exploration in complex environments remains a major challenge for reinforcement learning. We propose bootstrapped DQN, a simple algorithm that explores in a computationally and statistically efficient manner th…

Atari GamesEfficient Explorationreinforcement-learningReinforcement Learning+1