Reinforcement Learning via Fenchel-Rockafellar Duality

By Ofir Nachum, Bo Dai. 2020

137 citations recorded by the source corpus.

We review basic concepts of convex duality, focusing on the very general and supremely useful Fenchel-Rockafellar duality. We summarize how this duality may be applied to a variety of reinforcement learning (RL) settings, including policy evaluation or optimization, online or offline learning, and discounted or undiscounted rewards. The derivations yield a number of intriguing results, including the ability to perform policy evaluation and on-policy policy gradient with behavior-agnostic offline data and methods to learn a policy via max-likelihood optimization. Although many of these results have appeared previously in various forms, we provide a unified treatment and perspective on these results, which we hope will enable researchers to better use and apply the tools of convex duality to make further progress in RL.

Subfields: Artificial Intelligence, Cognitive Neuroscience, Reinforcement Learning, Mathematical Optimization

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Ofir Nachum
  3. Pieter Abbeel
  4. Chelsea Finn
  5. Aviral Kumar
  6. George Tucker
  7. Ilya Kostrikov
  8. Aravind Rajeswaran

In Cognitive Neuroscience

  1. Aviral Kumar
  2. George Tucker
  3. Ilya Kostrikov
  4. Ofir Nachum
  5. Aravind Rajeswaran
  6. Justin Fu
  7. Sergey Levine
  8. Nan Jiang

In Reinforcement Learning

  1. Sergey Levine
  2. Ofir Nachum
  3. Aviral Kumar
  4. Pieter Abbeel
  5. Chelsea Finn
  6. George Tucker
  7. Aravind Rajeswaran
  8. Ilya Kostrikov

In Mathematical Optimization

  1. Nan Jiang
  2. Jiawei Huang
  3. Ilya Kostrikov
  4. Rahul Kidambi
  5. Praneeth Netrapalli
  6. George Tucker
  7. Ofir Nachum
  8. Aravind Rajeswaran

Citations in the corpus