A Policy Gradient Method for Task-Agnostic Exploration - Crossminds
CrossMind.ai logo
A Policy Gradient Method for Task-Agnostic Exploration
Jul 14, 2020
This video summarizes our paper "A Policy Gradient Method for Task-Agnostic Exploration", to be presented at the 4th Lifelong Learning Workshop at ICML, 2020. Authors: Mirco Mutti, Lorenzo Pratissoli, and Marcello Restelli Abstract: In a reward-free environment, what is a suitable intrinsic objective for an agent to pursue so that it can learn an optimal task-agnostic exploration policy? In this paper, we argue that the entropy of the state distribution induced by limited-horizon trajectories is a sensible target. Especially, we present a novel and practical policy-search algorithm, Maximum Entropy POLicy optimization (MEPOL), to learn a policy that maximizes a non-parametric, k-nearest neighbors estimate of the state distribution entropy. In contrast to known methods, MEPOL is completely model-free as it requires neither to estimate the state distribution of any policy nor to model transition dynamics. Then, we empirically show that MEPOL allows learning a maximum-entropy exploration policy in high-dimensional, continuous-control domains, and how this policy facilitates learning a variety of meaningful reward-based tasks downstream.
ICML 2020
Reaction (0) | Note (0)
    📝 No reactions and notes yet
    Be the first one to share your thoughts!