Some constraints have no budget. A robot either respects its physical limits or it doesn't — there is no "average" compliance. Our new Framework Stochastic Decision Horizons (SDH), handles budget less constraint via a continuation probability α(s, a) that enters modified discount and reward definitions: violate the constraint, and the future collapses.
SDH is the fixed-dual form of a survival-chance problem, so what it optimizes is fully characterized — not heuristic. Our algorithms AS-SAC and VT-MPO modify only the critic target, yet reach state-of-the-art gait realism on humanoid musculoskeletal control and perform competitively on Safety Gymnasium where our theory predicts they should.
Novel framework: Stochastic Decision Horizons (SDH) for enforcing every-step (instantaneous) constraints in RL.
Constraint enforcement mechanism: The effective decision horizon is attenuated by shrinking the effective discount and reward when costs are high, cutting off future return and disincentivizing violations.
Principled: SDH is the fixed-dual form of a survival-chance problem, not a heuristic termination trick.
Two algorithms: We propose AS-SAC and VT-MPO with drop-in modifications to the critic target only.
CMDP compatibility diagnostic: The violation depth profile predicts when SDH is a good CMDP surrogate; multi-scale exponential decay correctly flags all failure cases on Safety Gymnasium.
SOTA demonstration-free natural walking: Our novel instantaneous constraint formulation, solved with VT-MPO, achieves high gait realism with better sample efficiency and training stability than prior heuristic approaches.
We propose stochastic decision horizons (SDH), a theoretically grounded framework for solving constrained RL problems with every-step constraint satisfaction, a desirable property in many real-world applications. This is a different objective than the typical constrained MDP (CMDP) which has cumulative violation budget. In SDH, a constraint violation yields an effective shortening of horizon via a state-action continuation probability. Using Control as Inference, we develop the first off-policy and regularized algorithms for RL with instantaneous constraints. We identify two principled semantics for what counts as a decision after a violation. Absorbing-state semantics end the decision process, so only surviving decisions pay entropy cost, yielding max-entropy AS-SAC. Virtual-termination keeps the decision process alive while stopping reward credit, yielding KL-regularized VT-MPO. To connect SDH with CMDPs, we track how violations accumulate along trajectories (their violation-depth profile). SDH effectively weights each trajectory by the exponential of its total violation; this matches an additive CMDP budget exactly when violations occur at a single characteristic scale, and we pinpoint where it cannot: when rare, deep violations mix with frequent, shallow ones. Experiments validate the theory. On the 90-muscle H2190 humanoid (Hyfydy), VT-MPO matches state-of-the-art gait realism with 4 × fewer environment steps and substantially more stable training. On Safety Gymnasium, violation-depth profiles correctly identify the regimes in which SDH delivers strong reward-violation trade-offs.
(a) Stochastic decision horizons versus budget accounting: CMDPs treat violations as additive cost in a history-dependent budget. SDH treats violations as instantaneous (in)feasibility signals: a low continuation probability α shortens the effective planning horizon by attenuating current reward credit and future bootstrapping through. (b) Hyfydy musculoskeletal environments: We cast realistic walking as a instantaneous constraint problem formulation and reach state of the art gait realism on three highly complex musculoskeletal models. (c) Safety Gymnasium CMDP scope test: We test SDH based algorithms on the CMDPs provided in safety gymnasium and show that our diagnostic tools correctly flag failure where SDH and CMDP do not align.