betaFeedback

WorksComputer Science

Certify, Then Select: Viability-Aware Runtime Steering of Frozen Diffusion Policies

Abstract

Diffusion policies, which generate short action sequences by denoising random noise, are a leading way to learn robot skills from demonstrations. Once deployed, they meet constraints the demonstrations never contained, and retraining for each is impractical. A safety filter edits the policy's action to satisfy them, but the edit ignores the task, and a large edit can leave the policy where it cannot continue. We propose CAST (Certified Action Selection at Test time): draw a few action chunks from the frozen policy, certify each with a barrier condition, and execute the certified chunk that a learned value ensemble ranks highest. We prove that a certified step is safe whatever the critic does; that, whenever a certified sample exists, the executed chunk stays within log N nats of the policy conditioned on feasibility, while a safety-filter projection can be singular to it; and that an exact closed-loop identity splits the gain of ranking into availability, spread and the critic's target. Certifying the next chunk is not enough: a generative controller can have safe actions available now and none later. We characterise the safe control authority of a frozen policy under finite sampling, and CAST-V preserves it through a policy-conditioned viability, estimated with a model under a finite-sample guarantee or learned from the controller's own logs (CAST-VL). On robomimic manipulation, a planar quadrotor, a MuJoCo humanoid and a unicycle, with frozen policies, CAST raises joint task-and-constraint success above the output filter in nearly every setting; certifying before ranking is decisive where a filter's edit is large, and viability removes most dead ends that one-step certification cannot see. Project page: https://clmoro.github.io/cast.

Introduction

Diffusion policies learn dexterous manipulation from demonstrations [9]. Once deployed, a policy meets constraints its demonstrations never contained: a person reaches across the table, a shelf is mounted above the workspace, the commanded effort must stay within a budget. Retraining for each is impractical. We want to enforce a constraint that arrives at run time, a request, on a policy that stays frozen.

The classical tool is a safety filter: take the action the policy proposes and edit it as little as needed for a certificate, such as a control barrier function, to hold [3, 34, 17]. Variants for diffusion policies apply the same edit inside the denoising loop [37, 28]. An edit answers the question “is this action safe?”. It does not ask whether the task can still be completed. A small edit leaves the policy as good or as bad as it was. A large one, as under an effort budget or when a zone blocks the policy’s route, leaves the robot where the policy has no data, and it stalls (Figure 1a). Neither helps the task: in our experiments no method that keeps the policy and has no critic reliably beats the plain output filter in joint task-and-request success (Table 1).

Figure 1. Edit or select. A keep-out zone, unseen in training, blocks one of the two routes of a frozen unicycle policy. (a) A safety filter keeps the robot in the safe set h≥0h \ge0 (shading: the barrier), but its rollouts on the blocked route stall at the zone: the policy never learned to continue from there (40 rollouts, with counts). (b) Viability vv of the policy’s certified chunks, by simulation: the probability that it keeps sampling certified chunks over the next 8 decisions. Certified chunks exist in the red region too, but lead to a dead end; of the N=8N = 8 drawn at one decision four head into it, and CAST-V executes a viable one. (c) The same map from a network trained on the controller’s logs, without model rollouts (CAST-VL): its boundary v=0.5v = 0.5 (black) follows the simulated one (white) where the rollouts pass. (d) Joint success on 500 unseen zones per policy; CAST, CAST-V and CAST-VL use the task critic, MPPI the model, map and goal.

MethodR1 moving obstacleR2 fast obstacleR3 effort budgetR4 ceiling + wallR5 pillarmax. viol. (%)
Frozen policy0.340.280.000.080.1773.5
Output filter (CBF-QP)0.610.490.370.470.532.5
In-denoising projection0.600.510.390.450.521.0
DPCC0.580.570.510.400.531.5
Latent noise optimisation0.590.430.260.420.471.5
Critic-free selection0.600.530.390.470.491.5
Select-then-filter0.890.810.460.720.861.5
CAST0.890.850.700.790.860.5
CAST + guard0.900.860.700.800.890.5

Table 1. Robomimic Can, joint success under five requests (200 paired episodes each). Methods without a critic stay within 0.08 of the output filter except under R3; CAST adds 0.28–0.36 to it. The R3 filter caps every chunk; with CAST’s cap it reaches 0.46 on Figure 3b’s scenarios (CAST: 0.71).

© 2027 A. Moroncelli & L. Roveda.

A diffusion policy offers a resource that a deterministic controller lacks: for one observation it can propose many different, equally plausible actions. CAST (Certified Action Selection at Test time, Algorithm 1) uses this resource twice. It draws a few action chunks from the frozen policy, certifies each against the request, and executes the certified chunk that a value ensemble ranks highest. Only if no sample is certified does it fall back to the filter. The certificate provides safety, the critic provides task success, and whenever a certified sample exists the executed action is one the policy itself produced. But certification looks one step ahead, and a generative controller can have safe actions available today but lack safe behaviours tomorrow. Runtime constraint steering should preserve the learned policy’s future control authority, not merely certify its next action: CAST-V prefers chunks after which certified samples remain likely (Figure 1b).

Contributions

  • Method. CAST enforces a runtime request on a frozen diffusion policy by certifying sampled chunks and then ranking the certified ones (§ 4). It needs no retraining and one batched sampling pass per decision (15 ms on Can). Select-then-filter, which uses the same samples and critic but reverses the order, isolates the benefit of certifying before ranking.

  • Theory (§ 5; proofs in Appendix § 8). Four results say what each ingredient provides; the first three specialise known tools to sampling, certifying and selecting, and the fourth is the new object. Safety: a certified step is safe whatever the critic does, and one conformal calibration bounds the forecast risk for every controller (Theorem 1). Faithfulness: when a certified sample exists, selection stays within log⁡N\log N nats of the policy conditioned on feasibility, whereas a projection can leave its support (Theorem 2). Performance: an exact closed-loop identity says when ranking improves the task, through availability, spread and

the critic’s target (Theorem 3). Authority: the best any selection rule can do with NN samples to keep certified actions available grows with NN only up to what the policy samples with positive probability (Proposition 4); CAST-V and CAST-VL estimate it.

  • Evidence (§ 6). On robomimic, a quadrotor, a humanoid and a unicycle, with frozen policies and eight samples, CAST beats the output filter in nine of ten settings (Figure 5a; the tenth, a crossing pedestrian, is a tie). The critic supplies most of this gain; certifying before ranking adds to it where the edit is large (Can, b=0.15b = 0.15: 0.53 against 0.16 for select-then-filter). Where a zone blocks a learned route, CAST-V restores availability (unicycle 0.99, against 0.81 for CAST), and CAST-VL does so from logs, without simulating continuations (quadrotor 0.98; MPPI 0.61).

Figure 5. Every setting at a glance. Paired differences in joint success with 95 % bootstrap intervals over shared scenarios. (a) CAST minus the output filter (for budgets: scaling the policy’s own chunk), task critic unless the setting has only a request-conditioned one. (b) CAST minus select-then-filter with the same samples and critic (pedestrian: the request-conditioned pair): certifying first adds where the filter’s edit is large (the budgets on Can and on the quadrotor) and is level or slightly behind elsewhere (small detours; mild scalings on Square and the humanoid). (c) CAST-V minus CAST with the same critic: large where a certified step can lead into a state from which the policy cannot continue (a blocked route, a crossing pedestrian, a fall under the humanoid’s budget), small under the quadrotor’s energy budget, level on Square and negative on Can’s new geometries and budgets, where CAST’s own choice is already viable and keeping options open costs progress. Pooled cells as in the main text and Table 2.

Related work. Safety filters correct a nominal input [3, 34, 17, 25, 25, 18]; shielding and sampling-based filters reject unsafe actions without a task model [2, 26]. Constrained diffusion edits the denoising iterates [37, 28, 13, 29] or the input noise [8]. Safety critics, recovery regions and viability can be learned from data [31, 32, 35] (Zheng et al. 2024), and planning over random action sets is classical [7]; CAST-V asks whether a fixed generative controller will keep sampling certified actions under a request it never saw. Sample-and-rank methods choose among policy samples by value [12, 24], density [30] or a verifier [20], without certificates. We analyse how sampling, rejection and ranking interact in frozen generative control, including when they cannot help, with information projection [11], performance differences [19] and conformal prediction [21, 10].

Problem

Policy. At decision kk a frozen generative policy maps the observation oko_k and a latent x∼N(0,I)x \sim\mathcal{N}(0, I) to a chunk a=G(ok,x)a = G(o_k, x) of commands, whose first TT are executed in open loop; the law of G(ok,x)G(o_k, x) is the policy π(⋅∣ok)\pi(\cdot\mid o_k), which we may sample but not change.

Requests. A request constrains a robot quantity ptp_t (the hand position, or the speed) against a hazard with state ξt\xi_t: it holds at time tt if h(pt,ξt)≥0h(p_t, \xi_t) \ge0, where the barrier hh is 1-Lipschitz in each argument, as a signed distance is. A budget asks that the average command effort stay below bb: Sk≤bkS_k \le bk at every decision, with Sk=∑i<kc(aˉi)S_k = \sum_{i<k} c(\bar{a}_i) the effort of the executed chunks aˉi\bar{a}_i.

Certificate. A certificate provides a prediction p^k,j(a)\hat{p}_{k,j}(a) of the robot (known or learned [23]) and a forecast ξ^k,j\hat{\xi}_{k,j} of the hazard over the TT steps of the chunk and HH further steps of a backup that holds or brakes. A chunk is certified if

min⁡1≤j≤T+H[h(p^k,j(a),ξ^k,j)−δ−qk,j−rk,j]≥0.(1)\min_{1 \le j \le T+H} \left[h\left(\hat{p}_{k,j}(a),\hat{\xi}_{k,j}\right)-\delta-q_{k,j}-r_{k,j}\right] \ge0. \tag*{(1)}

The margins δ\delta and qk,jq_{k,j} absorb predictor and forecast errors; with hkh_k the barrier at the start of the chunk, rk,j=(1−α)jmax⁡(hk,0)r_{k,j} = (1-\alpha)^j \max(h_k,0) with α∈(0,1]\alpha\in(0,1] for j≤Tj \le T (zero afterwards) is the discrete-time barrier condition [1]. For a budget, a chunk is certified if Sk+c(a)≤b(k+1)S_k+c(a)\le b(k+1). We write Fk\mathcal{F}_k for the set of certified chunks and βk=π(Fk∣ok)\beta_k=\pi(\mathcal{F}_k\mid o_k) for the feasible fraction: Algorithm 1: CAST, one decision. Inputs: observation oo, frozen policy GG, certificate, value ensemble Q1,…,QJQ_1,\ldots,Q_J, number of samples NN.

draw x0,…,xN−1∼N(0,I)x_0,\ldots,x_{N-1} \sim\mathcal{N}(0,I); decode ai=G(o,xi)a_i=G(o,x_i) in one batch // sample

F←{i:ai is certified}F \leftarrow\{i:a_i\text{ is certified}\} // certify

if F≠∅F\ne\emptyset then return ai⋆a_{i^\star}, i⋆=arg⁡max⁡i∈F 1J∑rQr(o,ai)i^\star=\underset{i\in F}{\arg\max}\ \frac{1}{J}\sum_r Q_r(o,a_i) // select

else return the fallback: an output filter’s correction of a sample, or the backup

the probability that one sample of the policy is certified. When we argue with the closed-loop state ss we write π(⋅∣s)\pi(\cdot\mid s), F(s)\mathcal{F}(s) and β(s)\beta(s). The goal is joint success: task completed, request kept at every step.

CAST: Certify, Then Select

Algorithm 1 is CAST; CAST-V changes only the select line. A correction need not end certified; the backup of the last certified chunk was certified with it (Proposition 6, Table 5).

ControllerFallbackper-step margins (Figure 11) Jointper-step margins (Figure 11) Contact (%)episode margins (Theorem 1(b)) Jointepisode margins (Theorem 1(b)) Contact (%)
Filteredit0.721.50.610.9
Filterbackup0.843.50.762.0
CASTedit0.732.40.600.7
CASTbackup0.873.70.811.3
CAST-Vedit0.821.00.910.0
CAST-Vbackup0.913.30.930.0
CAST-VLedit0.950.10.890.0
CAST-VLbackup0.950.10.900.0
CAST, log criticedit0.980.10.930.1
CAST, log criticbackup0.980.10.940.0

Table 5. The fallback, edit or certified backup, with the crossing pedestrian (three policies ×\times 500 shared scenarios, the controllers of Figure 11). “Edit”: the output filter’s correction, executed even if it does not end certified. “Backup”: instead, the rest of the braking backup certified with the last certified chunk (Proposition 6). Left: the per-step forecast margins of Figure 11; right: margins calibrated over whole episodes (ε=0.05\varepsilon= 0.05), as Theorem 1(b) assumes. No contact began in a certified chunk in any of the 30 000 episodes. With edits, every contact began in an uncertified correction (76 of 76, per-step margins). With the backup and episode margins, no contact occurred during a certified step; all 50 came after the backup had brought the robot to rest. With per-step margins, which give no episode-level guarantee, 48 contacts fell inside the backup’s certified steps. Joint success with the backup minus with edits, episode margins: filter +0.15 [+0.11, +0.18], CAST +0.21 [+0.18, +0.24], CAST-V +0.02 [+0.01, +0.03].

Certify first. The certificate is checked before any value is consulted, so the critic never trades safety against task progress and ranks exactly the chunk that is executed. The opposite order, select-then-filter, edits the critic’s favourite and can execute a chunk the critic never scored.

