arXiv Machine Learning
CLAD: Constrained Abstract Domain for Neural Network Verification
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 23
CAffNet: Hard Constraint-Affine Neural Networks
arXiv:2605.24437v2 Announce Type: replace Abstract: We present a novel framework for embedding hard constraint satisfaction into neural network (NN) architectures, specifically feedforward neural net...
arXiv Machine Learning
Aug 26
$(\text{DNN})^2$: Doubly Non-Negative Relaxations for Deep Neural Networks
arXiv:2608.24743v1 Announce Type: new Abstract: Existing linear program (LP) and semidefinite program (SDP) relaxations for rectified linear unit (ReLU) neural network (NN) verification yield overly-...
arXiv Machine Learning
Aug 4
Optimized Piecewise Affine Abstractions of Neural Networks with Learnable Activation Functions
arXiv:2602. 06737v2 Announce Type: replace Abstract: We present a generalized framework for the range verification of neural networks featuring non-linear activation functions.
arXiv AI
Aug 25
Learning with Boolean threshold functions
arXiv:2602.17493v2 Announce Type: replace-cross Abstract: We develop a method for training neural networks on Boolean data in which the values at all nodes are strictly $\pm 1$, and the resulting mod...
Hugging Face Trending Papers
Aug 25
$(\text{DNN})^2$: Doubly Non-Negative Relaxations for Deep Neural Networks
Existing linear program (LP) and semidefinite program (SDP) relaxations for rectified linear unit (ReLU) neural network (NN) verification yield overly-conservative safety guarantees due to significant...
arXiv Machine Learning
Aug 11
Input convex neural networks as surrogates in mathematical optimisation
arXiv:2608. 09707v1 Announce Type: cross Abstract: Embedding trained neural networks as surrogates within optimisation problems is an established practice in operations research.