TL;DR
This paper introduces semiparametric Bayesian networks that blend parametric and nonparametric distributions, enhancing flexibility while maintaining manageable complexity, and proposes algorithms to learn their structure from diverse datasets.
Contribution
It presents a novel semiparametric Bayesian network model and adapts structure learning algorithms with cross-validation and early stopping to improve learning accuracy.
Findings
Accurately learns combined parametric and nonparametric components.
Performs comparably to state-of-the-art methods across datasets.
Effectively handles linear, nonlinear, and real-world data.
Abstract
We introduce semiparametric Bayesian networks that combine parametric and nonparametric conditional probability distributions. Their aim is to incorporate the advantages of both components: the bounded complexity of parametric models and the flexibility of nonparametric ones. We demonstrate that semiparametric Bayesian networks generalize two well-known types of Bayesian networks: Gaussian Bayesian networks and kernel density estimation Bayesian networks. For this purpose, we consider two different conditional probability distributions required in a semiparametric Bayesian network. In addition, we present modifications of two well-known algorithms (greedy hill-climbing and PC) to learn the structure of a semiparametric Bayesian network from data. To realize this, we employ a score function based on cross-validation. In addition, using a validation dataset, we apply an early-stopping…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
