LGAIMLFeb 16, 2020

First Order Constrained Optimization in Policy Space

arXiv:2002.06506v235 citations
AI Analysis

This addresses safety-critical constraints in reinforcement learning for robotics, representing an incremental improvement over existing methods.

The paper tackles the problem of ensuring safety constraints in reinforcement learning by proposing FOCOPS, which maximizes reward while satisfying cost constraints, achieving better performance on constrained robotics locomotive tasks.

In reinforcement learning, an agent attempts to learn high-performing behaviors through interacting with the environment, such behaviors are often quantified in the form of a reward function. However some aspects of behavior-such as ones which are deemed unsafe and to be avoided-are best captured through constraints. We propose a novel approach called First Order Constrained Optimization in Policy Space (FOCOPS) which maximizes an agent's overall reward while ensuring the agent satisfies a set of cost constraints. Using data generated from the current policy, FOCOPS first finds the optimal update policy by solving a constrained optimization problem in the nonparameterized policy space. FOCOPS then projects the update policy back into the parametric policy space. Our approach has an approximate upper bound for worst-case constraint violation throughout training and is first-order in nature therefore simple to implement. We provide empirical evidence that our simple approach achieves better performance on a set of constrained robotics locomotive tasks.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes