- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper addresses verification of vision-based neural feedback systems — closed-loop dynamical systems whose controller observes the state through a camera rather than directly. The key difficulty is that a camera has no closed-form description, so one must replace it with a perception surrogate that maps states to observations. Prior work uses conditional GANs (cGANs) whose latents have no physical meaning, so a verification guarantee over the latent space does not say which environmental conditions it covers; deterministic world models avoid this but have no variation to bound at all.
The paper makes three contributions:
-
A formalization (Sec. 3) of a vision-based neural feedback system as a state-based system whose sensor is a generative surrogate g : \mathbb{R}^n \times \mathbb{Z} \to \mathbb{R}^d, with the state-based case recovered when g is the identity. This lets state-based verification techniques apply directly.
-
A stochastic world model (Sec. 4) whose latents are physically grounded — each latent ranges over an interval of a physical quantity, so the possible observations at a state form a box g(s, \mathbb{Z}) of environmental conditions. The architecture is a DCGAN-style deconvolutional decoder with FiLM modulation, built only from layers standard verifiers can bound (linear, conv, batch norm, ReLU, tanh), with the FiLM product handled by a McCormick relaxation.
-
A verification procedure (Sec. 5, Algorithm 1) combining falsification, forward analysis with abstraction optimization and adaptive refinement, symbolic analysis, and backward analysis, applied cell-by-cell over a partition of the initial set.
Empirically: the world models reproduce held-out frames better than the GAN surrogates on both benchmarks (Table 1) with up to 130× fewer parameters; on the grayscale AEBS benchmark the procedure resolves all 10,000 cells, including the 38% the prior state of the art left unresolved; on the previously unsolved RGB benchmark it resolves over 80% of the state space with a world-model surrogate (Table 2).
Critical strengths
S1. Figure 1 makes the gap visible: the cGAN latent means nothing physically, the deterministic world model has no variation, this one gives a box of grounded latents. "A guarantee over a set of latents does not say which conditions it covers" is the central, correct point.
S2. Folding the sensor into \mathcal{D} = \langle m, n, d, \mathbf{I}, \mathbf{F}, \mathbf{E}, \Xi, h, \mathbf{u}, B, \delta, T, \mathbf{G}, \mathbf{A} \rangle and swapping h for a surrogate g is a small move that pays off: the state-based verification literature (Kochdumper et al., 2023; Sidrane et al., 2022; Akinwande et al., 2026a,b) transfers without re-derivation. Eqs. 2–3 quantify over \Xi explicitly.
S3. Batch norm over layer/group norm, zero-initialised FiLM, McCormick relaxation: each follows from the verification target. 28,591 parameters, 30 s on one H100.
S4. Resolving 100% of the grayscale benchmark where Cai et al. (2025) leave 38% unresolved is a checkable gain. Table 5: 2,208 / 551 / 3 / 3,774 cells decided by forward, abstraction, symbolic and backward analysis; backward alone decides the 2,669 cells the baseline verifies.
S5. Table 1's protocol is right, the SSIM gap (0.713/0.823 against 0.449/0.489) is wide enough, and Figure 4 shows the GANs keep mean intensity and lose structure.
S6. Three real limitations: the guarantee is for the surrogate, not the camera; RGB uses the convolutional head, not the released attention head; symbolic analysis gives 3 cells on grayscale, 0 on RGB, unexplained.
Critical weaknesses
W1. Surrogate fidelity implying verification transfer is asserted, not measured. The abstract's 80% (world model) and 100% (GAN) sit on different surrogates, so the comparison invites a misreading. Table 1's 30k / 136k / 231k models already give the axis: verify each and plot resolved cells against SSIM.
W2. Table 3 belongs in the main text. 120 cells with the convolutional head, 55 with the small attention head, 10 with the released 1.73M one, which is the more accurate head and decides almost nothing. The headline RGB result does not hold for the benchmark as shipped; say so in the abstract, or show one sound abstraction for attention.
W3. Symbolic analysis decides 3 cells of 10,000 and 0 of 10,000 while being one of four pillars. One diagnostic settles it: compare the symbolic bound against the forward bound on the same handful of cells, to separate compounding McCormick looseness from a misallocated 3,600 s budget.
W4. Backward analysis decides 3,774 of 6,536 grayscale cells and 4,216 of 4,677 RGB, yet neither Algorithm 1 nor Appendix D says which intermediate step it uses or how sensitive the count is to that choice. Disable backward and report what remains; Table 5 partitions outcomes, it ablates nothing.
W5. Comparing 1,043 with 374 GPU-hours invites the wrong conclusion. Cost per resolved cell, or cost to reach a fixed verified fraction, is the number to report. The 3,600-hour RGB estimate is an extrapolation and reads as measured.
W6. Figure 5 has no legend and cannot be read quantitatively; RESOLVE hides whether symbolic analysis sees the refined subproblems; \mathbf{E} = {0}^2 in both case studies leaves the disturbance set dead notation; and code at submission rather than acceptance is what makes these bounds checkable.
Questions for authors
On W1 (fidelity → verification transfer): Can you report verified-cell counts for the three world-model sizes on Aircraft Taxiing (or a 10 \times 10 block of AEBS) alongside their RMSE/SSIM? Even a monotone trend on a small block would substantiate the central premise much more than the current argument-by-plausibility.
On W2 (attention head): Is the 10-cell result for the released attention head a soundness limitation (the abstraction is too loose to verify) or a budget limitation (10 GPU-hours is simply too few)? If you doubled the budget to 100 hours, would the count grow linearly (budget-limited) or saturate (abstraction-limited)? This distinction determines whether the open problem is engineering or fundamental.
On W3 (symbolic analysis): On 10 cells where symbolic analysis fails, what is the ratio of the symbolic bound to the forward bound at the same step? If it is > 10^2, the McCormick relaxation of the FiLM product over the unrolled horizon is the likely culprit and should be named; if it is O(1), the budget is the issue.
On W4 (backward analysis): What rule chooses the intermediate step at which the forward bound is handed to backward analysis, and how sensitive is the verified-cell count to that rule? A one-line specification in Algorithm 1 would suffice.
On W5 (cost): Can you report cost-per-verified-cell for both methods on the grayscale benchmark? The 1,043 vs. 374 comparison is misleading without it, and the 10-GPU-hour figure for the baseline's 2,669 cells suggests your method is much cheaper per cell on the easy region and expensive only on the hard region — which is the interesting story.
On the latent box: The world model's latents are held fixed within a rollout and varied across rollouts (Appendix B). Does the verification analysis assume \mathbf{z} can vary independently at every step (as stated in Sec. 4, "\mathbf{z} ranges over \mathbb{Z} independently at every step")? If so, this is a larger set of behaviors than the training distribution covers, which is sound but conservative; if not, the formalization should say so. This matters for interpreting the 80% RGB result.
3 comments
Thanks for answering these instead of rebutting them. Three of your replies actually move me.
The 1,043 GPU-hours being four wall-clock streams sharing one card, so roughly 300 hours on it, is a correction I should have caught myself. My cost objection was weaker than I put it, and reporting per verified cell is the right fix. The 3,600-hour RGB figure being labelled a projection is all I was after.
On the attention head, certifying every attempted cell inside the budget is a fair answer, with the caveat that you took the easier half and expect sublinear growth.
The latent-box clarification I should have asked for; fair. Score stays where it was.
We have uploaded a revised PDF with changes marked in blue. Appendix F.5 reports the fidelity sweep you asked for, four world-model widths verified on the same block with their RMSE, head error, and closed-loop error. Section 6.3 reports cost per verified cell and the GPU accounting behind the 1,043 hours. Section 5 and Algorithm 1 state the rule for the intermediate step (the last step forward analysis completed), and on this benchmark the dynamics alone bound the backward set. Appendix F.4 reports the ratio of the symbolic bound to the forward bound at the same step, which is 1.000 on the cells we measured, so the explanation is saturation rather than budget. Section 5 points to the numerical soundness paragraph, Section 3 notes that the disturbance set is zero in both case studies, and Section 4 states that z varies independently at every step during verification. Thank you for engaging with our responses, and for a review that improved the paper.
Fidelity, cost, and reproducibility
We thank the reviewer for their careful and constructive review, and provide responses below.
Fidelity and verification. We agree that we assert rather than establish the relationship between surrogate fidelity and verification. This is a general limitation of surrogate-based verification, and formalizing that relationship is work that we are actively pursuing. We will add the experiment the reviewer suggests, and verify world models of different sizes on a fixed block of cells. We note that the trend may not be monotone. In our experiments so far, larger world models produce better images, but their bounds are not tighter. We will update the paper to present fidelity as necessary but not sufficient, and we will state in the abstract that the guarantee is for the surrogate.
The attention head. We are able to analyze the attention head, albeit at great budgetary cost. Every cell we attempted was certified within the 10 GPU-hour budget. The released-size attention head is about 50 times more expensive per cell than the convolutional head. The cells we attempted were the easier half of the block, so we expect the number of verified cells to grow sublinearly with budget. We will move Table 3 to the main text and name the convolutional head in the abstract.
Symbolic analysis. The limitations of the symbolic approach on this problem are now better understood. The controller is saturated on the cells we certify, so the control interval at the deciding step is already exact and no tighter relaxation can change the verdict. The remaining cells are cells where the control varies within the cell, and branching is required to make progress on them. On the RGB benchmark the symbolic budget (120 seconds per cell) was also too short for a single call to finish. We therefore believe that the issue is neither the McCormick relaxation nor the budget alone, but that there is little looseness to remove on this problem. We will add the bound-ratio diagnostic the reviewer suggests to confirm this.
Backward analysis. We carry the forward bound to an intermediate step, and then show that the resulting set cannot reach the avoid set within the remaining horizon using the plant's stopping dynamics. This is why backward analysis succeeds on cells where forward analysis accumulates too much conservatism over the horizon. We will state the rule for choosing the intermediate step in Algorithm 1, and we will add the ablation the reviewer suggests.
Cost. We agree that cost per verified cell is the right comparison. The 1043 hours are the sum of per-process wall-clock time with up to four processes sharing one GPU, so the time on the card is roughly 300 hours. The cells the baseline certifies take us under 10 hours, and the rest of the budget was spent on the cells it could not decide. We will report cost per verified cell, and label the 3600-hour RGB estimate as a projection.
Presentation and reproducibility. We will add a legend and per-analysis counts to Figure 5, describe the data flow between analyses in Section 5, spell out the "Same" entries in Table 4, and point to the numerical-soundness paragraph from the main text. We keep the disturbance set in the formalism for generality, and will note that both case studies set it to zero. We intend to release the code with the final version of the paper.
The latent box. Yes, the latent varies independently at every step during verification, while training holds it fixed within a rollout. The certified set therefore strictly contains the training behavior. We will say so in Section 4.