Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
S. Acid, L. M. de Campos

TL;DR
This paper introduces a novel local search method for Bayesian network structure learning that operates in a reduced search space of restricted acyclic partially directed graphs (RPDAGs), potentially improving efficiency and solution quality.
Contribution
It proposes a new search space for Bayesian network structure learning based on RPDAGs, which reduces configurations and may find better local optima than traditional DAG-based methods.
Findings
Improved efficiency in structure search.
Potential to find better local optima.
Validated on test problems including Alarm Monitoring System.
Abstract
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on independence criteria, and those based on a scoring function and a search procedure (although some methods combine the two). Within the score+search paradigm, the dominant approach uses local search methods in the space of directed acyclic graphs (DAGs), where the usual choices for defining the elementary modifications (local changes) that can be applied are arc addition, arc deletion, and arc reversal. In this paper, we propose a new local search method that uses a different search space, and which takes account of the concept of equivalence between network structures: restricted acyclic partially directed graphs (RPDAGs). In this way, the number of different configurations of the search space is reduced, thus…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
