Metraipolis › archive › dc_97073f750f9b

Q-Learning for Reachability in MEC-Free MDPs — arXiv:2610.01781

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01781
License (as archived)
CC0-1.0
Archived
2026-10-06T12:06:08.599Z
SHA-256 of the archived text
808feda93b2a112ae280b5b00ba2c38de8c6f5a660cafa63cb3c1ad94ee217a6
Stable URL of this page
https://metraipolis.com/documento/dc_97073f750f9b

How to cite

Q-Learning for Reachability in MEC-Free MDPs — arXiv:2610.01781 — arXiv (en), https://arxiv.org/abs/2610.01781 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_97073f750f9b (Metraipolis archive dc_97073f750f9b, sha256 808feda93b2a112ae280b5b00ba2c38de8c6f5a660cafa63cb3c1ad94ee217a6)
BibTeX
@misc{dc97073f750f9b,
  title = {Q-Learning for Reachability in MEC-Free MDPs — arXiv:2610.01781},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01781},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_97073f750f9b; sha256 808feda93b2a112ae280b5b00ba2c38de8c6f5a660cafa63cb3c1ad94ee217a6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01781. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Reinforcement learning (RL) for reachability specifications is fundamental to sequential decision-making. Prior work establishes asymptotic convergence to optimal policies, but only through model-based methods that must explicitly estimate the transition probabilities of the underlying Markov Decision Process (MDP). We present Quasar, the first model-free algorithm with asymptotic guarantees for reachability on the fragment of MDPs free of non-terminal maximal end components (MECs), a building block to which every MDP reduces by the standard MEC quotient. Our algorithm follows the classical Q-learning approach, using temporal-difference updates to converge to an optimal policy without ever learning the transition probabilities. The resulting learner reduces the memory footprint from the O(|S|^2|A|) that model-based methods require to O(|S||A|). On the standardized Quantitative Verification Benchmark Set, our algorithm converges to the optimal policy with orders of magnitude fewer samples than the previous model-based state-of-the-art. Together these results are a concrete step toward the practical deployment of reachability learning and, with it, of specification-guided RL.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-02 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Machine Learning (cs.LG); Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.01781 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T10:21:27.975Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).