arXiv AI
Learning with Boolean threshold functions
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Jun 19
DisjunctiveNet: Neural Symbolic Learning via Differentiable Convexified Optimization Layers
arXiv:2605. 30456v2 Announce Type: replace Abstract: Many learning tasks in science and engineering are characterized by sparse datasets, which limits the effectiveness of purely data-driven approaches.
arXiv Machine Learning
6d ago
Optimizing Sparse Boolean Rule Networks using Mixed Integer Linear Programming
The paper introduces mixed integer linear programming (MILP) formulations for training sparse disjunctive normal form (DNF) networks, which are small networks with a conjunctive hidden layer and a disjunctive output layer. By fixing the network structure and optimizing weights, the authors achieve globally optimized rule sets that balance misclassification costs against sparsity. Their enhanced formulation reduces integer decision variables and redundant constraints, and a combined initialization and dropout approach breaks weight symmetries to promote diverse, stable rule representations, leading to improved computational efficiency and competitive accuracy on synthetic and UCI datasets.
arXiv AI
Sep 15
Certifiably Interpretable Training of ReLU-MLPs for Boolean Tasks with Guaranteed Truth-Table Generalization
The paper introduces MACCHIATO, a training algorithm that builds a ReLU‑MLP from partial truth‑table data while simultaneously constructing an explicit Boolean circuit over AND, OR, and XOR gates that certifies the network’s computation. The method iteratively projects residuals onto low‑dimensional Boolean classes, compiles the resulting circuit into a ReLU‑MLP, and uses logic minimization and influence‑based variable selection to achieve a six‑layer network with provable truth‑table error bounds. Experiments on synthetic random‑junta tasks show that these certified networks outperform Adam‑trained MLPs in data‑sparse or projection‑aligned regimes and complete faster than flat ESPRESSO in certain settings.
arXiv Machine Learning
Oct 7
CLAD: Constrained Abstract Domain for Neural Network Verification
arXiv:2609.34628v2 Announce Type: replace-cross Abstract: Neural network verification (NNV) formally verifies that a network satisfies a specified property for all inputs within a defined region. Mod...
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 AI
Jul 28
Exact and Asymptotically Complete Robust Verifications of Neural Networks via Ising Solvers
arXiv:2603. 00408v2 Announce Type: replace-cross Abstract: We present an Ising-compatible framework for formal neural-network robustness verification under bounded input perturbations.