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.
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.
Related stories
arXiv AI
Aug 3
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.
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 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.
Hugging Face Trending Papers
6d ago
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 Machine Learning
5d ago
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.
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 AI
Jun 9
Scaling Neural Network Verification with Tensor Parallelism and Fully Sharded Data Parallelism
arXiv:2606. 09377v1 Announce Type: cross Abstract: Formal neural network verification -- proving that a network satisfies safety properties for \emph{all} inputs in a specified domain -- is bounded in practice by GPU memory: standard implementations of bound-propagation algorithms (IBP, CROWN, $\alpha$-CROWN) require weight and relaxation-coefficient matrices to reside entirely on one accelerator.
Hugging Face Trending Papers
Jun 8
Scaling Neural Network Verification with Tensor Parallelism and Fully Sharded Data Parallelism
Formal neural network verification -- proving that a network satisfies safety properties for \emph{all} inputs in a specified domain -- is bounded in practice by GPU memory: standard implementations of bound-propagation algorithms (IBP, CROWN, $α$-CROWN) require weight and relaxation-coefficient matrices to reside entirely on one accelerator. We adapt two parallelism techniques originally developed for large-scale model training to the \texttt{auto\_LiRPA}\,/\,$α,β$-CROWN verification framework.
arXiv AI
Jun 3
Neural Network Verification using Partial Multi-Neuron Relaxation
arXiv:2605. 30155v3 Announce Type: replace-cross Abstract: The increasing integration of deep neural networks in critical systems has spawned a theoretical and practical interest in formally guaranteeing safety properties about their behavior.
arXiv AI
Jul 28
DeepLook: Deeper Thinking with Lookahead
arXiv:2607. 22602v1 Announce Type: new Abstract: Inference-time scaling has emerged as a powerful paradigm for improving large language model reasoning, often delivering larger gains on difficult reasoning tasks than parameter scaling alone.
arXiv AI
Jul 13
Fully Trainable Deep Differentiable Logic Gate Networks and Lookup Table Networks
arXiv:2607. 09399v1 Announce Type: cross Abstract: We introduce a novel method for both partial and full optimization of the connections in deep differentiable logic gate networks (LGNs) and lookup table networks (LUTNs).