A critic that needs no request. The ensemble (J=5J=5 small networks) regresses the discounted task success of the frozen policy’s rollouts, estimating QπQ^\pi, once and before any request is known. The unanimity guard variant keeps a certified a0a_0 unless every member prefers another.

A critic that knows the request. When a request changes which behaviour succeeds, as a zone blocking the preferred route does, we condition the critic on it: since the hazard ignores the robot, recorded frozen-policy rollouts can be relabelled with randomly drawn requests (success only if the request is kept from the current step on), with the request parameters as extra inputs.

Staying able to act (CAST-V). A certified chunk can lead to a state from which the frozen policy rarely samples a certified continuation, for example in front of a zone that blocks the route it has started. Define the viability v(s,a)v(s,a) of a certified chunk aa at state ss as the probability that, after aa, the critic-free certified controller with mm samples finds a certified sample at each of the next LL decisions, or reaches the goal first. CAST-V estimates it online by the fraction of MM model rollouts from the candidate’s end state that do so, executes the highest-value candidate with estimate at least vmin⁡v_{\min}, and the most viable one if there is none. No critic is retrained; the cost is up to NMmLNMmL extra samples per decision (mm per continuation step; Table 3). Learned viability (CAST-VL) simulates nothing: its only model is the certificate’s one-chunk prediction. Each chunk in logs of the critic-free controller is labelled 1 if the next LL decisions all had a certified sample and nothing failed; an ensemble fitted to these labels replaces the rollouts.

SystemControllerPolicy samplesModel stepsmsJoint success
UnicycleCAST, N=8N = 88961.70.81
Select-then-filter8121.50.86
MPPI (256 samples, horizon 20)05 1200.90.91
CAST, N=256N = 2562563 07233.00.37
CAST, N=1024N = 1024102412 288146.40.14
CAST-V, L=8L = 8≤1032\le1 032≤13408\le13 40818.40.99
CAST-VL8961.70.95
QuadrotorCAST, N=8N = 882642.80.68
Select-then-filter8333.50.69
MPPI (512 samples, horizon 100)051 20013.60.61
CAST, N=256N = 2562568 44857.10.58
CAST, N=1024N = 1024102433 792231.00.55
CAST-V, L=16L = 16≤2056\le2 056≤71944\le71 944135.70.93
CAST-VL82642.90.98

Table 3. Compute per decision on the zone tasks (task critic, mean of three policies). Policy samples and simulated model steps are per decision (CAST-V: worst case N+NMmLN + NMmL samples, certificate rollouts of every sample and NMLNML simulated chunks; lazy search and early stops use fewer); ms: measured, one CPU thread, 500 episodes batched. CAST with N=256N = 256 and N=1024N = 1024 gives the plain selector about as many samples as CAST-V’s unicycle worst case; CAST-VL adds one network call to CAST.

Theory: What the Certificate, the Samples and the Critic Each Provide

Safety comes from the certificate, not from the critic

Assumption 1 (Prediction errors) On every executed step the robot is within δ\delta of its prediction and the hazard within qk,jq_{k,j} of its forecast: ∥pkT+j−p^k,j(aˉk)∥≤δ\lVert p_{kT+j}-\hat{p}_{k,j}(\bar{a}_k)\rVert\le\delta and ∥ξkT+j−ξ^k,j∥≤qk,j\lVert\xi_{kT+j}-\hat{\xi}_{k,j}\rVert\le q_{k,j} for j≤Tj\le T. The initial state is safe.

The forecast margins can be calibrated once, for a whole episode of at most Kmax⁡K_{\max} decisions. Fix a miscoverage level ε∈(0,1)\varepsilon\in(0,1) and scales σk,j>0\sigma_{k,j} > 0 and score a recorded hazard episode by its largest normalised forecast error, Σ=max⁡k<Kmax⁡, j≤T+H∥ξ^k,j−ξkT+j∥/σk,j\Sigma= \max_{k<K_{\max},\,j\le T+H} \lVert\hat{\xi}_{k,j} - \xi_{kT+j} \rVert/\sigma_{k,j}. From n≥1/εn \ge1/\varepsilon calibration episodes take the ⌈(n+1)(1−ε)⌉\lceil(n+1)(1-\varepsilon)\rceil-th smallest score sεs_\varepsilon and set qk,j=sεσk,jq_{k,j}=s_\varepsilon\sigma_{k,j}.

Theorem 1 (Safety). (a) Under Assumption 1, the request holds on every step of every certified chunk that is executed, for any number of samples, any critic and any selection rule. (b) Suppose the initial state is safe, the hazard, its tracker and its forecaster do not depend on the robot, and calibration and deployment episodes are exchangeable. With the margins above, for every controller and jointly over calibration and deployment,

P[h(pt,ξt)<0 for some t]≤ε+P[B],(2)\mathbb{P}\left[h(p_t,\xi_t)<0\text{ for some }t\right] \le\varepsilon+\mathbb{P}[B], \tag*{(2)}

where BB is the event that at some executed step ∥pt−p^k,j∥>h(p^k,j,ξ^k,j)−qk,j\lVert p_t-\hat{p}_{k,j}\rVert> h(\hat{p}_{k,j},\hat{\xi}_{k,j})-q_{k,j}; for a certified chunk the threshold h(p^k,j,ξ^k,j)−qk,jh(\hat{p}_{k,j},\hat{\xi}_{k,j})-q_{k,j} is at least δ\delta, so BB requires a prediction error above δ\delta.

In words. (a) The critic can be arbitrarily wrong without making a certified step unsafe. (b) The hazard ignores the robot, so one calibration of the forecast serves a filter and CAST alike (Table 11); the robot’s own prediction error, P[B]\mathbb{P}[B], is not calibrated. With an exact predictor, the last certified chunk’s backup keeps a static request (Proposition 5) and, on the calibration event, a moving one through its HH steps (Proposition 6).

Table 11: Episode-level calibrated safety on Can (200 episodes per cell; CAST with the unanimity guard). sεs_\varepsilon: margin factor over the per-step 0.99 margins. †The per-step margins that apply after the first decision, the reference for sεs_\varepsilon.

Marginssεs_\varepsilonmiscoverage offline, all decisionsmiscoverage closed loopcollisionP^[B]\hat{P}[B]joint successCAST − filter
ε=0.5\varepsilon= 0.51.070.5050.400 / 0.4150.000 / 0.0050.080 / 0.0450.69 / 0.43+0.27 [+0.18,+0.34]
ε=0.2\varepsilon= 0.21.170.1850.165 / 0.1850.000 / 0.0000.090 / 0.0900.67 / 0.39+0.28 [+0.20,+0.36]
ε=0.05\varepsilon= 0.051.300.0410.045 / 0.0550.000 / 0.0000.120 / 0.1100.64 / 0.38+0.26 [+0.18,+0.34]
per step 0.99†1.000.7330.565 / 0.6250.000 / 0.0000.055 / 0.0300.70 / 0.47+0.23 [+0.15,+0.31]

Table 11. Episode-level calibrated safety on Can (200 episodes per cell; CAST with the unanimity guard). sεs_\varepsilon: margin factor over the per-step 0.99 margins. †The per-step margins that apply after the first decision, the reference for sεs_\varepsilon.

A certified sample stays close to the policy; a projection does not

Fix one decision and its state. Write F\mathcal{F} for the certified set, β=π(F)>0\beta=\pi(\mathcal{F})>0 for the feasible fraction, and πF=π(⋅∣F)\pi_{\mathcal{F}}=\pi(\cdot\mid\mathcal{F}) for the policy conditioned on being certified. A batch of NN independent samples contains a certified one with probability pN=1−(1−β)Np_N=1-(1-\beta)^N, the availability.

Theorem 2 (Distance to the policy). (i) Among all action distributions that produce only certified chunks, πF\pi_{\mathcal{F}} is the unique closest to the policy in relative entropy, at distance KL⁡(πF∥π)=log⁡(1/β)\operatorname{KL}(\pi_{\mathcal{F}}\mathbin\Vert\pi)=\log(1/\beta). Executing the first certified sample of a batch, when there is one, draws exactly from πF\pi_{\mathcal{F}}. (ii) Let ρ\rho be the law of the chunk that CAST executes, given that the batch contains a certified sample, with any critic and any rule. Then

log⁡1β≤KL⁡(ρ∥π)≤log⁡1β+log⁡NβpN≤log⁡1β+log⁡N.(3)\log\frac{1}{\beta}\le\operatorname{KL}(\rho\mathbin\Vert\pi)\le\log\frac{1}{\beta}+\log\frac{N\beta}{p_N}\le\log\frac{1}{\beta}+\log N. \tag*{(3)}

(iii) Suppose π\pi has a density and a filter maps a set of actions of positive probability onto a set of zero volume, as a projection onto the boundary of the certified set does. Then, with positive probability, the filter’s output lies in a set ZZ with π(Z)=0\pi(Z)=0: its law is not absolutely continuous with respect to π\pi, and its relative entropy to the policy is infinite.

In words. Enforcing a request costs at least log⁡(1/β)\log(1/\beta); selecting pays at most log⁡N\log N more, as in best-of-NN alignment ([5]), and executes a chunk the policy could have produced. A projection leaves the policy’s support, however small the edit; how much that matters depends on where the chunk lands (Proposition 4, § 6.3). Our fallbacks fall under (iii).

What ranking adds, and what limits it

Compare CAST with the same controller without a critic. Let μ0\mu_0 be critic-free selection (execute the first certified sample) and μ\mu be CAST; both use the same NN, certificate and fallback law on an empty batch. Let VμV^\mu and V0V^0 denote their expected joint success over an episode of at most Kmax⁡K_{\max} decisions, and Q0(s,a)Q^0(s,a) the value of executing aa in state ss and following μ0\mu_0 afterwards; here ss is the closed loop’s Markov state (robot, hazard, time, spent budget, memory, violation flag). At a state with batch a0,…,aN−1a_0,\ldots,a_{N-1}, let FF be the indices of the certified samples and aˉ\bar{a} the chunk CAST executes, and define

ΩN(s)=E[max⁡i∈FQ0(s,ai)∣F≠∅]−Ea∼πFQ0(s,a)(the most any ranking can gain),\Omega_N(s)=\mathbb{E}\left[\max_{i\in F}Q^0(s,a_i)\mid F\ne\varnothing\right]-\mathbb{E}_{a\sim\pi_F}Q^0(s,a) \qquad\text{(the most any ranking can gain),}
ΛN(s)=E[max⁡i∈FQ0(s,ai)−Q0(s,aˉ)∣F≠∅](what the critic’s errors lose),\Lambda_N(s)=\mathbb{E}\left[\max_{i\in F}Q^0(s,a_i)-Q^0(s,\bar{a})\mid F\ne\varnothing\right] \qquad\text{(what the critic’s errors lose),}

both zero where β(s)=0\beta(s)=0.

Theorem 3 (Closed-loop gain of ranking) Let dkμd_k^\mu be the distribution of the state that CAST visits at decision kk. Then

Vμ−V0=∑k<Kmax⁡Es∼dkμ[pN(s){ΩN(s)−ΛN(s)}].(4)V^\mu-V^0=\sum_{k<K_{\max}}\mathbb{E}_{s\sim d_k^\mu}\left[p_N(s)\{\Omega_N(s)-\Lambda_N(s)\}\right]. \tag*{(4)}

With σF2(s)\sigma_F^2(s) the variance of Q0(s,a)Q^0(s,a) under πF\pi_F,

0≤pNΩN≤σF(Nβ−pN)/2≤σF(N−1)/2.(5)0\le p_N\Omega_N\le\sigma_F\sqrt{(N\beta-p_N)/2}\le\sigma_F\sqrt{(N-1)/2}. \tag*{(5)}

Suppose CAST executes the certified sample with the highest score Q^\hat{Q}, and there are an offset u(s)u(s) and a set EE of chunks with πF(E)≤η\pi_F(E)\le\eta such that ∣Q^(s,a)−Q⋆(s,a)−u(s)∣≤ϵQ\lvert\hat{Q}(s,a)-Q_\star(s,a)-u(s)\rvert\le\epsilon_Q for every certified aa outside EE, for some target Q⋆Q_\star. Then

ΛN≤2ϵQ+E[osc⁡i∈F(Q0−Q⋆)(s,ai)∣F≠∅]+1−(1−η)N,(6)\Lambda_N\le2\epsilon_Q+\mathbb{E}\left[\operatorname{osc}_{i\in F}(Q^0-Q_\star)(s,a_i)\mid F\ne\varnothing\right]+1-(1-\eta)^N, \tag*{(6)}

where osc⁡\operatorname{osc} is the largest minus the smallest value. A critic that is exact for Q0Q^0 gives Vμ≥V0V^\mu\ge V^0.

In words: three levers. Ranking helps only if three things meet on the states CAST visits. Availability pNp_N: a certified sample must exist. Spread σF\sigma_F: certified samples must differ in value; what ranking can gain grows at most as N\sqrt{N}. A reliable critic for the right target: a task critic (Q⋆=QπQ_\star=Q^\pi) suffices unless the request changes which certified samples succeed, as when a zone blocks the policy’s preferred route. The last term grows with NN: keep NN small for a weak critic.

Availability along the way. Certification constrains the next chunk only, so availability can be lost later: a certified chunk may lead to states where the policy rarely samples a certified continuation. Write ff for the (exact, deterministic) state transition of a chunk. If from every state of a set K\mathcal{K} one sample is certified and leads back into K\mathcal{K} with probability at least βmin⁡\beta_{\min}, a controller that executes such samples keeps one available for ℓ\ell decisions except with probability ℓ(1−βmin⁡)\ell(1-\beta_{\min}) (Proposition 7, Appendix § 8). Viability theory (Aubin, [4]) and reachability (Nakamura et al., [25]) compute viable sets from the dynamics alone; this one depends on the policy (Figure 8).

