Next Article in Journal
Maximum Entropy Method for Solving the Turbulent Channel Flow Problem
Next Article in Special Issue
A General Framework for Fair Regression
Previous Article in Journal
Assessment of a Stream Gauge Network Using Upstream and Downstream Runoff Characteristics and Entropy
Previous Article in Special Issue
Online Gradient Descent for Kernel-Based Maximum Correntropy Criterion
Open AccessArticle

Entropic Regularization of Markov Decision Processes

by Boris Belousov 1,* and Jan Peters 1,2
1
Department of Computer Science, Technische Universität Darmstadt, 64289 Darmstadt, Germany
2
Max Planck Institute for Intelligent Systems, 72076 Tübingen, Germany
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(7), 674; https://doi.org/10.3390/e21070674
Received: 14 June 2019 / Revised: 6 July 2019 / Accepted: 8 July 2019 / Published: 10 July 2019
(This article belongs to the Special Issue Entropy Based Inference and Optimization in Machine Learning)
An optimal feedback controller for a given Markov decision process (MDP) can in principle be synthesized by value or policy iteration. However, if the system dynamics and the reward function are unknown, a learning agent must discover an optimal controller via direct interaction with the environment. Such interactive data gathering commonly leads to divergence towards dangerous or uninformative regions of the state space unless additional regularization measures are taken. Prior works proposed bounding the information loss measured by the Kullback–Leibler (KL) divergence at every policy improvement step to eliminate instability in the learning dynamics. In this paper, we consider a broader family of f-divergences, and more concretely α -divergences, which inherit the beneficial property of providing the policy improvement step in closed form at the same time yielding a corresponding dual objective for policy evaluation. Such entropic proximal policy optimization view gives a unified perspective on compatible actor-critic architectures. In particular, common least-squares value function estimation coupled with advantage-weighted maximum likelihood policy improvement is shown to correspond to the Pearson χ 2 -divergence penalty. Other actor-critic pairs arise for various choices of the penalty-generating function f. On a concrete instantiation of our framework with the α -divergence, we carry out asymptotic analysis of the solutions for different values of α and demonstrate the effects of the divergence function choice on common standard reinforcement learning problems. View Full-Text
Keywords: maximum entropy reinforcement learning; actor-critic methods; f-divergence; KL control maximum entropy reinforcement learning; actor-critic methods; f-divergence; KL control
Show Figures

Figure 1

MDPI and ACS Style

Belousov, B.; Peters, J. Entropic Regularization of Markov Decision Processes. Entropy 2019, 21, 674.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop