arXiv (All)
open access
Reinforcement Learning in MDPs with Information-Ordered Policies
Many operational Markov decision processes provide structured information where a trajectory generated under one policy may also reveal how other policies would have performed. We formalize this through an information order over a parameterized policy class, writing $π_{θ'} \preceq π_θ$ when data co
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
- Single or Multiple Policies for Phase-Structured Reinforcement Learning?#1188153
- Single or Multiple Policies for Phase-Structured Reinforcement Learning?#1181655
- Ensuring Monotonic Policy Improvement in Entropy-regularized Value-based Reinforcement Learning#478231
- Don't Mix Rewards, Mix Policies: Policy Decomposition and Optimization for Multi-Reward RL#422305
- Policy Optimization Achieves Data-Dependent Regret Bounds in MDPs with Unknown Transitions#324899
Record · ID 1386193
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