- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Constrained Lagrangian Abstract Domain (CLAD), a method for computing neural-network bounds over an input ball intersected with additional convex constraints. CLAD retains affine bound propagation and linear activation relaxations, while replacing conventional box-based concretization with constrained optimization. The method uses Lagrangian primal–dual updates and a supporting-tangent certificate that remains sound at intermediate iterations. The paper analyzes soundness and exact concretization under specified assumptions and reports partial Lean mechanization. Experiments on four convolutional networks and motion-blur perturbations show that CLAD certifies 1,146 class-margin properties, compared with 939 for GCP-CROWN, at generally comparable aggregate runtimes.
Critical strengths
-- The paper proposed a method -- CLAD, addresses a meaningful limitation of box-based concretization. Additional input constraints can exclude infeasible extremal points, producing tighter intermediate bounds and potentially stabilizing more activation units.
-- The method supports sound early termination in real arithmetic. Instead of using an unconverged Lagrangian value as a certificate, CLAD constructs a bound from a convex supporting tangent.
Critical weaknesses
-- In the Evaluation section, verified-instance counts and runtime metrics are appropriate, but the 1,944 instances are expanded class-margin checks derived from only three images per network/perturbation-strength combination. The paper does not report how many images have all nine margins certified. It also lacks direct measurements of bound gaps and evaluation across multiple simultaneous additional constraints. Consequently, the results demonstrate increased certification of selected subproperties more clearly than improved image-level robustness certification or general scalability to convex intersections.
-- The evaluation does not sufficiently establish the advantage over constraint-aware alternatives or isolate the contribution beyond existing bound propagation. Furthermore, although Sections 2–3 explain the conceptual difference from DeepPoly, a matched ablation using identical symbolic propagation and activation relaxations is missing. Comparisons against trusted constrained optimization on representative subproblems would also show how closely the practical solver approaches the claimed tight concretization.
Questions for authors
-- What are the exact differences between CLAD and the DeepPoly/CROWN baseline when no additional constraints are present? Are activation relaxations, intermediate-bound initialization, and optimization settings matched?
-- How many evaluated images have all nine class margins certified by each method? Please also clarify whether images are reused across perturbation strengths.
-- How do the tightness results apply to the hinge penalties used in the implementation? Please distinguish exact affine concretization from exact neural-network output bounds.
Response to Reviewer 7F65
We thank the reviewer for recognizing our meaningful contribution in broadening the support of DNN verification and for the constructive feedback to our experimental section.
W1. Image-level results and broader constraints are missing
Counts aggregate all specification types, with per-image totals counting fully certified image/specification settings.
CROWN/DeepPolyalpha-CROWNSDP-CROWNGCP-CROWNClip-and-VerifyCLADCLADleads both reported metrics, with each full image/specification certificate requiring all nine margins.CLAD's substantially higher per-class count shows a clear precision advantage over the paper's baselines.W2. The comparison does not isolate constrained concretization
alpha-CROWNuse the same symbolic propagation approach asCLADwithout handling input constraints.CLAD(1146) solved significantly more instances thanalpha-CROWN(927), which shows a clear precision advantage of the constraint-aware concretization.Q1. How does unconstrained
CLADdiffer fromCROWN/DeepPoly?CLAD(without linear slope optimization) andCROWN/DeepPolybaseline share the bound propagation and activation relaxation.CLADuses the input constraints to tighten bounds on hidden neurons and network outputs on every concretization step. As a result,CLAD(1146) solved more instances thanCROWN/DeepPoly(777) andalpha-CROWN(927).Q2. How many images have all nine margins certified?
As shown in W1,
CLADsolved 74 images (out of 216) with all nine margins certified, more than any baselines.Q3.1. Do hinge penalties preserve tightness?
The tightness result carries over directly to the hinge penalty formulation. Because each hinge is zero on the feasible set and never falls below the original constraint function, the hinge bound is sound for any non-negative multipliers and is at least as tight as the bound in Theorem C.4. Assume convex constraints and under Slater's condition, the standard dual bound attains the exact optimum at optimal multipliers, which forces the hinge bound to achieve exact tightness as well. We will add this derivation to Appendix C.
Q3.2. Distinguish exact affine concretization from exact neural-network output bounds.
The concretization step optimizes on top of a linear bound that already approximates the network, so exact affine concretization is not exact neural network output bounds.