Pith. sign in

REVIEW

Multi-task Reinforcement Learning with a Planning Quasi-Metric

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

classification cs.LGstat.ML
keywords quasi-metriclearningplanningreinforcementstateachieveacrossaimers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools