arXiv cs.LG63

Learning Goal-Reaching Quasimetric Geometry From Finite-Time Reachability

· 11天前
AI 摘要

arXiv:2610.00778v1 Announce Type: new Abstract: In goal-conditioned reinforcement learning (GCRL), quasimetric learning models goal-reaching costs as quasimetric distances, connecting local constraints to global value geometry. Its local constraints, however, should reflect the direction- dependent effects of control composition over a finite horizon together with environmental feasibility. We propose ReQRL, which constrains the critic's value gradients through finite-horizon reachability. Drawing on state-constrained optimal control, we decouple dynamical reachability from boundary geometry, estimating both from data. On OGBench, our method outperforms or rivals existing quasimetric approaches and other offline GCRL methods.

查看原文(arXiv cs.LG)