A learned controller can meet a task specification on several disconnected regions of physical parameter space. With few calibration measurements, a generic confidence interval may certify none of those regions. We study how a verified task set can instead determine a fixed-task acceptance rule. For a scalar Gaussian estimate, we reduce the worst unsafe-parameter risk to finitely many boundary evaluations when every acceptance component is separated from its boundary by at least one standard error. The result supports component-specific radii; maximizing a same-component power objective then becomes a convex optimization problem. Exact-rational inner-set verification connects the statistical calculation to repeated feedback with a shared uncertain restitution coefficient. On 63 tasks from 15 learned controllers, four-measurement acceptance increases from 41.0% with a gap-based test to 44.0% with a common boundary-calibrated radius and 44.7% with component allocation. Eight tasks change from zero to positive acceptance. Tighter-tolerance experiments locate this benefit in the narrow-component regime, and an independent checkpoint study compares calibration-aware selection with imitation and task-loss selection. Matched composite-null, continuum-search, and conformal controls identify which gains require Gaussian information and which are computational. The contribution is a calibrated post-training validation procedure under explicit model and measurement contracts, rather than a guarantee of unrestricted physical transfer.
Response to Reviewer S4Pv
Thank you for the frank feedback. We rewrote the abstract in plain words and added a worked example to the introduction (new Figure 1(a), page 2).
The problem. A neural-network controller drives an object between two walls toward a goal. Whether it succeeds depends on the restitution (the fraction of speed the object keeps at each bounce), which is not known exactly. A verifier proves that the task succeeds for every restitution in a set S, so S contains no failing value. For learned controllers S often consists of several separate intervals (five in Figure 1(a)). We can afford only a few noisy measurements of the restitution, for example four. When does the resulting estimate justify claiming success, so that a wrong claim has probability at most 5% whatever the true value is?
Why the standard answers fail. The usual rule claims success only when the 95% confidence interval (a plausible range for the restitution) fits inside one safe interval, which never happens in Figure 1(a) because every safe interval there is too short. Applying a 5% rule to each safe interval separately is invalid. If the true restitution is a failing value in a short gap between two safe intervals, the rules on both sides can each wrongly claim success, together with probability up to 9.8% (Section 5.2). A valid alternative, the standard "gap rule", claims success only when the estimate lies inside a safe interval by a margin that grows as the narrowest gap between safe intervals shrinks. In Figure 1(a) it also never claims success.
What the paper contributes. With K safe intervals, Theorem 1 shows that the worst probability of a wrong claim over the infinitely many failing values equals the largest of 2K exactly computable numbers. This holds whenever every estimate that triggers a claim lies at least one standard error (the estimate's typical error) inside its interval. With a separate margin for each interval, Theorem 2 shows that choosing the margins to maximize a lower bound on the chance of a correct claim is a convex optimization problem, which can be solved reliably. Averaged over 63 tasks (different controllers, starts, goals and horizons) and over true values in each verified set, a correct claim with four measurements is made 41.0% of the time with the gap rule, 44.0% with our one-margin rule and 44.7% with our per-interval margins. All three rules keep the probability of a wrong claim at or below 5%.
If any passage is still unclear, we would be grateful for a pointer to it.