Safe set, feasible fraction and viability

Figure 8. Safe set, feasible fraction and viability. Unicycle (Figure 1’s zone) and quadrotor (Figure 4a’s zone), on a slice of the state space (heading at the goal and cruise speed; level flight): (a) the CBF safe set h≥0h \ge0 that a filter protects, with ∇h\nabla h; (b) the feasible fraction β(s)\beta(s), the share of 64 frozen-policy chunks the certificate accepts; (c) CAST-V’s viability estimate at the state, v(s)v(s): the fraction of 16 critic-free certified continuations started at ss that find a certified sample at each of the next L=8L = 8 decisions (a chunk’s viability is vv at the state it leads to), its region v≥0.5v \ge0.5 (dashed) and 40 rollouts per controller with this zone fixed, as mean ±\pm sd per route and outcome (filter: grey; CAST-V: dark blue; crosses: a group that stalls or crashes). States inside the safe set and with certified samples available can still be dead ends for this policy; the filter’s rollouts end there, CAST-V’s avoid them. Humanoid (effort budget 0.55; 16 scenarios): the certified region of the budget, torso height with the fall threshold, and distance walked; the filter rides the cap and falls in 15 of 16, CAST-V in 1. Illustration data, not scored.

A controller is selection-only with NN samples if at each decision it executes a certified one of NN fresh samples of π(⋅∣s)\pi(\cdot\mid s), and fails if none is certified. Define the safe control authority of the frozen policy by W0,N≡1W_{0,N}\equiv1 and Wℓ,N(s)=Emax⁡i:ai∈F(s)Wℓ−1,N(f(s,ai))W_{\ell,N}(s)=\mathbb{E}\max_{i:a_i\in\mathcal{F}(s)}W_{\ell-1,N}(f(s,a_i)), the expectation over a0:N−1∼π(⋅∣s)a_{0:N-1}\sim\pi(\cdot\mid s), with max⁡∅=0\max\varnothing=0 and Wℓ,N=1W_{\ell,N}=1 at goal states, which are absorbing.

Proposition 4 (Finite-sampling generative control authority). Under the regularity conditions of Appendix § 8: (i) Wℓ,N(s)W_{\ell,N}(s) is the largest probability, over selection-only controllers with NN samples, that each of the first ℓ\ell batches contains a certified sample or a goal state is reached first; executing arg max⁡i:ai∈F(sk)Wℓ−k−1,N(f(sk,ai))\operatorname*{arg\,max}_{i:a_i\in\mathcal{F}(s_k)} W_{\ell-k-1,N}(f(s_k,a_i)) at decision kk attains it. (ii) Wℓ,NW_{\ell,N} is nondecreasing in NN; Wℓ,1W_{\ell,1} is the probability that the policy’s own samples are certified for ℓ\ell decisions. (iii) As N→∞N \to\infty, Wℓ,N↑Wℓ,∞∈{0,1}W_{\ell,N} \uparrow W_{\ell,\infty} \in\{0,1\}, with Wℓ,∞(s)=1W_{\ell,\infty}(s) = 1 if and only if π({a∈F(s):Wℓ−1,∞(f(s,a))=1}∣s)>0\pi(\{a \in\mathcal{F}(s): W_{\ell-1,\infty}(f(s,a)) = 1\} \mid s) > 0: viability up to π\pi-null sets of chunks, and 0 wherever the certified chunks with Wℓ−1,∞=1W_{\ell-1,\infty} = 1 form a π\pi-null set, even if such chunks exist.

In words. Safe control authority belongs to the dynamics, the request and the frozen policy with its NN samples: sampling helps up to π\pi-null sets and no further, and a filter reaches beyond them only by leaving the policy’s distribution (Theorem 2). CAST-V’s v(s,a)v(s,a) is the success probability of one selection-only controller from f(s,a)f(s,a), so v(s,a)≤WL,m(f(s,a))v(s,a) \le W_{L,m}(f(s,a)) (estimation error: Proposition 8). The Bellman-style recursion follows established planning over random action sets ([7, 14]). Our contribution is its interpretation as the finite-sampling safe-control authority of a frozen generative policy.

Experiments

Setup. Systems: robomimic ([22]) Can with the state-based and camera-only diffusion policies released with DPPO ([27]), and Square with three diffusion policies trained on human demonstrations; a unicycle with known dynamics whose policies pass an obstacle above or below; a planar quadrotor and the MuJoCo humanoid, three policies each. Requests: a cylinder sweeping across the workspace; keep-out volumes; a budget on command effort. Baselines: the output filter (a CBF-QP on the chunk; scaling for a budget), projection inside the denoising loop ([37]), DPCC ([28]), noise optimisation ([8]), critic-free selection, select-then-filter, a predictive safety filter ([34]), and MPPI ([36]), which plans with the model, map and goal; all certified methods share the certificate, predictor and margins. Protocol: N=8N = 8; 200 episodes per manipulation cell, 500 per unicycle cell; brackets: paired bootstrap 95 % intervals.

CAST keeps the task while it enforces the request

Editing does not help the task; selecting does (Table 1; rollouts: Figure 6, Figure 7). The frozen Can policy ignores the request and violates it in up to 73.5 % of episodes. The output filter cuts violations to at most 2.5 % and reaches 0.37–0.61 joint success. The other methods without a critic land within 0.08 of it, except under the budget: they change how the constraint is met, not how well the task is done. CAST reaches 0.70–0.89 and violates in at most 0.5 % of episodes.

Figure 6. Rollouts in three simulators: edit (top) or select (bottom). Manipulation (robomimic Can, moving obstacle 0.10 m / 75, one scored scenario): rendered frames with the hand path, the virtual cylinder at four times (faded) and its barrier-gradient field projected into the camera; the output filter keeps the clearance but stalls until the time limit, CAST delivers the can. Quadrotor (no-fly zone unseen in training): the vehicle drawn to scale along its flight over the zone’s barrier field; the filter’s thrust corrections crash it, CAST (request-conditioned critic) executes a certified sample of the other learned route. Humanoid (effort budget b=0.55b = 0.55, an illustration scenario): MuJoCo frames; scaling the torques to the cap makes it fall, CAST-V keeps walking within the budget. Arrows: ∇h\nabla h, coloured by the barrier value hh (red: at the boundary; blue: far).

More rollouts showing edit and select outcomes across manipulation and dynamic-system tasks

Figure 7. More rollouts: edit (upper row of each block) or select (lower row). Top, manipulation (rendered; the rendered episodes equal the scored ones). Can, keep-out pillar (+2 cm; red wireframe): the filter’s corrections keep the hand out of the pillar but it never transports the can; CAST carries it around. Can, effort budget b=0.20b = 0.20: the filter caps every chunk and the hand stalls with the can; CAST executes certified low-effort chunks and delivers it. Square, moving obstacle (policy s0s_0, −2-2 cm): the filter’s fallback holds the nut near the obstacle until the time limit; CAST inserts it. Hand paths projected into the camera. Bottom, dynamic systems, drawn to scale from the recorded states: 40 rollouts per panel as mean ±\pm sd per route and outcome (numbers: rollouts in the group; groups of one are not drawn; crosses: a group that stalls or crashes), one flight with the vehicle drawn. Unicycle and quadrotor no-fly zone: the zones of Figure 1 and Figure 4a fixed, CAST-V with the task critic. Quadrotor energy budget b=1.015b = 1.015: the first 40 scored scenarios of policy s0s_0, re-simulated for drawing (outcomes differ slightly from the scored run), CAST with the task critic; scaling the thrust to the cap costs altitude.

The gain holds on new requests and policies, fixed in advance and scored once (Figure 2). Over the filter, CAST gains +0.32 on six new Can geometries, +0.09 on Square (positive for each of three policies), +0.08 under Square effort budgets, and +0.10 and +0.08 [+0.03, +0.14] for a camera-only Can policy under R1 and under budgets. Every interval excludes zero (Figure 5a).

Figure 2. New requests, frozen models. Joint success on requests fixed in advance and evaluated once (right: the camera-only Can policy under R1 and two budgets, 0.20 and 0.30). Whiskers: 95 % intervals over shared scenarios. Select-then-filter and all other arms: Table 2.

Where the gain comes from. The critic avoids weak samples (best of eight without a request: 0.91 against 0.56), and shuffling its scores removes the gain (Can +0.32, +0.34; Square +0.16).

Certify first, or rank first? Select-then-filter has the same samples and critic. For obstacles and keep-out volumes, where its edit is a small detour, it is close to CAST (0.88 against 0.88 on the six new geometries; every setting: Figure 5b); there certifying first costs nothing and keeps Theorem 2’s guarantee. Under a budget the edit is large and the order decides: on the two new budgets CAST reaches 0.68 against 0.46 for select-then-filter (+0.22 [+0.16, +0.29]) and 0.42 for scaling. Square’s budgets cut its chunks less, and there ranking first does better (−0.04 [−0.07, −0.00] for CAST).

When does selection help? Moving the three levers

We move each lever on Can (Figure 3). A larger obstacle (a) blocks more of the workspace. CAST keeps +0.22 to +0.31 over the filter at every size, while DPCC and critic-free selection stay with the filter; select-then-filter is level for small obstacles and behind at 9 and 12 cm (+0.04 [+0.01, +0.08] for CAST). A tighter budget (b) makes the edit large. As it tightens, select-then-filter falls to plain scaling, whereas CAST executes a chunk that fits whenever one exists: at b=0.15b = 0.15, 0.53 against 0.16 and 0.26; pooled over b≤0.30b \le0.30, +0.26. More samples (c): two already give 0.87 and four 0.89, but N=32N = 32 falls back to 0.77 (−0.10 from N=8N = 8): the critic’s own errors are selected, as the last term of (6) allows. The camera-only policy (d) gains most where the edit costs most (+0.22 at 9 cm), but its certified chunks are nearly interchangeable: under the state-based critic the best of eight is worth 0.013 more than their mean (0.051 for the state policy), so even that critic, reading the true object state, picks no better (0.75). Spread, not the critic, limits the gain. *When a lever is weak the gain vanishes: on robomimic Lift every certified controller reaches 0.94–0.97, and with a pillar in Square’s insertion path 55.7 % of batches are empty and random scores do as well (+0.03).

Figure 3. The levers of Theorem 3 on Can (200 shared scenarios per point; bands: 95 % intervals). (a) CAST keeps its lead as the obstacle grows. (b) Under a tight budget, ranking first falls to plain scaling. (c) Two to four samples give the whole gain; large batches lose part of it. (d) The camera-only policy: the lead holds at 9 cm, not at 12 cm.

Blocked routes: a critic that knows the request, or viability

When a request blocks the route a policy has committed to, one-step certification stalls, and looking ahead at the policy’s own samples fixes it without retraining. On the unicycle, a keep-out zone blocks one of two routes. The task critic cannot know it; once committed, the only certified chunks brake, and the robot stops short of the goal in 20 % of episodes with the filter and 15 % with CAST, while select-then-filter, whose edit slides along the zone, reaches 0.86 against 0.81. A predictive safety filter with a 20-step horizon stalls too (joint 0.75). Two remedies work on new zones of the family (Figure 1d). A critic that knows the request, trained once on zones drawn from a family, lifts CAST to 0.98, +0.16 over a matched task critic; with it, select-then-filter does as well (0.98). Viability needs no retraining at all: CAST-V, with the task critic and L=8L = 8, reaches 0.99 and stalls in 0.4 % of episodes, beating CAST by +0.18 (Figure 5c) and select-then-filter with the same critic by +0.13. Viability alone does as well (0.99): future sample availability, not task value, decides. The lookahead matters (L=1,2,4L = 1, 2, 4: 0.82, 0.83, 0.80), MM and vmin⁡v_{\min} little (Table 4); more samples do not replace it and select the critic’s errors (CAST with N=1024N = 1024: 0.14; Table 3). Learned from logs (CAST-VL), viability reaches 0.95 (+0.14 over CAST), stays within 0.03 of model-based CAST-V when the actuators are 15–30 % weaker than modelled, and ranks never-executed candidates like the simulation (AUC 0.98 on the scored runs): future safe-control availability is learnable from interaction data (maps: Figure 1c, Figure 9). A success critic on the same 3000 logged episodes is slightly ahead (0.97; Table 4) but needs more of them: with 100, viability keeps 0.89 and the success critic 0.76 (Figure 10a). Both remove the lookahead, which costs CAST-V 10–50 times CAST’s decision time (Table 3). With a crossing pedestrian CAST-V gains +0.09 over CAST and matches MPPI; CAST-VL reaches 0.95 (Figure 11).

Figure 9. The boundary a frozen policy needs, simulated and learned. Four keep-out zones that the learned network never saw (unicycle, policy s0; the slice of the state space of Figure 8). Colour: mean viability of the policy’s certified chunks at each state (16 samples). The CBF boundary h=0h = 0 (red) is what a filter protects; the viability boundary v=0.5v = 0.5 lies far outside it and moves with the zone. Top: by simulation, as CAST-V estimates it. Bottom: from the network trained on logs of the critic-free controller (CAST-VL), with both boundaries. The two agree on 72–90% of about 42 000 certified chunks per zone (AUC 0.85–0.97); the learned map is softer inside the dead-end regions, which the logs rarely visit, and matches where the rollouts pass: CAST-VL reaches the goal in 37–39 of 40 rollouts. Illustration data, not scored.

