Pith. sign in

REVIEW 2 cited by

Optimal Goal-Reaching Reinforcement Learning via Quasimetric Learning

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 2304.01203 v7 pith:NNOWSPE2 submitted 2023-04-03 cs.LG

Optimal Goal-Reaching Reinforcement Learning via Quasimetric Learning

classification cs.LG
keywords learningquasimetricgoal-reachingoptimalreinforcementvalueacrossadvantages
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In goal-reaching reinforcement learning (RL), the optimal value function has a particular geometry, called quasimetric structure. This paper introduces Quasimetric Reinforcement Learning (QRL), a new RL method that utilizes quasimetric models to learn optimal value functions. Distinct from prior approaches, the QRL objective is specifically designed for quasimetrics, and provides strong theoretical recovery guarantees. Empirically, we conduct thorough analyses on a discretized MountainCar environment, identifying properties of QRL and its advantages over alternatives. On offline and online goal-reaching benchmarks, QRL also demonstrates improved sample efficiency and performance, across both state-based and image-based observations.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Good Rankers, Bad Objectives: Bilinear Contrastive Critics under Expressive Policy Search

    cs.LG 2026-07 conditional novelty 6.0

    Bilinear contrastive critics remain good compatibility rankers but are unsafe to maximize for action selection; cosine bounding does not fix value decalibration, while Bellman TD-Q does.

  2. Self-Predictive Representations for Combinatorial Generalization in Behavioral Cloning

    cs.LG 2025-06 unverdicted novelty 5.0

    BYOL-γ uses self-predictive representations to approximate successor representations, improving zero-shot combinatorial generalization in goal-conditioned behavioral cloning.