Learning discrete Bayesian networks in polynomial time and sample complexity
Adarsh Barik, Jean Honorio

TL;DR
This paper presents a polynomial-time, sample-efficient method for learning the structure of discrete Bayesian networks under certain conditions, using group l12-regularized regression without assuming specific conditional distributions.
Contribution
It introduces a novel approach that guarantees exact structure recovery with polynomial time and logarithmic sample complexity for bounded-degree networks, under certain technical conditions.
Findings
Exact structure recovery under technical conditions
Polynomial time algorithm for Bayesian network learning
Logarithmic sample complexity for bounded-degree networks
Abstract
In this paper, we study the problem of structure learning for Bayesian networks in which nodes take discrete values. The problem is NP-hard in general but we show that under certain conditions we can recover the true structure of a Bayesian network with sufficient number of samples. We develop a mathematical model which does not assume any specific conditional probability distributions for the nodes. We use a primal-dual witness construction to prove that, under some technical conditions on the interaction between node pairs, we can do exact recovery of the parents and children of a node by performing group l_12-regularized multivariate regression. Thus, we recover the true Bayesian network structure. If degree of a node is bounded then the sample complexity of our proposed approach grows logarithmically with respect to the number of nodes in the Bayesian network. Furthermore, our…
| -Score | ||||||||
|---|---|---|---|---|---|---|---|---|
| Network | Our | MMPC | Our Method | MMHC | Greedy | Sparse | Optimal | Exact |
| () | Method | + Greedy | Search | Candidate | Reinsertion | LP | ||
| alarm (37) | ||||||||
| andes (223) | ||||||||
| barley (48) | ||||||||
| carpo (60) | ||||||||
| child (20) | ||||||||
| hailfinder (56) | ||||||||
| mildew (35) | ||||||||
| water (32) | ||||||||
| win95pts (76) | ||||||||
| Negative Log-likelihood | |||
| Network | Our Method | MMHC | Greedy |
| () | + Greedy | ||
| dna (180) | |||
| moviereview (1001) | |||
| retail (135) | |||
| audio(125) | |||
| autos (26) | |||
| jester(100) | |||
| netflix (100) | |||
| r52 (889) | |||
| student-por (33) | |||
| tmovie(500) | |||
| webkb (839) | |||
| promoters (58) | |||
| sponge(45) | |||
| triazines(59) | |||
| wiki4he(53) | |||
| Number | Max | Support : Parent and Children | Support : Markov Blanket | MIPC is |
|---|---|---|---|---|
| of nodes | Degree | (MIPC) holds | (MIMB) holds | weaker than MIMB |
| 100 | 7 | 99.7% | 97.6% | 91.9% |
| 500 | 7 | 99.76% | 96.82% | 93.26% |
| 1000 | 7 | 99.62% | 95.95% | 92.97% |