The reviewed record of science sign in
Pith

arxiv: 2002.03240 · v3 · pith:VI2NTZVD · submitted 2020-02-08 · cs.LG · stat.ML

Multi-task Reinforcement Learning with a Planning Quasi-Metric

Reviewed by Pithpith:VI2NTZVDopen to challenge →

classification cs.LG stat.ML
keywords quasi-metriclearningplanningreinforcementstateachieveacrossaimers
0
0 comments X
read the original abstract

We introduce a new reinforcement learning approach combining a planning quasi-metric (PQM) that estimates the number of steps required to go from any state to another, with task-specific "aimers" that compute a target state to reach a given goal. This decomposition allows the sharing across tasks of a task-agnostic model of the quasi-metric that captures the environment's dynamics and can be learned in a dense and unsupervised manner. We achieve multiple-fold training speed-up compared to recently published methods on the standard bit-flip problem and in the MuJoCo robotic arm simulator.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.