arXiv (All)
open access
Q-Learning for Reachability in MEC-Free MDPs
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 Decisi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Chance-Constrained MDPs with Bellman Distributional Certificates#1105415
- RLVR$^{2}$: Reinforcement Learning with Verifiable Rubric-based Ranking#1049198
- Joint MDPs and Reinforcement Learning in Coupled-Dynamics Environments#614949
- Joint MDPs and Reinforcement Learning in Coupled-Dynamics Environments#613982
- What is the difference between off-policy and on-policy learning?#787307
Record · ID 1157052
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive