arXiv (All)
open access
Exponential Hardness of Off-Policy Evaluation under History-Dependent Logging
Can a logged dataset visit every hidden state frequently and still be exponentially uninformative about a target policy's value? We show that it can when the logger depends on history. For every horizon $H \ge 3$, we construct two POMDPs with at most two latent states per stage, three actions, and a
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
- Exponential Hardness of Off-Policy Evaluation under History-Dependent Logging#965398
- Nash Approximation Gap in Truncated Infinite-horizon Partially Observable Markov Games#1048624
- Epsilon-Nash Equilibria in History-Dependent SA-MDPs#1012988
- Epsilon-Nash Equilibria in History-Dependent SA-MDPs#965329
- Property-driven Causal Abstractions for Markov Decision Processes#411092
Record · ID 1013338
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