Journal Article

Differentiable learning of matricized DNFs and its application to Boolean networks

Sato, Taisuke, Inoue, Katsumi

2023

Overview

Boolean networks (BNs) are well-studied models of genomic regulation in biology where nodes are genes and their state transition is controlled by Boolean functions. We propose to learn Boolean functions as Boolean formulas in disjunctive normal form (DNFs) by an explainable neural network Mat_DNF and apply it to learning BNs. Directly expressing DNFs as a pair of binary matrices, we learn them using a single layer NN by minimizing a logically inspired non-negative cost function to zero. As a result, every parameter in the network has a clear meaning of representing a conjunction or literal in the learned DNF. Also we can prove that learning DNFs by the proposed approach is equivalent to inferring interpolants in logic between the positive and negative data. We applied our approach to learning three literature-curated BNs and confirmed its effectiveness. We also examine how generalization occurs when learning data is scarce. In doing so, we introduce two new operations that can improve accuracy, or equivalently generalizability for scarce data. The first one is to append a noise vector to the input learning vector. The second one is to continue learning even after learning error becomes zero. The first one is explainable by the second one. These two operations help us choose a learnable DNF, i.e., a root of the cost function, to achieve high generalizability.

• Publisher: Springer US,Springer Nature B.V
• Subject: Artificial Intelligence / Boolean / Boolean functions / Canonical forms / Computer Science / Control / Cost function / Equivalence / Learning / Machine Learning / Mechatronics / Natural Language Processing (NLP) / Neural networks / Robotics / Simulation and Modeling / Special Issue on Learning and Reasoning 2022