Bridging Efficiency and Safety: Formal Verification of Neural Networks with Early Exits
Yizhak Yisrael Elboher, Avraham Raviv, Amihay Elboher, Zhouxing Shi, Omri Azencot, Hillel Kugler, Guy Katz

TL;DR
This paper introduces a formal verification framework for neural networks with early exits, balancing safety and efficiency, and demonstrating improved verification performance and robustness analysis.
Contribution
It defines a new robustness property for early exit neural networks and presents an optimized verification algorithm that enhances efficiency while maintaining correctness.
Findings
Early exits improve verification speed and robustness.
The proposed algorithm outperforms standard methods on benchmarks.
Early exit architectures facilitate better safety and efficiency trade-offs.
Abstract
Ensuring the safety and efficiency of AI systems is a central goal of modern research. Formal verification provides guarantees of neural network robustness, while early exits improve inference efficiency by enabling intermediate predictions. Yet verifying networks with early exits introduces new challenges due to their conditional execution paths. In this work, we define a robustness property tailored to early exit architectures and show how off-the-shelf solvers can be used to assess it. We present a baseline algorithm, enhanced with an early stopping strategy and heuristic optimizations that maintain soundness and completeness. Experiments on multiple benchmarks validate our framework's effectiveness and demonstrate the performance gains of the improved algorithm. Alongside the natural inference acceleration provided by early exits, we show that they also enhance verifiability,…
Peer Reviews
Decision·Submitted to ICLR 2026
- The paper formulates robustness property that handles the conditional execution logic inherent in EE networks. This addresses the challenge of multiple potential output layers and conditional branching in verification. - The theoretical analysis establishes that the problem is Fixed Parameter Tractable (FPT) under trace stability assumptions. This helps provide insights into when EE verification becomes useful. - Results show that adding early exits improves verifiability compared to stand
- The method only improves runtime of solvable cases, i.e., if the underlying verifier cannot verify a property given sufficient time, neither can the EE approach. From a practical standpoint, verification is typically a one-time cost that can run for days, limiting the real-world utility of runtime improvements. That said, EE would be beneficial from competitions where runtime matters. - The algorithm scales poorly in the worst case, requiring E·(C-1)+1 verification queries (E is # exits and
* Tackles an underexplored intersection between neural networks with early exits and formal verification. * Theoretical development, proofs, and algorithms are clear and internally consistent. * Experiments are well executed across multiple datasets and architectures, supporting the main claims. * The presentation is clean and well structured, making it easy to follow the core ideas.
* The novelty is somewhat limited. The work mainly adapts existing verification methods to networks with conditional exits, which, while useful, feels like an incremental extension rather than a conceptual breakthrough. * While the initial idea of applying formal verification to early-exit networks is well motivated, many of the subsequent algorithmic and analytical components follow naturally from that setup and feel more like straightforward extensions than new conceptual contributions. * A la
1. Precise redefinition of robustness with EEs and proofs of soundness/completeness for both algorithms; FPT analysis under trace stability gives theoretical insight. 2. Alg. 2’s early break and continue checks skip redundant exit evaluations once safety or unsafety is determined, greatly speeding up SAFE certifications (e.g., VGG-16 cases that previously timed out). 3. Adding EEs often accelerates verification (particularly SAFE instances) and exit placement/thresholds provide a tunable ac
1. Because α/β-CROWN lacked nested AND encoding, queries were decomposed into multiple conjunctive calls; this may distort absolute runtimes and comparability to “vanilla” queries. A native-AND backend (e.g., Marabou) could change results. 2. Scope restricted to local robustness and ReLU. Theory and claims lean on ReLU and local robustness; no formal handling of other properties (e.g., fairness/safety specs) or activations beyond brief discussion. 3. Runs are on a single M3 machine with m
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Advanced Neural Network Applications · Explainable Artificial Intelligence (XAI)
