Optimizing Sparse Boolean Rule Networks using Mixed Integer Linear Programming
Read the original on arXiv Machine Learning →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.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.