Figure 10. Two diagnostics. (a) Viability or success as the learning target? Both networks are trained on the same logged episodes of the critic-free controller, with the same features, architecture and recipe; only the label differs (viability of the executed chunk, or the episode’s joint success). Unicycle, unseen zones, three policies ×\times 500 scored scenarios; bands: 95 % intervals, and at 100 episodes the range of three disjoint subsets, in each of which viability is ahead. With 300 episodes the two are level (+0.01 [−0.00, +0.03]), with 1000 the success critic is slightly ahead (−0.01 [−0.03, −0.00]), and with 3000 by 0.02. Viability is the cheaper label to learn and needs no task outcome; a success critic can replace it when logs are plentiful. (b) Where violations come from. Square, new requests, learned predictor (1 200 scored episodes per controller): share of violating episodes among those that executed at least one fallback chunk failing the certificate (an uncertified correction, or the hold backup, which is accepted without margins) and among those whose chunks were all certified. Theorem 1 covers the second group; none of its episodes violated.

Figure 11. A moving obstacle in space and time. Unicycle with a pedestrian crossing the corridor (random-walk speed 0.3–0.6 m/s, noisy tracker, constant-velocity forecast with per-step conformal margins at level 0.99). Left: three scored scenarios (policy s0) where the filter fails and CAST-V succeeds; the robot’s plane is the floor, time goes up, the pedestrian is a slanted tube and the central obstacle a vertical cylinder. The filter’s evasive corrections push the robot into the wall (scenarios 1 and 3) or into contact with the pedestrian (scenario 2); CAST-V passes ahead of the pedestrian. Right: joint success over three policies ×\times 500 shared scenarios. Critics trained on 6000 frozen-policy episodes per policy (task critic held-out R2R^2 0.19–0.20; request-conditioned critic, which also sees the forecast, 0.68–0.71). CAST-VL: CAST-V’s rule with viability learned from 6000 logged episodes per policy of the critic-free certified controller (no crash or contact counts as viable; planned, scored once): 0.95, +0.23 [+0.19, +0.26] over the filter, +0.12 [+0.08, +0.15] over MPPI and +0.13 [+0.10, +0.16] over model-based CAST-V. A success critic trained on the same kind of logs lifts CAST itself to 0.98. Planned contrasts: CAST (request critic) − filter +0.024 [−0.018, +0.066], so with critics trained on frozen-policy episodes CAST alone does not beat the filter; CAST-V (task critic) − CAST (task critic) +0.093 [+0.071, +0.115]; CAST-V − MPPI −0.011 [−0.051, +0.028]. Also: CAST-V − filter +0.099 [+0.059, +0.139], − select-then-filter (request critic) +0.057 [+0.033, +0.082]. Pedestrian contact: 0.9–2.4 % for the certified controllers with frozen-policy critics (tracker noise), 0.1 % for CAST-VL and the log-trained critic, 0 for MPPI.

CAST-V variant (default L=8L = 8, M=4M = 4, vmin⁡=0.5v_{\min} = 0.5)Joint successms / decision
L=1L = 10.823 [0.797, 0.848]6.0
L=2L = 20.829 [0.804, 0.854]8.0
L=4L = 40.803 [0.776, 0.830]13.3
L=8L = 8 (default)0.993 [0.988, 0.997]18.4
M=1M = 10.979 [0.970, 0.987]4.8
M=2M = 20.971 [0.961, 0.981]7.7
M=8M = 80.995 [0.990, 0.998]19.8
M=16M = 160.995 [0.991, 0.999]33.9
vmin⁡=0.25v_{\min} = 0.250.971 [0.961, 0.980]11.9
vmin⁡=0.75v_{\min} = 0.750.995 [0.991, 0.999]12.2
viability only (L=8L = 8)0.991 [0.983, 0.997]21.3
CAST-VL: viability learned from logs0.949 [0.934, 0.962]CAST + 0.04
success critic from the same logs (no viability)0.967 [0.956, 0.978]CAST + 0.04
CAST, task critic (reference)0.8091.7

Table 4. CAST-V ablation on the unicycle’s unseen zones (task critic, three policies ×\times 500 shared scenarios): lookahead LL, continuations MM, threshold vmin⁡v_{\min}, viability alone, CAST-VL and a success critic trained on the same logs (network cost on top of CAST). Viability is nearly always close to 0 or 1, so even M=1M = 1 separates the candidates; LL must cover the time to commit to a route.

Dynamic systems: a quadrotor and a humanoid

A quadrotor couples translation and rotation, so an edited thrust command changes the rest of the flight (Figure 4). No-fly zones. On zones unseen in training, the output filter never enters the zone but crashes the vehicle in 56 % of episodes, reaching 0.44; MPPI with model, map and goal reaches 0.61. CAST with the task critic reaches 0.68; CAST-V with the same critic and L=16L = 16 reaches 0.93 (+0.25 over CAST), and the request-conditioned critic 1.00. CAST-VL, with no model rollouts, beats model-based CAST-V (0.98). Energy budget. The filter scales the thrust down and the vehicle sinks. Pooled over the four budgets 1.015–1.03, CAST beats select-then-filter by +0.09 and the filter by +0.36; CAST-V adds +0.02. Humanoid. Under an effort budget the filter scales the torques and the humanoid falls in 74 % of episodes. CAST gains +0.53 over the filter over four budgets. Select-then-filter does as well: a small scaling keeps the gait. CAST-V beats both (+0.09 over CAST).

Figure 4. Dynamic systems, three frozen policies each. (a) The filter’s thrust edits keep a no-fly zone but crash the vehicle; CAST (request-conditioned critic) takes the other route. (b) Unseen zones, 500 scenarios per policy (“req.”: request-conditioned critic). (c) Quadrotor energy budget; at b=1.01b = 1.01 almost no chunk fits and scaling does better. (d) Humanoid effort budget, 300 scenarios per policy (shaded: added later). 95 % intervals.

Safety. With exact models no violation began in a certified chunk; with a learned predictor violations came with the fallback: every violating Square episode of CAST executed a fallback chunk that failed the certificate, and the 554 whose chunks were all certified had none (Figure 10b). A certified backup aligns the controller with the theorem. With the pedestrian, executing the last certified chunk’s braking backup instead of an uncertified correction, and calibrating the forecast over whole episodes as Theorem 1(b) assumes, no contact occurred during a certified step. Contacts did not fall, but all 50 came after the robot had stopped, which is passive safety ([6]); see Proposition 6. Failures more than halved: CAST rose from 0.60 to 0.81 (Table 5).

Conclusion

A frozen diffusion policy can respect a runtime constraint by sampling a few chunks, certifying them, and letting a critic choose: the certificate gives safety, the critic task success. Certifying first matters when a filter’s edit is large; viability matters because the physical capacity to act safely and a frozen policy’s capacity to sample safe actions differ, and finite sampling makes the difference decisive. Limitations. Selection cannot create behaviour the policy never samples or help a policy that already succeeds; where an edit is benign, ranking first does as well or better; CAST-V costs progress where CAST’s choice is already viable. Safety is passive, for hazards that ignore the robot: it covers certified chunks and their backup, not a hazard reaching a robot at rest; tests are simulated.

Generative AI use. Claude (Anthropic) assisted with code, experiments, writing, and literature search; the authors are responsible for the manuscript.

Proofs

Theorem 1(a). For j≤Tj \le T, by the Lipschitz property of hh, Assumption 1 and (1),

h(pkT+j,ξkT+j)≥h(p^k,j,ξ^k,j)−δ−qk,j≥rk,j≥0.h(p_{kT+j}, \xi_{kT+j}) \ge h(\hat{p}_{k,j}, \hat{\xi}_{k,j}) - \delta- q_{k,j} \ge r_{k,j} \ge0.

Every control step after t=0t = 0 belongs to one executed chunk, and nothing in the argument involves how the executed chunk aˉk\bar{a}_k was chosen. For the budget, induction on Sk+1=Sk+c(aˉk)≤b(k+1)S_{k+1} = S_k + c(\bar{a}_k) \le b(k+1) keeps the budget; the cap b(k+1)−Skb(k+1) - S_k is at least b>0b > 0, and for an effort cc that is continuous and zero at the zero command, as ours is, a sufficiently scaled chunk satisfies it. □\square

Theorem 1(b). Write Z=(ξt,νt)t≥0Z = (\xi_t, \nu_t)_{t \ge0} for the hazard trajectory and the tracker noise. By assumption the law of ZZ is the same under every controller, and the forecasts are fixed functions of ZZ. The score Σ(Z)\Sigma(Z) therefore has the same law under every controller. The calibration episodes and the deployment episode are exchangeable, and n≥1/εn \ge1/\varepsilon makes the index ⌈(n+1)(1−ε)⌉\lceil(n+1)(1-\varepsilon)\rceil at most nn, so P[Σ(Z)≤sε]≥1−ε\mathbb{P}[\Sigma(Z) \le s_{\varepsilon}] \ge1-\varepsilon (Vovk et al. [33]), jointly over calibration and deployment. On {Σ≤sε}\{\Sigma\le s_{\varepsilon}\}, for every executed step t=kT+jt = kT+j,

h(pt,ξt)≥h(p^k,j,ξ^k,j)−∥pt−p^k,j∥−∥ξt−ξ^k,j∥≥h(p^k,j,ξ^k,j)−qk,j−∥pt−p^k,j∥.h(p_t, \xi_t) \ge h(\hat{p}_{k,j}, \hat{\xi}_{k,j}) - \lVert p_t - \hat{p}_{k,j}\rVert- \lVert\xi_t - \hat{\xi}_{k,j}\rVert\ge h(\hat{p}_{k,j}, \hat{\xi}_{k,j}) - q_{k,j} - \lVert p_t - \hat{p}_{k,j}\rVert.

which is non-negative unless B\mathcal{B} occurs; the initial state is safe. Hence P[unsafe]≤P[Σ>sε]+P[B]\mathbb{P}[\text{unsafe}] \le\mathbb{P}[\Sigma> s_{\varepsilon}] + \mathbb{P}[\mathcal{B}]. If the executed chunk is certified, h(p^k,j,ξ^k,j)−qk,j≥δ+rk,jh(\hat{p}_{k,j}, \hat{\xi}_{k,j}) - q_{k,j} \ge\delta+ r_{k,j}, so B\mathcal{B} needs a prediction error above δ\delta. For a chunk that is not certified the slack can be negative and the bound is void. □\square

Proposition 5 (Recursive feasibility). Let the request be static and the predictor exact (δ=q=0\delta= q = 0), and let the backup be a fixed feedback law that reaches rest within HH steps and is safe from the initial state. If the controller executes certified chunks, and the backup when there is none, the request holds at every step and the backup stays safe at every decision.

Proposition 5. Induction hypothesis at decision kk: the backup path from skTs_{kT} keeps h≥0h \ge0 (true at k=0k = 0 by assumption). Case (i): a certified chunk is executed. The predictor is exact, so its TT steps and the HH backup steps after it keep h≥0h \ge0, and the backup is at rest at the end, where a static hh no longer changes. Case (ii): no chunk is certified and the backup is executed; its path is safe by the hypothesis. In both cases the backup path from s(k+1)Ts_{(k+1)T} is the remainder of a safe path that ends at rest, so the hypothesis holds at k+1k + 1. The statement does not cover a controller that executes an uncertified correction instead of the backup. □\square

:::

Proposition 6 (Backup against a moving hazard). Under the assumptions and margins of Theorem 1(b), let the robot predictor be exact (δ=0\delta= 0), the robot start at rest in a safe state, and the backup an open-loop law that every certificate (1) checks for the HH steps after its chunk and that brings the robot to rest within HH steps. Suppose the controller executes a certified chunk whenever there is one and otherwise the next TT steps of the backup that followed the last certified chunk. Then, on the calibration event {Σ≤sε}\{\Sigma\le s_{\varepsilon}\} of probability at least 1−ε1-\varepsilon, the request holds at every step of every certified chunk and at each backup step executed within HH steps after it: a violation can occur only before the first certified chunk or after HH consecutive backup steps, with the robot at rest in both cases (passive motion safety in the sense of Bouraine et al. [6]).

Proposition 6. Fix a decision kk at which a certified chunk is executed. On the event, ∥ξkT+j−ξ^k,j∥≤qk,j\lVert\xi_{kT+j} - \hat{\xi}_{k,j}\rVert\le q_{k,j} for every j≤T+Hj \le T+H, because Σ\Sigma is a maximum over all k<Kmax⁡k < K_{\max} and j≤T+Hj \le T+H. The certificate gives h(p^k,j,ξ^k,j)−qk,j≥rk,j≥0h(\hat{p}_{k,j},\hat{\xi}_{k,j})-q_{k,j}\ge r_{k,j}\ge0 for j≤T+Hj\le T+H, where p^k,j\hat{p}_{k,j} for j>Tj>T is the predicted backup. If the following decisions have no certified chunk (sample or correction), the controller executes the continuation of that same backup, so with an exact predictor the executed positions are pkT+j=p^k,jp_{kT+j}=\hat{p}_{k,j} for j≤T+Hj\le T+H, and by the Lipschitz property h(pkT+j,ξkT+j)≥h(p^k,j,ξ^k,j)−qk,j≥0h(p_{kT+j},\xi_{kT+j})\ge h(\hat{p}_{k,j},\hat{\xi}_{k,j})-q_{k,j}\ge0. A new certified chunk restarts the argument at its own decision. Every step is therefore covered until HH backup steps have been executed in a row, after which the robot is at rest and no certificate makes a claim about a hazard that then reaches it.

