arXiv — cs.AI preprintsInternational2 October 2026
Q-Learning for Reachability in MEC-Free MDPs
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.01781v1 Announce Type: new Abstract: 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
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Heavy-Tailed Memory Traces in Long-Horizon Language Agents2 October 2026
- When Do Causal World Models Help Modular LLM Agents2 October 2026
- From Proposal to Verified Effect: Praxa, an Evidence-Bound Harness for Governed AI Agent Execution2 October 2026
- What Do Rationales Communicate? A Message-Intervention Study in Role-Specialized QA2 October 2026
- Measuring the Microtask Eligibility Gap: When Is an Off-the-Shelf SLM Enough for an Agent Harness?2 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.