arXiv (All)
open access
Learning Chance-Constrained MDPs with Bellman Distributional Certificates
Safe reinforcement learning (RL) commonly enforces expected-cost constraints, but such expectation safety may fail to control the probability of rare high-cost trajectories. Chance-constrained MDPs (CCMDPs) impose a stronger probability-level requirement, but are widely viewed as harder because the
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
- Balancing Risk and Reward : A General Architecture for Safe Exploration in Robotic Learning#1066030
- Q-Learning for Reachability in MEC-Free MDPs#1157052
- RLVR$^{2}$: Reinforcement Learning with Verifiable Rubric-based Ranking#1049198
- SafePG: Safe and Globally Optimal Reinforcement Learning with Hard Constraints#1083552
- BCPPO: Bachelier-Inspired Constrained Proximal Policy Optimization for Tail-Risk-Aware Safe Reinforcement Learning#799497
Record · ID 1105415
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