Theorem 2. (i) For ρ≪π\rho\ll\pi with ρ(F)=1\rho(\mathcal{F})=1, dπFdπ=1Fβ\frac{\mathrm{d}\pi_{\mathcal{F}}}{\mathrm{d}\pi}=\frac{1_{\mathcal{F}}}{\beta}, so

KL⁡(ρ∥π)=∫log⁡dρdπF dρ+∫log⁡dπFdπ dρ=KL⁡(ρ∥πF)+log⁡1β,(7)\operatorname{KL}(\rho\Vert\pi)=\int\log\frac{\mathrm{d}\rho}{\mathrm{d}\pi_{\mathcal{F}}}\,\mathrm{d}\rho+\int\log\frac{\mathrm{d}\pi_{\mathcal{F}}}{\mathrm{d}\pi}\,\mathrm{d}\rho=\operatorname{KL}(\rho\Vert\pi_{\mathcal{F}})+\log\frac{1}{\beta}, \tag*{(7)}

which is minimised uniquely at ρ=πF\rho=\pi_{\mathcal{F}}; if ρ≪̸π\rho\not\ll\pi the divergence is infinite. The samples are independent draws from π\pi at the fixed state, so the first certified sample in draw order has law πF\pi_{\mathcal{F}}.

(ii) The lower bound is (i), since ρ(F)=1\rho(\mathcal{F})=1. For the upper bound, the executed chunk is one of the certified samples, so for every measurable EE,

ρ(E)=P[aˉ∈E, F≠∅]pN≤P[⋃i{ai∈E∩F}]pN≤Nπ(E∩F)pN=NβpNπF(E).\rho(E)=\frac{\mathbb{P}[\bar{a}\in E,\ \mathcal{F}\ne\varnothing]}{p_N}\le\frac{\mathbb{P}[\bigcup_i\{a_i\in E\cap\mathcal{F}\}]}{p_N}\le\frac{N\pi(E\cap\mathcal{F})}{p_N}=\frac{N\beta}{p_N}\pi_{\mathcal{F}}(E).

Hence dρdπF≤Nβ/pN\frac{\mathrm{d}\rho}{\mathrm{d}\pi_{\mathcal{F}}}\le N\beta/p_N and KL⁡(ρ∥πF)≤log⁡(Nβ/pN)\operatorname{KL}(\rho\Vert\pi_{\mathcal{F}})\le\log(N\beta/p_N); insert this in (7). Finally pN=1−(1−β)N≥βp_N=1-(1-\beta)^N\ge\beta gives Nβ/pN≤NN\beta/p_N\le N. (iii) Let ZZ be the zero-volume image set. π(Z)=0\pi(Z)=0 because π\pi has a density, while the filter’s output lies in ZZ with positive probability; a law that charges a π\pi-null set has infinite relative entropy to π\pi.

Theorem 3. Identity. All values use the same reward (joint success) and the same Markov state; terminal states are absorbing and the horizon is Kmax⁡K_{\max}. Telescoping Vμ(sk+1)−Vμ(sk)V^{\mu}(s_{k+1})-V^{\mu}(s_k) along the trajectories of μ\mu gives the performance-difference identity (Kakade and Langford, [19])

Vμ(s0)−Vμ0(s0)=∑kEs∼dkμ[Ea∼μ(⋅∣s)Q0(s,a)−V0(s)].V^{\mu}(s_0)-V^{\mu_0}(s_0)=\sum_k\mathbb{E}_{s\sim d_k^{\mu}}\left[\mathbb{E}_{a\sim\mu(\cdot\mid s)}Q^0(s,a)-V^0(s)\right].

At one state, couple μ0\mu_0 and μ\mu on the same batch and the same fallback randomness; only their action marginals enter the identity, so the coupling costs nothing. On an empty batch both execute the shared fallback and the difference vanishes. On a non-empty batch let Qmax⁡=max⁡i∈FQ0(s,ai)Q^{\max}=\max_{i\in\mathcal{F}}Q^0(s,a_i). The critic-free action is the first certified draw, with conditional law πF\pi_{\mathcal{F}}. Therefore

Ea∼μQ0(s,a)−V0(s)=pN{E[Qmax⁡∣F≠∅]−EπFQ0⏟ΩN−E[Qmax⁡−Q0(s,aˉ)∣F≠∅]⏟ΛN},\mathbb{E}_{a\sim\mu}Q^0(s,a)-V^0(s)=p_N\left\{\underbrace{\mathbb{E}[Q^{\max}\mid\mathcal{F}\ne\varnothing]-\mathbb{E}_{\pi_{\mathcal{F}}}Q^0}_{\Omega_N}-\underbrace{\mathbb{E}[Q^{\max}-Q^0(s,\bar{a})\mid\mathcal{F}\ne\varnothing]}_{\Lambda_N}\right\},

and ΩN≥0\Omega_N\ge0 because the first certified sample has law πF\pi_{\mathcal{F}}.

Ceiling. Conditional on the number n≥1n\ge1 of certified samples, their chunks are independent draws from πF\pi_{\mathcal{F}}. Let ϕ\phi be the quantile function of Q0(s,a)Q^0(s,a) under πF\pi_{\mathcal{F}}, with mean Qˉ\bar{Q} and variance σF2\sigma_{\mathcal{F}}^2. The maximum of nn independent uniforms has density nun−1nu^{n-1}, so by Cauchy–Schwarz

Emax⁡i≤nQ0(s,ai)−Qˉ=∫01(ϕ(u)−Qˉ)(nun−1−1) du≤σF(∫01(nun−1−1)2 du)1/2\mathbb{E}\max_{i\le n}Q^0(s,a_i)-\bar{Q}=\int_0^1(\phi(u)-\bar{Q})(nu^{n-1}-1)\,\mathrm{d}u\le\sigma_{\mathcal{F}}\left(\int_0^1(nu^{n-1}-1)^2\,\mathrm{d}u\right)^{1/2}
=σFn−12n−1≤σFn−12.=\sigma_{\mathcal{F}}\frac{n-1}{\sqrt{2n-1}}\le\sigma_{\mathcal{F}}\sqrt{\frac{n-1}{2}}.

the classical bound on the expected maximum ([16, 15]). Averaging over K∼Binomial⁡(N,β)K \sim\operatorname{Binomial}(N,\beta) with Jensen’s inequality,

pNΩN≤σFE(K−1)+/2≤σFE(K−1)+/2=σF(Nβ−pN)/2.p_N\Omega_N \le\sigma_F\mathbb{E}\sqrt{(K-1)_+/2} \le\sigma_F\sqrt{\mathbb{E}(K-1)_+/2} = \sigma_F\sqrt{(N\beta-p_N)/2}.

The last expression increases with β\beta and equals σF(N−1)/2\sigma_F\sqrt{(N-1)/2} at β=1\beta=1.

Ranking loss. Let G\mathcal{G} be the event that no certified sample of the batch lies in the exceptional set EE; given K=n≥1K=n\ge1 certified samples, which are independent draws from πF\pi_F, P[G∣K=n]=(1−η)n≥(1−η)N\mathbb{P}[\mathcal{G}\mid K=n]=(1-\eta)^n\ge(1-\eta)^N. On G\mathcal{G}, let i0i_0 maximise Q0Q^0 and let i⋆i^\star maximise Q^\widehat{Q} among the certified samples. Then

Q0(s,ai0)−Q0(s,ai⋆)=Q⋆(s,ai0)−Q⋆(s,ai⋆)+(Q0−Q⋆)(s,ai0)−(Q0−Q⋆)(s,ai⋆),Q^0(s,a_{i_0})-Q^0(s,a_{i^\star})=Q_\star(s,a_{i_0})-Q_\star(s,a_{i^\star})+(Q^0-Q_\star)(s,a_{i_0})-(Q^0-Q_\star)(s,a_{i^\star}),

where the first bound uses Q^(s,ai⋆)≥Q^(s,ai0)\widehat{Q}(s,a_{i^\star})\ge\widehat{Q}(s,a_{i_0}) and ∣Q^−Q⋆−u(s)∣≤ϵQ|\widehat{Q}-Q_\star-u(s)|\le\epsilon_Q (the offset cancels). Off G\mathcal{G} the loss is at most one, because values are success probabilities. Taking the conditional expectation gives (6). With Q⋆=Q0Q_\star=Q^0 the oscillation vanishes, and with ΩN≥0\Omega_N\ge0 the identity (4) gives Vμ−V0≥−∑kpNE[2ϵQ+1−(1−η)N]V^\mu-V^0\ge-\sum_k p_N\mathbb{E}[2\epsilon_Q+1-(1-\eta)^N]. The bound is for the maximiser of one score; it does not cover the unanimity guard.

Proposition 7 (Generative viability) Let βK(s)=π({a∈F(s):f(s,a)∈K}∣s)\beta_{\mathcal{K}}(s)=\pi(\{a\in\mathcal{F}(s):f(s,a)\in\mathcal{K}\}\mid s) for a set K\mathcal{K} of states, with ff exact and deterministic and batches drawn afresh at each decision. Suppose s0∈Ks_0\in\mathcal{K} and βK(s)≥βmin⁡>0\beta_{\mathcal{K}}(s)\ge\beta_{\min}>0 for every s∈Ks\in\mathcal{K}. If a controller executes, whenever its batch contains one, a certified sample that leads into K\mathcal{K}, then the probability that some batch among the first ℓ\ell decisions contains no such sample is at most ℓ(1−βmin⁡)N\ell(1-\beta_{\min})^N; on the complementary event every executed chunk is certified and the state stays in K\mathcal{K}.

Proposition 7. Let AkA_k be the event that the batch at decision kk contains no certified sample leading into K\mathcal{K}. On ⋂i<kAic\bigcap_{i<k}A_i^c every executed chunk was certified and led into K\mathcal{K}, so sk∈Ks_k\in\mathcal{K}. Given sk∈Ks_k\in\mathcal{K}, the NN samples are independent draws from π(⋅∣sk)\pi(\cdot\mid s_k), each certified and leading into K\mathcal{K} with probability βK(sk)≥βmin⁡\beta_{\mathcal{K}}(s_k)\ge\beta_{\min}, so P[Ak∣sk]≤(1−βmin⁡)N\mathbb{P}[A_k\mid s_k]\le(1-\beta_{\min})^N. Hence P[⋃k<ℓAk]≤∑k<ℓP[Ak∩⋂i<kAic]≤ℓ(1−βmin⁡)N\mathbb{P}[\bigcup_{k<\ell}A_k]\le\sum_{k<\ell}\mathbb{P}[A_k\cap\bigcap_{i<k}A_i^c]\le\ell(1-\beta_{\min})^N.

Proposition 4. Hypotheses: standard Borel state and action spaces, π\pi a stochastic kernel, ff deterministic and measurable, F(s)\mathcal{F}(s) measurable in (s,a)(s,a); batches are drawn afresh at each decision, independently of the past given the current state; goal states are absorbing. With a stochastic exogenous hazard, (i) and (ii) hold with Wℓ−1,N(f(s,ai))W_{\ell-1,N}(f(s,a_i)) replaced by its expectation over the hazard’s transition; (iii) needs the deterministic ff. A selection-only controller may use the whole history and its own randomisation, independent of future batches given the current state. (i) By induction on ℓ\ell; ℓ=0\ell=0 is trivial. Fix any selection-only controller and condition on the history and on the first batch a0:N−1a_{0:N-1}. If no sample is certified the controller has failed. Otherwise it executes some certified aja_j, possibly at random, and from s′=f(s,aj)s'=f(s,a_j) it continues as a selection-only controller whose history is extra randomisation independent of the future batches; by the induction hypothesis it keeps a certified sample in each of the next ℓ−1\ell-1 batches, or reaches a goal state first, with probability at most Wℓ−1,N(s′)≤max⁡i:ai∈F(s)Wℓ−1,N(f(s,ai))W_{\ell-1,N}(s')\le\max_{i:a_i\in\mathcal{F}(s)}W_{\ell-1,N}(f(s,a_i)). Taking expectations over the batch gives at most Wℓ,N(s)W_{\ell,N}(s). The greedy rule, over certified samples with ties to the smallest index, attains each inequality, so it attains Wℓ,N(s)W_{\ell,N}(s) (the arg max over finitely many samples is measurable). (ii) By induction, Wℓ−1,N+1≥Wℓ−1,NW_{\ell-1,N+1}\ge W_{\ell-1,N}, and a maximum over N+1N+1 samples dominates the maximum over

