arXiv (All)
open access
On the Complexity Gap Between POMDPs and Multi-Environment POMDPs
Multi-environment POMDPs (ME-POMDPs) generalize POMDPs by encoding a finite set of possible environments, capturing model uncertainty. The finite-horizon robust reward maximization problem for a ME-POMDP asks for a policy that maximizes reward in the worst environment, and recent work has shown this
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
- Finite-Time Guarantees for Constrained Reinforcement Learning under Partial Observability#1356884
- Average-Reward Reinforcement Learning for Multichain MDPs: A Hierarchical Decomposition Approach#1234693
- Average-Reward Reinforcement Learning for Multichain MDPs: A Hierarchical Decomposition Approach#1227351
- Explanation through Reward Model Reconciliation using POMDP Tree Search#163973
- Explanation through Reward Model Reconciliation using POMDP Tree Search#163014
Record · ID 1325906
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