Achieving O (1 /ε) Sample Complexity for Constrained Markov Decision Process
–Neural Information Processing Systems
We consider the reinforcement learning problem for the constrained Markov decision process (CMDP), which plays a central role in satisfying safety or resource constraints in sequential learning and decision-making.
Neural Information Processing Systems
Feb-16-2026, 14:41:10 GMT
- Country:
- Asia > China
- Hong Kong (0.04)
- Europe
- France > Auvergne-Rhône-Alpes
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- Greater London > London (0.04)
- North America > United States
- California > Santa Clara County > Palo Alto (0.04)
- South America > Chile
- Asia > China
- Genre:
- Research Report > Experimental Study (0.93)
- Industry:
- Education (0.48)