the first NN, which are NN independent samples; so Wℓ,N+1≥Wℓ,NW_{\ell,N+1} \ge W_{\ell,N}. With N=1N = 1 the only choice is the single sample, executed if certified. (iii) Write gℓ,N(a)=1{a∈F(s)}Wℓ−1,N(f(s,a))g_{\ell,N}(a) = \mathbf{1}\{a \in\mathcal{F}(s)\}W_{\ell-1,N}(f(s,a)) and gℓg_\ell for the same with Wℓ−1,∞W_{\ell-1,\infty}. For a bounded measurable g≥0g \ge0, max⁡i≤Ng(ai)↑ess sup⁡πg\max_{i \le N} g(a_i) \uparrow\operatorname{ess\,sup}_{\pi} g almost surely, hence in expectation. Assume, inductively, Wℓ−1,N↑Wℓ−1,∞W_{\ell-1,N} \uparrow W_{\ell-1,\infty} pointwise. Upper bound: Wℓ,N(s)≤ess sup⁡πgℓ,N≤ess sup⁡πgℓW_{\ell,N}(s) \le\operatorname{ess\,sup}_{\pi} g_{\ell,N} \le\operatorname{ess\,sup}_{\pi} g_\ell. Lower bound: for N≥N0N \ge N_0, Wℓ,N(s)≥E[max⁡i≤Ngℓ,N0(ai)]→ess sup⁡πgℓ,N0W_{\ell,N}(s) \ge\mathbb{E}[\max_{i \le N} g_{\ell,N_0}(a_i)] \to\operatorname{ess\,sup}_{\pi} g_{\ell,N_0}, and ess sup⁡πgℓ,N0↑ess sup⁡πgℓ\operatorname{ess\,sup}_{\pi} g_{\ell,N_0} \uparrow\operatorname{ess\,sup}_{\pi} g_\ell because gℓ,N0↑gℓg_{\ell,N_0} \uparrow g_\ell pointwise (for θ>0\theta> 0 the set {gℓ>ess sup⁡gℓ−θ}\{g_\ell> \operatorname{ess\,sup} g_\ell- \theta\} has positive mass, and by continuity of measure so does {gℓ,N0>ess sup⁡gℓ−2θ}\{g_{\ell,N_0} > \operatorname{ess\,sup} g_\ell- 2\theta\} for large $N_0). So Wℓ,∞(s)=ess sup⁡πgℓW_{\ell,\infty}(s) = \operatorname{ess\,sup}_{\pi} g_\ell, which is {0,1}\{0,1\}-valued by induction and equals $1$ exactly when π({a∈F(s):Wℓ−1,∞(f(s,a))=1}∣s)>0\pi(\{a \in\mathcal{F}(s) : W_{\ell-1,\infty}(f(s,a)) = 1\} \mid s) > 0. The classical indicator Vℓ(s)=1V_\ell(s) = 1 if and only if some admissible a∈F(s)a \in\mathcal{F}(s) has Vℓ−1(f(s,a))=1V_{\ell-1}(f(s,a)) = 1; a set of positive π\pi-mass is nonempty, so by induction Wℓ,∞≤VℓW_{\ell,\infty} \le V_\ell, with strict inequality exactly where Vℓ(s)=1V_\ell(s) = 1 but the certified chunks with Wℓ−1,∞=1W_{\ell-1,\infty} = 1 form a π\pi-null set. The same induction shows that a controller whose action law is absolutely continuous with respect to π(⋅∣s)\pi(\cdot\mid s) at every state survives ℓ\ell decisions with probability 00 from any ss with Wℓ,∞(s)=0W_{\ell,\infty}(s) = 0. Finally, CAST-V’s critic-free controller is selection-only with mm samples, so (i) gives v(s,a)≤WL,m(f(s,a))v(s,a) \le W_{L,m}(f(s,a)).

Estimated viability. With ff exact and deterministic, let v(s,a)v(s,a) be the probability that the critic-free certified controller (mm samples per decision, same certificate) from f(s,a)f(s,a) finds a certified sample at each of the next LL decisions, or reaches the goal first, without task failure, and γ(s)=π({a∈F(s):v(s,a)≥vhi}∣s)\gamma(s) = \pi(\{a \in\mathcal{F}(s) : v(s,a) \ge v_{\mathrm{hi}}\} \mid s).

Proposition 8 (Estimated viability). With MM continuations on fresh latents and threshold vmin⁡∈(vlo,vhi]v_{\min} \in(v_{\mathrm{lo}}, v_{\mathrm{hi}}], CAST-V executes a certified chunk with v≥vlov \ge v_{\mathrm{lo}} except with probability at most (1−γ(s))N+εM(1-\gamma(s))^N + \varepsilon_M, with εM\varepsilon_M (two binomial tails, below) ≤Ne−2M(vmin⁡−vlo)2+e−2M(vhi−vmin⁡)2\le Ne^{-2M(v_{\min}-v_{\mathrm{lo}})^2} + e^{-2M(v_{\mathrm{hi}}-v_{\min})^2}, after which its next batch is empty with probability at most (1−vlo)N/m(1-v_{\mathrm{lo}})^{N/m}. If γ(sk)≥γmin⁡\gamma(s_k) \ge\gamma_{\min} at every decision before the first failure, an empty batch or a chunk with v<vlov < v_{\mathrm{lo}} occurs within ℓ\ell decisions with probability at most ℓ[(1−γmin⁡)N+εM+(1−vlo)N/m]\ell[(1-\gamma_{\min})^N + \varepsilon_M + (1-v_{\mathrm{lo}})^{N/m}].

In words. Policy, estimate and lookahead width each add a term. Our M=4M = 4 leaves εM\varepsilon_M loose (0.420.42 for vlo,vhi=0.1,0.9v_{\mathrm{lo}}, v_{\mathrm{hi}} = 0.1, 0.9), but CAST-V executed a chunk of viability below 0.10.1 when one above 0.90.9 existed at 0.07%0.07\% of decisions (below). The episode bound is vacuous at our N/m=2N/m = 2 ((1−vlo)N/m=0.81(1-v_{\mathrm{lo}})^{N/m} = 0.81); it shows how the risk falls with N/mN/m and MM.

