Fast Parallel Bayesian Network Structure Learning
Jiantong Jiang, Zeyi Wen, Ajmal Mian

TL;DR
Fast-BNS is a highly efficient parallel algorithm for Bayesian network structure learning on multi-core CPUs, significantly reducing computation time through various optimization techniques and scalable parallel processing.
Contribution
The paper introduces Fast-BNS, a novel parallel algorithm with optimization strategies that greatly accelerates Bayesian network structure learning on multi-core CPUs.
Findings
Sequential Fast-BNS is up to 50 times faster than existing methods.
Parallel Fast-BNS achieves 4.8 to 24.5 times speedup over state-of-the-art solutions.
Fast-BNS scales well with network size and sample size.
Abstract
Bayesian networks (BNs) are a widely used graphical model in machine learning for representing knowledge with uncertainty. The mainstream BN structure learning methods require performing a large number of conditional independence (CI) tests. The learning process is very time-consuming, especially for high-dimensional problems, which hinders the adoption of BNs to more applications. Existing works attempt to accelerate the learning process with parallelism, but face issues including load unbalancing, costly atomic operations and dominant parallel overhead. In this paper, we propose a fast solution named Fast-BNS on multi-core CPUs to enhance the efficiency of the BN structure learning. Fast-BNS is powered by a series of efficiency optimizations including (i) designing a dynamic work pool to monitor the processing of edges and to better schedule the workloads among threads, (ii) grouping…
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.
