arXiv AI
Jul 21
Lookahead Branching for Neural Network Verification
arXiv:2607. 17290v1 Announce Type: cross Abstract: In this work, we investigate the effect of lookahead branching strategies in neural network verification.
Learning Lookahead Lemmas for Neural Network Verification
arXiv:2607. 29051v1 Announce Type: cross Abstract: State-of-the-art neural network verifiers use the branch-and-bound procedure as their core solving mechanism.
Related stories
Hugging Face Trending Papers
Jul 19
Lookahead Branching for Neural Network Verification
In this work, we investigate the effect of lookahead branching strategies in neural network verification. We present a general recipe to integrate lookahead into any branch-and-bound verifier and demonstrate how one of the current state-of-the-art branching heuristics, FSB, can be viewed as a special instantiation of the lookahead branching strategy.
arXiv Machine Learning
Sep 23
Exploring Solver-Level Warmstarting for Neural Network Verification
arXiv:2609.25962v1 Announce Type: new Abstract: Neural network verification has become a key tool for providing formal guarantees on the behaviour of neural networks. However, many verification probl...
arXiv Machine Learning
Sep 22
PICID: Proof-Driven Clause Learning in Neural Network Verification
arXiv:2503.12083v3 Announce Type: replace-cross Abstract: Current Deep Neural Network (DNN) verifiers are typically designed to prioritize scalability over reliability. Reliability can be reinforced...
arXiv AI
Aug 6
The Luna Bound Propagator for Formal Analysis of Neural Networks
arXiv:2603. 23878v3 Announce Type: replace-cross Abstract: The parameterized CROWN analysis, a.
arXiv Machine Learning
Aug 3
Mining Verdict Boundaries for Neural Network Verification
arXiv:2607. 28954v1 Announce Type: new Abstract: Branch and Bound (BaB) aims to achieve complete verification of neural networks by adaptively partitioning the problem and applying off-the-shelf verifiers to subproblems.
arXiv Machine Learning
Aug 14
Branch and Bound for Relational Verification of Neural Networks
arXiv:2608. 13118v1 Announce Type: new Abstract: Verification of neural networks against relational specifications, such as global robustness, is crucial for safety-critical applications of cyber-physical systems (CPS), given their increasing adoption of AI components.
Hugging Face Trending Papers
Aug 13
Branch and Bound for Relational Verification of Neural Networks
Verification of neural networks against relational specifications, such as global robustness, is crucial for safety-critical applications of cyber-physical systems (CPS), given their increasing adoption of AI components. Compared to simple trace properties (e.
arXiv Computation and Language
Sep 10
TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs
TreeThink is an open‑source Python library that provides modular, fully asynchronous tree search for neural theorem proving. It integrates established tree‑search methods with vLLM inference pipelines and supports a range of node evaluation techniques, from lightweight heuristics to neural evaluators. The library connects directly to the REPL servers of Lean 4, Rocq, and Isabelle/HOL, enabling real‑time verification and proof‑state extraction, and it has been evaluated on miniF2F and MATH500, achieving up to an 8.0× wall‑clock speedup from asynchronous execution.
arXiv Machine Learning
Aug 11
Floating-Point Neural Network Verification at the Software Level
arXiv:2510. 23389v2 Announce Type: replace-cross Abstract: The behaviour of neural network components must be proven correct before deployment in safety-critical systems.
arXiv Machine Learning
Aug 19
Certified but Private: Scalable Zero-Knowledge Proofs for Neural Network Guarantees
PANDA is a scalable system that uses zero‑knowledge proofs to certify the robustness and fairness of neural networks without revealing their private parameters. Built on the CROWN robustness framework, PANDA introduces a novel algorithm for proving linear relaxation bounds on non‑linear activation layers, producing lightweight proofs. The system can generate proofs for networks with over 2.9 million parameters in just five minutes and verify them in ten seconds, scaling polynomially with network size and enabling verification of models four orders of magnitude larger than prior ZKP‑based approaches.
arXiv Machine Learning
Aug 21
Uncovering the Limits of Proof Sharing for Neural Networks
arXiv:2608. 19351v1 Announce Type: new Abstract: Robustness verification of neural networks is increasingly important, due to their use in many critical domains.