arXiv (All)
open access
Toward Optimal Regret in Adversarial MDPs with Stochastic Hard Constraints
We study episodic constrained Markov decision processes with adversarial losses under stochastic hard constraints. Specifically, starting from a known strictly feasible policy with margin $d$, we seek to obtain optimal regret while satisfying the expected cost constraints in every episode. In this s
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
- Safe-Support Q-Learning: Learning without Unsafe Exploration#141500
- Epsilon-Nash Equilibria in History-Dependent SA-MDPs#1012988
- Epsilon-Nash Equilibria in History-Dependent SA-MDPs#965329
- CSPO: Constraint-Sensitive Policy Optimization for Safe Reinforcement Learning#271892
- Policy Gradients for Cumulative Prospect Theory in Reinforcement Learning#974163
Record · ID 1249577
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