Sign inGet started
Paper · arXiv

Last-Iterate Guarantees for Online Reinforcement Learning in Structured Constrained MDPs

In safety-critical applications, deployment uses a single policy, whose performance and constraint satisfaction should hold directly rather than only for an average or mixture of training policies. This motivates last-iterate guarantees in constrained reinforcement learning. Recent progress has established such guarantees in exact-gradient or tabular online settings, yet scalable results for structured large-state problems remain open. We develop a general, statistically efficient framework for last-iterate convergence in structured Constrained MDPs (CMDPs). Our analysis separates contraction of the regularised primal-dual dynamics from actor approximation and statistical errors in policy...

AuthorsNam Phuong Tran, Trinh Ha Mai Huynh, Tuyen Pham Le et al.
Primary categorycs.LG
Published26 September 2026
Last updated at source26 September 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/e6fda70b-19c8-40ac-a8b8-ed6ce50645a0" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.