Discovering Reinforcement Learning Algorithms

Abstract

Reinforcement learning (RL) algorithms update an agent's parameters according to one of several possible rules, discovered manually through years of research. Automating the discovery of update rules from data could lead to more efficient algorithms, or algorithms that are better adapted to specific environments. Although there have been prior attempts at addressing this significant scientific challenge, it remains an open question whether it is feasible to discover alternatives to fundamental concepts of RL such as value functions and temporal-difference learning. This paper introduces a new meta-learning approach that discovers an entire update rule which includes both 'what to predict' (e.g. value functions) and 'how to learn from it' (e.g. bootstrapping) by interacting with a set of environments. The output of this method is an RL algorithm that we call Learned Policy Gradient (LPG). Empirical results show that our method discovers its own alternative to the concept of value functi

Stats

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

Related papers

• Policy Gradient RL Algorithms As Directed Acyclic Graphs (2020)0.00
• Discovering General Reinforcement Learning Algorithms With Adversarial Environment Design (2023)0.00
• Evolving Reinforcement Learning Algorithms (2021)0.00
• Meta-gradient Reinforcement Learning With An Objective Discovered Online (2020)0.00
• Learning Self-imitating Diverse Policies (2018)0.00
• A Tutorial On Meta-reinforcement Learning (2023)10.85
• Discovering Temporally-aware Reinforcement Learning Algorithms (2024)0.00
• Replacing Rewards With Examples: Example-based Policy Search Via Recursive Classification (2021)0.00