arXiv (All)
open access
Exact Distinguishability in Non-Markovian Decision Processes
Non-Markovian environments are often modeled as Regular Decision Processes (RDPs), where dynamics depend on the interaction history through a finite automaton. Existing offline guarantees for RDPs rely on a distinguishability assumption on the behaviour policy but provide no means of verifying it. W
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
- Confidence Sequences for Online Statistical Model Checking of Markov Decision Processes#307062
- Task-Aware Identifiability: Observation Quotients, Statistical Geometry, and Representation Accessibility#670476
- Task-Aware Identifiability: Observation Quotients, Statistical Geometry, and Representation Accessibility#668411
- Risk-Aware General-Utility Markov Decision Processes#361468
- On the Complexity of Bayesian Signal Processing#797050
Record · ID 1156799
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