Proposition 8. Hypotheses: ff is exact and deterministic, each continuation draws fresh latents, and continuations use the same certificate. Exactly, εM=N P[Bin⁡(M,vlo)≥κ]+P[Bin⁡(M,vhi)<κ]\varepsilon_M = N\,\mathbb{P}[\operatorname{Bin}(M,v_{\mathrm{lo}}) \ge\kappa] + \mathbb{P}[\operatorname{Bin}(M,v_{\mathrm{hi}}) < \kappa] with κ=⌈vmin⁡M⌉\kappa= \lceil v_{\min}M \rceil. Fix the batch a0,…,aN−1a_0,\ldots,a_{N-1} at ss. With an exact model, the MM continuations of a candidate aa use fresh latents, so its estimate v^(a)\hat{v}(a) is the mean of MM independent Bernoulli(v(s,a)v(s,a)) variables given the batch; CAST-V accepts aa if v^(a)≥vmin⁡\hat{v}(a) \ge v_{\min}, i.e. if at least κ\kappa continuations are viable, and executes the highest-ranked accepted certified candidate (lazy evaluation in critic order stops at exactly this candidate), or the most viable one if none is accepted. Selection. Let BB be the event that no batch member is certified with v≥vhiv \ge v_{\mathrm{hi}}; P[B]=(1−γ(s))N\mathbb{P}[B] = (1-\gamma(s))^N. On BcB^{\mathrm{c}} pick such a member gg. Its estimate falls below vmin⁡v_{\min} with probability P[Bin⁡(M,v(s,g))<κ]≤P[Bin⁡(M,vhi)<κ]\mathbb{P}[\operatorname{Bin}(M,v(s,g)) < \kappa] \le\mathbb{P}[\operatorname{Bin}(M,v_{\mathrm{hi}}) < \kappa], since the binomial upper tail increases with the success probability. Otherwise the accepted set is non-empty and the executed chunk is accepted; it has v<vlov < v_{\mathrm{lo}} only if some candidate with v<vlov < v_{\mathrm{lo}} is accepted, which by a union bound over at most NN candidates has probability at most NP[Bin⁡(M,vlo)≥κ]N\mathbb{P}[\operatorname{Bin}(M,v_{\mathrm{lo}}) \ge\kappa]. Hoeffding’s inequality bounds both tails by the exponentials. Transfer. Let s′=f(s,a)s' = f(s,a) and β(s′)=π(F(s′)∣s′)\beta(s') = \pi(\mathcal{F}(s') \mid s'). If s′s' ends the task there is no next batch. Otherwise a continuation is viable only if its first batch of mm samples contains a certified one, so v(s,a)≤1−(1−β(s′))mv(s,a) \le1 - (1 - \beta(s'))^m. CAST-V’s next batch consists of NN independent draws at s′s', so it is empty with probability (1−β(s′))N=((1−β(s′))m)N/m≤(1−v(s,a))N/m≤(1−vlo)N/m(1 - \beta(s'))^N = ((1 - \beta(s'))^m)^{N/m} \le(1 - v(s,a))^{N/m} \le(1 - v_{\mathrm{lo}})^{N/m}.

Horizon. At decision kk let DkD_k be the event that the batch has no certified member with v≥vhiv \ge v_{\mathrm{hi}}, or the executed chunk has v<vlov < v_{\mathrm{lo}}, or the next batch is empty after a chunk with v≥vlov \ge v_{\mathrm{lo}}. Conditionally on the past and sks_k, P[Dk∣sk]≤(1−γ(sk))N+εM+(1−vlo)N/m\mathbb{P}[D_k \mid s_k] \le(1 - \gamma(s_k))^N + \varepsilon_M + (1 - v_{\mathrm{lo}})^{N/m}; the first batch is empty only on D0D_0’s first part, and every later empty batch or low-viability chunk lies in some DkD_k. A union bound over k<ℓk < \ell with γ(sk)≥γmin⁡\gamma(s_k) \ge\gamma_{\min} gives the claim. Nothing is assumed about the critic. □

Measured (unicycle, three policies ×\times 500 scored scenarios, CAST-V with M=4M = 4; reference viability of every certified candidate from 64 further continuations, not used to act; its decisions are identical to the scored cells). Decisions with a certified candidate of reference viability ≥0.9\ge0.9: 16 901; the executed chunk had reference viability below 0.1 in 0.07 % of them (bound ε4=0.42\varepsilon_4 = 0.42). For (vlo,vhi)=(0.25,0.75)(v_{\mathrm{lo}}, v_{\mathrm{hi}}) = (0.25, 0.75): 0.26 % of 17 057 (bound vacuous, 2.14). Only 4.96 % of 140 200 certified candidates have reference viability between 0.1 and 0.9: viability is nearly always close to 0 or 1, where M=4M = 4 suffices.

An exact critic with the wrong target can fail. Consider two certified chunks that commit to different routes; the policy samples route A with probability p∈(0,1)p \in(0,1) and route B otherwise. On route A the continuation completes the task safely with probability 1−ζ1 - \zeta. On route B the frozen policy completes the task with probability one, but only by crossing a keep-out zone later; no certified continuation completes route B. The task values are Qπ(A)=1−ζQ^\pi(A) = 1 - \zeta and Qπ(B)=1Q^\pi(B) = 1, whereas the values under the request are Q0(A)=1−ζQ^0(A) = 1 - \zeta and Q0(B)=0Q^0(B) = 0. An exact task critic selects B whenever a B sample appears, so Vμ=pN(1−ζ)V^\mu= p^N(1 - \zeta), below the critic-free value V0=p(1−ζ)V^0 = p(1 - \zeta) for every N>1N > 1. Both first chunks pass the certificate; the failure is in their continuation. On a batch that contains both routes the oscillation term of (6) equals one, and the identity (4) returns exactly Vμ−V0=(pN−p)(1−ζ)V^\mu- V^0 = (p^N - p)(1 - \zeta). A critic trained on success under the request ranks A first and attains Vμ=(1−(1−p)N)(1−ζ)≥V0V^\mu= (1 - (1 - p)^N)(1 - \zeta) \ge V^0.

Experimental details

Robomimic Can. Policy: the diffusion policy released with DPPO [27] (MLP denoiser, 20 DDIM steps, chunks of four 7-dimensional commands at 20 Hz, at most 300 control steps). It completes the task in 0.560 of episodes without any request. Critic: five MLPs on (state, chunk) regressing Monte Carlo task success with discount 0.99 on 2000 rollouts of the frozen policy. Hand predictor: linear in the chunk’s cumulative commands and the previous chunk, fitted by least squares on 2000 episodes; δ=2\delta= 2 cm. Requests of Table 1: R1, a vertical cylinder of radius 6 cm that sweeps the transport corridor sinusoidally (amplitude 0.15 m, period 100 steps, random phase); R2, the same cylinder faster than the hand can move (amplitude 0.18 m, period 50); R3, a budget b=0.25b = 0.25 on the mean squared position command; R4, a ceiling and a workspace wall; R5, a non-convex keep-out pillar. The obstacle is observed at the current and previous step and extrapolated at constant velocity; no controller sees its future. For R1, the new obstacle requests and the sweeps the certificate uses α=1\alpha= 1 and H=0H = 0: it checks the predicted clearance of the four steps of the chunk, with no rate term and no backup steps. R2 uses α=0.3\alpha= 0.3, H=4H = 4 and conformal forecast margins. When no sample is certified, the obstacle and keep-out controllers apply the output filter (at most four relinearised projections, which need not end certified) to a sample; the budget controllers scale the sample of least effort to the cap. New requests of Figure 2: obstacle amplitudes {0.10,0.20}\{0.10, 0.20\} m with periods {75,125}\{75, 125\}, the pillar shifted by ±2\pm2 cm, and budgets 0.20 and 0.30. The camera-only policy is DPPO’s image policy; its critic reads the policy’s own 137-dimensional embedding.

Robomimic Square. Three diffusion policies (seeds of one recipe) trained on the proficient-human demonstrations: 1-D convolutional U-Net, 16 DDIM steps, chunks of sixteen commands of which eight are executed. Each policy has its own critic and hand predictor, fitted on 2000 of its rollouts; δ=3\delta= 3 cm, the 95th percentile of the predictor’s error. Request: a cylinder of radius 6 cm moving across the path to the peg (amplitude 0.15 m, period 100), forecast with constant acceleration, at its original position and shifted by ±2\pm2 cm.

Unicycle. State (x,y,θ,v)(x, y, \theta, v), time step 0.1 s, bounded acceleration and turn rate, known exactly to every controller. The robot crosses a corridor (∣y∣≤1.5|y| \le1.5) around a disc obstacle (centre (2,0)(2, 0), radius 0.4) to a goal region within 120 steps. The diffusion policy (MLP, 10 DDIM steps, chunks of four controls) is trained on 3000 demonstrations that pass above or below the obstacle and succeeds in 0.98 of episodes without a request. Request: a keep-out disc of radius 0.3 on one side. In the family study its centre is drawn per episode from x∼U[2.3,3.0]x \sim U[2.3, 3.0], ∣y∣∼U[0.55,0.95]|y| \sim U[0.55, 0.95]. The request-conditioned critic has the architecture of the task critic plus five inputs (zone position relative to the robot, side, current barrier value, time). For each of three policies it is trained on 20 000 frozen-policy rollouts labelled with zones drawn from the family; the matched task-target critic uses the same rollouts, inputs, initialisation and optimiser, and only the label differs. Evaluation zones are drawn independently. Certified controllers share an 8-step braking backup and α=0.5\alpha= 0.5. MPPI (256 samples, horizon 20 steps of the 120) and its hard-constrained variant (same horizon; candidates must pass the certificate) know the dynamics, the map, the goal and the zone, and do not use the policy; they are short-horizon references, not upper bounds. The extra latents of a batch are drawn from a separately seeded generator, so every batch holds NN independent samples, as the theory assumes.

Planar quadrotor. State (x,z,θ,x˙,z˙,θ˙)(x, z, \theta, \dot{x}, \dot{z}, \dot{\theta}) at 50 Hz with collective thrust F=mg(1+0.8u0)F = mg(1 + 0.8u_0) and torque 0.25u10.25u_1; known exactly to every controller. Task: from the left to a goal box within 8 s, without touching floor, ceiling or a central disc obstacle. Three diffusion policies (MLP, 10 DDIM steps, chunks of eight controls) are trained on 3000 expert demonstrations each, half above and half below the obstacle; task critics (held-out R2R^2 0.51–0.63) and request-conditioned critics (held-out AUC 0.99) use 4000 frozen-policy rollouts, each labelled with four zones from the family. Certificate: the chunk and a 25-step brake-to-hover backup, rolled out with the exact model, α=0.5\alpha= 0.5; budget: exact prefix inequality on c=(F/mg)2c = (F/mg)^2. The output filter is the minimal-norm correction (finite-difference linearisation, three relinearisation[s]; for the budget, thrust scaling), shared as the

fallback. MPPI: 512 samples, horizon 2 s, soft request penalties, and the shared certificate on what it executes; without a request it succeeds in 0.69 of development episodes. The budget levels and the planner horizon were chosen on development scenarios disjoint from the scored ones.

Humanoid. Gymnasium Humanoid-v5 (MuJoCo, 17 actuators, 15 ms control step). Three diffusion policies (MLP 3×5123 \times512, 10 DDIM steps, single-action chunks, full 348-dimensional observation) are trained on 2M pairs from Farama Minari’s humanoid expert-v0 and medium-v0 demonstrations (SAC rollouts), 80k steps on one GPU (75 s per policy). Success: no fall (the environment’s healthy-height termination) within 300 steps and at least 1 m forward. Critics: five MLPs on (observation, action), discounted success (0.995 per step) from 1500 frozen-policy rollouts per policy (held-out R2R^2 0.70–0.76). Budget: c=∥a∥2/17c = \lVert a\rVert^2/17 per step on actions normalised to [−1,1][-1, 1], prefix average at most bb; the filter scales the policy’s own action to the cap, the selectors’ fallback scales the least-effort sample.

CAST-V. Viability is estimated with M=4M = 4 continuations of the critic-free certified controller from each certified candidate’s end state (m=4m = 4 policy samples per step, exact model, the request’s certificate); a continuation is viable if it finds a certified sample at each of the next LL decisions without a task failure, or reaches the goal. vmin⁡=0.5v_{\min} = 0.5; unicycle L=8L = 8 (3.2 s), quadrotor L=16L = 16 (2.6 s), humanoid L=20L = 20 steps (0.3 s; a fall in a continuation is not viable). Candidates are evaluated lazily in critic order (the first with v^≥vmin⁡\hat{v} \ge v_{\min} is executed; same choice as evaluating all). Robomimic. The model is a shadow copy of the simulator restored to the current state (MuJoCo state, clock, controller goals and gripper ramp), which a real robot would not have; L=8L = 8 decisions on Can and L=4L = 4 on Square (32 steps each); a moving obstacle is forecast at constant velocity from its positions at the real decision, so the exact-model hypothesis of Proposition 8 does not hold there. Fidelity of the shadow after one chunk (normalised hand and can position): median 0.003–0.005, maximum 0.04–0.06. With vmin⁡=0v_{\min} = 0 the controller reproduced CAST’s saved episodes exactly on one 50-episode block of each request and on Square. CAST-V overrode CAST’s choice at 2–5% of decisions on obstacles and Square and 14–20% on pillars and budgets; it cost about 35 s per Can episode and 20 s per Square episode on one CPU thread (CAST: about 2 s).

Baselines. Output filter: minimal-norm correction of the policy’s chunk onto the linearised certificate, solved as an exact dual QP with relinearisation (a CBF-QP on the chunk). For budgets there are two scaling filters: one caps the effort of every chunk at bb (Table 1, R3; “chunk cap” in Table 9), a stricter rule than the average budget; the other scales the policy’s chunk only as far as the average budget requires, which is CAST with N=1N = 1 and the like-for-like baseline of Figure 2 and Figure 3b. In-denoising projection: the same projection applied to the denoised estimate at every DDIM step, in the manner of SafeDiffuser (Xiao et al., [37]). DPCC (Römer et al., [28]): our port projects every reverse iterate onto the tightened constraint for NN chains started from the latents CAST draws and executes the chain with the smallest cumulative projection. Noise optimisation, in the manner of INSPO (Chen et al., [8]): Adam steps on the latent against the predicted violation, through the differentiable sampler. Critic-free selection: CAST without the critic. Select-then-filter: the sample with the highest value, then the output filter. All arms of a comparison use the same predictor and margins and, where they sample, the same latents; the sampling controllers also share the fallback.

Table 9: Can sweeps behind Figure 3: joint success, 200 shared scenarios per cell; (vv %) marks violation rates of at least 0.5 %; at 9 and 12 cm every controller violates, as empty batches become frequent (Safety paragraph of § 6.4). “Chunk cap” caps every chunk; “scaling” is CAST with N=1N = 1. The guard column of the sample sweep, the scaling column and the last row were added after the planned run (best of eight without a request: 0.905 on the scenarios of the ranking intervention).

Obstacle radius (cm)frozenfilterDPCCcritic-freesel.-then-filterCASTCAST + guard
30.46 (v18)0.56 (v1)0.560.550.870.860.92
60.34 (v35)0.56 (v2)0.58 (v0.5)0.57 (v1)0.850.870.90 (v2)
90.24 (v52)0.50 (v6)0.52 (v8)0.53 (v6)0.78 (v6)0.81 (v6)0.83 (v6)
120.11 (v76)0.34 (v30)0.36 (v32)0.34 (v31)0.51 (v32)0.55 (v32)0.58 (v30)
Effort budget bbchunk capscalingcritic-freesel.-then-scaleCASTCAST + guard
0.100.090.100.080.070.280.27
0.150.230.260.190.160.530.53
0.200.290.320.230.310.640.67
0.250.370.460.350.430.710.68
0.300.410.450.440.630.730.79
0.400.420.510.470.770.840.81
0.600.530.520.540.870.880.91
Samples NN (obstacle 6 cm / budget 0.25)critic-freesel.-then-filterCASTCAST + guard
10.56 / 0.460.56 / 0.460.56 / 0.460.56 / 0.46
20.56 / 0.390.85 / 0.700.87 / 0.660.83 / 0.60
40.56 / 0.380.90 / 0.690.89 / 0.750.90 / 0.71
80.57 / 0.350.85 / 0.430.87 / 0.710.90 / 0.68
160.56 / 0.330.80 / 0.410.80 / 0.680.86 / 0.67
320.57 / 0.290.74 / 0.350.77 / 0.660.78 / 0.60
No request, critic’s best of NN samples, N=1,2,4,8,16,32N = 1, 2, 4, 8, 16, 32: 0.56, 0.87, 0.91, 0.86, 0.80, 0.77

Table 9.

Protocol. Unless stated, N=8N = 8; 200 episodes per manipulation cell and 500 per unicycle cell; all arms of a comparison run on the same scenarios, with paired bootstrap 95 % intervals. The policy, critic and predictor are fixed before the evaluation scenarios are drawn. For four studies the design, scenario seeds and planned comparisons were fixed before any scored episode was run: the new requests (Figure 2), the ranking intervention, the Can sweeps (Figure 3) and the zone family

(Figure 1d). The later studies also had their plans fixed before scoring, except the M/vmin⁡M/v_{\min} ablation, the humanoid’s two tightest budgets, the cells that complete Table 2 and the violation breakdown of Figure 10b. On the new Can and Square requests the planned primary arm was CAST with the guard; plain CAST, reported in the text, was secondary. Not every planned threshold was met: the budget gains on Square and with the camera-only policy were +0.08 against a planned +0.10, and CAST-V did not improve on CAST in manipulation (Figure 5c). Simulations ran in Docker on one workstation (crossing pedestrian and CAST-V ablation: a laptop CPU); a decision of CAST with the guard takes 15 ms on two CPU threads.

CellFrozenFilterCrit.-freeSel.-filterCAST+ guardCAST-V
Can, obst. 0.10 m / 750.270.580.580.890.910.920.89
Can, obst. 0.10 m / 1250.280.560.540.890.890.900.90
Can, obst. 0.20 m / 750.380.560.560.830.850.900.83
Can, obst. 0.20 m / 1250.360.580.560.880.900.920.88
Can, pillar +2 cm0.170.540.570.880.880.910.77
Can, pillar −2 cm0.180.550.580.910.880.910.77
Can, budget 0.200.000.340.310.300.640.550.43
Can, budget 0.300.000.500.430.610.720.780.69
Square, s0, −2 cm0.470.700.660.810.830.770.81
Square, s0, +2 cm0.510.700.700.710.760.810.77
Square, s1, −2 cm0.440.680.690.760.740.720.75
Square, s1, +2 cm0.490.690.680.760.740.710.77
Square, s2, −2 cm0.450.710.710.820.810.780.80
Square, s2, +2 cm0.460.700.700.780.810.790.80
Square, budget 0.250.000.550.540.650.620.600.61
Square, budget 0.300.000.630.620.760.720.680.71
Camera, R10.470.620.620.730.730.740.73
Camera, obstacle 9 cm0.310.430.470.650.660.570.66
Camera, obstacle 12 cm0.140.330.320.410.360.370.40
Camera, budget 0.150.000.270.290.300.340.37–
Camera, budgets 0.20/0.300.030.470.460.510.550.54–
Camera, τ=2\tau= 20.420.550.600.660.720.660.78
Camera, τ=2\tau= 2, budgets 0.20/0.300.040.470.420.590.560.56–

Table 2. Every arm in every cell of Figure 2, with further camera-only cells (9 and 12 cm: Figure 3d; τ\tau: scale of the policy’s initial denoising noise, τ=1\tau= 1 elsewhere) (joint success; 200 shared scenarios per cell; – not run). Frozen: the policy’s own sample, ignoring the request. For budgets, “Filter” scales the policy’s own chunk to the cap (CAST with N=1N = 1; the per-chunk cap filter: Table 9) and select-then-filter selects, then scales.

Additional tables. Table 2–Table 5 give the cells of Figure 2, the compute, the CAST-V ablation and the fallback study; Table 6–Table 10 give the quadrotor, humanoid, unicycle, Can-sweep and CAST-VL cells; Table 11 gives the calibration check.

Budget bbfiltercritic-freesel.-then-filterCASTCAST + guardshuffledCAST-V
1.010.170.020.110.000.000.030.01
1.0150.580.620.710.830.740.610.89
1.020.590.770.830.970.960.740.99
1.0250.580.740.920.990.980.731.00
1.030.580.720.971.000.990.711.00
1.050.630.681.001.001.000.671.00

Table 6. Planar quadrotor: joint success, mean of three policies (500 shared scenarios each); “shuffled”: CAST with its critic’s scores permuted. No certified controller entered a zone or exceeded a budget.

b=1.02b = 1.02, N=1,2,4,8,16N = 1, 2, 4, 8, 16: CAST 0.59, 0.91, 0.94, 0.97, 0.99; select-then-filter 0.59, 0.79, 0.84, 0.83, 0.86

Zone, joint success: frozen 0.36 (violates 40 %), filter 0.44, critic-free 0.43, MPPI 0.61

task critic: sel.-then-filter 0.69, CAST 0.68, guard 0.70, shuffled 0.43; request-conditioned: CAST 1.00, sel.-then-filter 1.00

Table 10: CAST-V without simulated continuations (unseen zones, 3 policies ×\times 500 shared scenarios). Model: simulated continuations. Logs: an ensemble trained on 3000 logged episodes per policy of the critic-free certified controller, labels in hindsight (held-out AUC ≥0.975\ge0.975). Gain gg: execution scales the commands, predictions keep the nominal model. Logs minus model under mismatch: −0.01-0.01 [−0.02-0.02, +0.00+0.00] (pooled over both gains); violations at g=0.7g = 0.7 (worst policy; CAST, CAST-V, CAST-VL): 38 %, 6.4 %, 1.6 %. Proposition 8 does not cover the learned estimate.

Unseen zonesCASTCAST-V, modelCAST-VL
Unicycle, exact model0.810.990.95
Unicycle, actuator gain 0.850.700.960.93
Unicycle, actuator gain 0.70.650.890.90
Quadrotor, exact model0.680.930.98

Table 10.

Budgetfiltercritic-freesel.-then-filterCASTCAST + guardCAST-V
0.50†0.000.000.040.010.000.16
0.52†0.000.000.160.090.010.51
0.550.020.030.600.570.350.86
0.580.180.250.820.820.790.87
0.600.350.430.860.850.870.86
0.650.480.510.880.880.880.89
No request: frozen policy 0.49, critic best-of-8 0.88

Table 7. Humanoid: joint success, mean of three policies (300 shared scenarios each). No certified controller exceeded the budget. †: budgets added after the planned run.

Controllerunseen zones from the familyfixed zone
jointviolationstalljointviolationstall
Frozen policy0.4790.5030.000–––
Output CBF filter0.7210.0000.2050.7260.0000.207
Predictive safety filter0.7460.0000.1570.7320.0000.182
DPCC0.7410.0000.2050.7350.0000.219
Critic-free selection0.7380.0000.187–––
Select-then-filter, task critic0.8600.0000.1130.8670.0000.115
MPPI (knows model, map, goal)0.9080.0000.0220.9480.0000.016
MPC, hard constraints (same)0.9000.0000.0720.9220.0000.058
CAST, task critic0.8090.0000.1470.7880.0000.159
CAST, matched task-target critic0.8270.0000.1460.8210.0000.145
CAST, request-conditioned critic0.9840.0000.0010.9870.0000.006
CAST + guard, task critic0.7860.0000.161–––
CAST + guard, matched task-target critic0.8280.0000.143–––
CAST + guard, request-conditioned critic0.9840.0000.001–––
Select-then-filter, matched task-target critic0.8770.0000.087–––
Select-then-filter, request-conditioned critic0.9840.0000.0010.9870.0000.003
CAST-V, task critic, L=8L = 80.9930.0000.004–––
CAST-V, task critic, L=4L = 40.8030.0000.173–––
CAST-V, task critic, L=2L = 20.8290.0000.151–––
CAST-V, task critic, L=1L = 10.8230.0000.153–––
Viability only, L=8L = 80.9910.0000.008–––

Table 8. Unicycle with a keep-out zone: joint success, violation and stall rates, mean of three policies (500 scenarios each). Left: new zones of the family, unseen by the critics; right: one fixed zone. Matched critics differ only in the label. The planners do not use the policy (one set of 500 scenarios). Arms that draw extra samples use independent latents.

Calibrated forecast margins on Can. Table 11 checks Theorem 1(b) on Can with a slow obstacle seen through a tracker with 5 mm noise. Miscoverage is the share of episodes in which a forecast left its margin; P^[β]\hat{\mathbb{P}}[\beta] is the share in which a hand-prediction error exceeded the certificate’s slack. With margins calibrated over whole episodes, the closed-loop miscoverage stays at or below its target ε\varepsilon up to sampling error (largest excess: 0.055 against 0.05) for the filter and for CAST alike, as the theorem states, and collisions stay at or below 0.5 %. Per-step margins give no episode-level guarantee: a forecast leaves them in more than half of the episodes.

References

  1. [1]Ayush Agrawal and Koushil Sreenath. Discrete control barrier functions for safety-critical control of discrete systems with application to bipedal robot navigation. In Robotics: Science and Systems (RSS), 2017.DOI
  2. [2]Mohammed Alshiekh, Roderick Bloem, Rüdiger Ehlers, Bettina Könighofer, Scott Niekum, and Ufuk Topcu. Safe reinforcement learning via shielding. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 32, 2018.arxiv.org/abs/1708.08611
  3. [3]Aaron D. Ames, Xiangru Xu, Jessy W. Grizzle, and Paulo Tabuada. Control barrier function based quadratic programs for safety critical systems. IEEE Transactions on Automatic Control, 62(8):3861–3876, 2017.DOI
  4. [4]Jean-Pierre Aubin. Viability Theory. Birkhäuser, 1991.
  5. [5]Ahmad Beirami, Alekh Agarwal, Jonathan Berant, Alexander D’Amour, Jacob Eisenstein, Chirag Nagpal, and Ananda Theertha Suresh. Theoretical guarantees on the best-of-n alignment policy. In Proceedings of the 42nd International Conference on Machine Learning, volume 267 of Proceedings of Machine Learning Research, pages 3580–3602, 2025.arxiv.org/abs/2401.01879
  6. [6]Sara Bouraine, Thierry Fraichard, and Hassen Salhi. Provably safe navigation for mobile robots with limited field-of-views in dynamic environments. Autonomous Robots, 32(3):267–283, 2012.
  7. [7]Craig Boutilier, Alon Cohen, Avinatan Hassidim, Vishay Mansour, Ofer Meshi, Martin Mladenov, and Dale Schuurmans. Planning and learning with stochastic action sets. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI), pages 4674–4682, 2018.arxiv.org/abs/1805.02363
  8. [8]Qingyi Chen, Joseph Ruan, and Zachary Kingston. Safe real-time policy steering via noise-space trajectory optimization for one-step generative policies. arXiv preprint arXiv:2609.21220, 2026.arxiv.org/abs/2609.21220
  9. [9]Cheng Chi, Siyuan Feng, Yilun Du, Zhenjia Xu, Eric Cousineau, Benjamin Burchfiel, and Shuran Song. Diffusion policy: Visuomotor policy learning via action diffusion. In Robotics: Science and Systems (RSS), 2023.
  10. [10]Matthew Cleaveland, Insup Lee, George J. Pappas, and Lars Lindemann. Conformal prediction regions for time series using linear complementarity programming. Proceedings of the AAAI Conference on Artificial Intelligence, 38(19):20984–20992, 2024.
  11. [11]Imre Csiszár. I-divergence geometry of probability distributions and minimization problems. The Annals of Probability, 3(1):146–158, 1975.DOI
  12. [12]Scott Fujimoto, David Meger, and Doina Precup. Off-policy deep reinforcement learning without exploration. In Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 2052–2062. PMLR, 2019.arxiv.org/abs/1812.02900
  13. [13]Darshan Gadginmath, Ahmed Allibhoy, and Fabio Pasqualetti. Provably safe generative sampling with constricting barrier functions. Transactions on Machine Learning Research, 2026.arxiv.org/abs/2602.21429
  14. [14]Seyed Kamyar Seyed Ghasemipour, Dale Schuurmans, and Shixiang Shane Gu. EMaQ: Expected-max Q-learning operator for simple yet effective offline and online RL. In Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 3682–3691, 2021.arxiv.org/abs/2007.11091
  15. [15]E. J. Gumbel. The maxima of the mean largest value and of the range. The Annals of Mathematical Statistics, 25(1):76–84, 1954.DOI
  16. [16]H. O. Hartley and H. A. David. Universal bounds for mean range and extreme observation. The Annals of Mathematical Statistics, 25(1):85–99, 1954.DOI
  17. [17]Kai-Chieh Hsu, Haimin Hu, and Jaime F. Fisac. The safety filter: A unified view of safety-critical control in autonomous systems. Annual Review of Control, Robotics, and Autonomous Systems, 7:47–72, 2024.arxiv.org/abs/2309.05837
  18. [18]Songqiao Hu, Zeyi Liu, Shuang Liu, Jun Cen, Zihan Meng, Shihefeng Wang, Xiang Li, and Xiao He. VLSA: Vision-language-action models with plug-and-play safety constraint layer. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2026. arXiv:2512.11891.arxiv.org/abs/2512.11891
  19. [19]Sham Kakade and John Langford. Approximately optimal approximate reinforcement learning. In International Conference on Machine Learning (ICML), pages 267–274, 2002.
  20. [20]Jacky Kwok, Christopher Agia, Rohan Sinha, Matt Foutter, Shulu Li, Ion Stoica, Azalia Mirhoseini, and Marco Pavone. RoboMonkey: Scaling test-time sampling and verification for vision-language-action models. In Proceedings of The 9th Conference on Robot Learning, volume 305 of Proceedings of Machine Learning Research, pages 3200–3217, 2025.arxiv.org/abs/2506.17811
  21. [21]Lars Lindemann, Matthew Cleaveland, Gihyun Shim, and George J. Pappas. Safe planning in dynamic environments using conformal prediction. IEEE Robotics and Automation Letters, 8(8):5116–5123, 2023.arxiv.org/abs/2210.10254
  22. [22]Ajay Mandlekar, Danfei Xu, Josiah Wong, Soroush Nasiriany, Chen Wang, Rohan Kulkarni, Li Fei-Fei, Silvio Savarese, Yuke Zhu, and Roberto Martín-Martín. What matters in learning from offline human demonstrations for robot manipulation. In Conference on Robot Learning (CoRL), 2021.arxiv.org/abs/2108.03298
  23. [23]Angelo Moroncelli, Matteo Rufolo, Gunes Cagin Aydin, Asad Ali Shahid, and Loris Roveda. Diffusion sequence models for generative in-context meta-learning of robot dynamics. arXiv preprint arXiv:2604.13366, 2026.arxiv.org/abs/2604.13366
  24. [24]Mitsuhiko Nakamoto, Oier Mees, Aviral Kumar, and Sergey Levine. Steering your generalists: Improving robotic foundation models via value guidance. In Conference on Robot Learning (CoRL), 2024.arxiv.org/abs/2410.13816
  25. [25]Kensuke Nakamura, Arun L. Bishop, Steven Man, Aaron M. Johnson, Zachary Manchester, and Andrea Bajcsy. How to train your latent control barrier function: Smooth safety filtering under hard-to-model constraints. In Proceedings of the 8th Annual Learning for Dynamics and Control Conference, volume 331 of Proceedings of Machine Learning Research, pages 145–168, 2026.
  26. [26]Junyong Park, Hyeontae Sung, and Heejin Ahn. Sampling-based safety filter with probabilistic restrictiveness guarantee. arXiv preprint arXiv:2604.22149, 2026.arxiv.org/abs/2604.22149
  27. [27]Allen Z. Ren, Justin Lidard, Lars L. Ankile, Anthony Simeonov, Pulkit Agrawal, Anirudha Majumdar, Benjamin Burchfiel, Hongkai Dai, and Max Simchowitz. Diffusion policy policy optimization. In International Conference on Learning Representations (ICLR), 2025.arxiv.org/abs/2409.00588
  28. [28]Ralf Römer, Alexander von Rohr, and Angela P. Schoellig. Diffusion predictive control with constraints. In Proceedings of the 7th Annual Learning for Dynamics and Control Conference, volume 283 of Proceedings of Machine Learning Research, pages 791–803, 2025.arxiv.org/abs/2412.09342
  29. [29]Ralf Römer, Julian Balletshofer, Jakob Thumm, Marco Pavone, Angela P. Schoellig, and Matthias Althoff. From demonstrations to safe deployment: Path-consistent safety filtering for diffusion policies. In IEEE International Conference on Robotics and Automation (ICRA), 2026. arXiv:2511.06385.arxiv.org/abs/2511.06385
  30. [30]Andrea Rosasco, Federico Ceola, Giulia Pasquale, and Lorenzo Natale. KDPE: A kernel density estimation strategy for diffusion policy trajectory selection. In Proceedings of the 9th Conference on Robot Learning, volume 305 of Proceedings of Machine Learning Research, pages 1210–1224, 2025.arxiv.org/abs/2508.10511
  31. [31]Krishnan Srinivasan, Benjamin Eysenbach, Sehoon Ha, Jie Tan, and Chelsea Finn. Learning to be safe: Deep RL with a safety critic. arXiv preprint arXiv:2010.14603, 2020.arxiv.org/abs/2010.14603
  32. [32]Brijen ThananJeyan, Ashwin Balakrishna, Suraj Nair, Michael Luo, Krishnan Srinivasan, Minho Hwang, Joseph E. Gonzalez, Julian Ibarz, Chelsea Finn, and Ken Goldberg. Recovery RL: Safe reinforcement learning with learned recovery zones. IEEE Robotics and Automation Letters, 6 (3):4915–4922, 2021.arxiv.org/abs/2010.15920
  33. [33]Vladimir Vovk, Alexander Gammerman, and Glenn Shafer. Algorithmic Learning in a Random World. Springer, 2005.
  34. [34]Kim P. Wabersich and Melanie N. Zeilinger. A predictive safety filter for learning-based control of constrained nonlinear dynamical systems. Automatica, 129:109597, 2021.arxiv.org/abs/1812.05506
  35. [35]Ziqian Wang and Zhen Zhang. Monotone viability learning for offline safe reinforcement learning. arXiv preprint arXiv:2611.07616, 2026.arxiv.org/abs/2611.07616
  36. [36]Grady Williams, Nolan Wagener, Brian Goldfain, Paul Drews, James M. Rehg, Byron Boots, and Evangelos A. Theodorou. Information theoretic MPC for model-based reinforcement learning. In IEEE International Conference on Robotics and Automation (ICRA), pages 1714–1721, 2017.DOI
  37. [37]Wei Xiao, Tsun-Hsuan Wang, Chuang Gan, Ramin Hasani, Mathias Lechner, and Daniela Rus. SafeDiffuser: Safe planning with diffusion probabilistic models. In International Conference on Learning Representations (ICLR), 2025.

Paper details

vlnc:W_6qemmrx9
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents