Sign inGet started
Paper · arXiv

Completion vs Optimality: Policy Gradient in Long-Horizon Cumulative-Damage Problems

Long-horizon decision problems with cumulative damage couple locally attractive actions to globally adverse outcomes. We identify two orthogonal failure modes for policy-gradient methods on this class and propose a decomposition that separates them: \emph{completion} (reaching the terminal horizon rather than exiting via an implicit terminal constraint) and \emph{optimality} (matching the dynamic-programming reference given completion). Under PPO with a linear soft penalty, granting horizon access alone reduces the completion rate: the penalty's equilibrium drives the dominant-activity share to zero, while action-space restriction combined with horizon access achieves completion but leave...

AuthorsWolfgang Maass, Sabine Janzen
Primary categorycs.AI
Published26 May 2026
Last updated at source26 May 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/9cb2d7a9-bda1-4b3b-84d9-6141ffb33fe5" 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.