AIIC AI Intelligence Centre

SOURCE-LINKED INTELLIGENCE

Optimizing Sparse Boolean Rule Networks using Mixed Integer Linear Programming

arXiv · AI, language, vision and robotics · article · Oct 14, 2026 · UTC

We study the problem of learning accurate and cognitively simple binary classifiers that are directly interpretable as Boolean rules. We propose mixed integer linear programming (MILP) formulations for training sparse disjunctive normal form (DNF) networks, viewed as small networks with a conjunctive hidden layer and a disjunctive output layer. Contrary to previous work that uses MILP for inductive rule learning, we start with a fixed network structure, for which we then find optimal weights. A regularized objective explicitly trades off misclassification costs against sparsity, yielding globa

Read original source ↗ Open in workspace

recordType
paper
region
Global

Evidence & attribution

First collected: 2026-10-15T15:42:31.647Z. This is not the publication date.