Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms

• URL: http://arxiv.org/abs/2609.10276v1
• Date: Wed, 09 Sep 2026 14:57:11 GMT
• Title: Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms
• Abstract summary: This paper introduces an evolutionary approach for consensus in structural Bayesian Network (BN) fusion under the constraint of limited treewidth.<n>The consensus BN aims to reconcile multiple input BNs into a single one that retains key structural features present in the original networks.<n>A genetic algorithm is proposed to look for a BN that codifies as much information about the unrestricted fusion as possible while ensuring the treewidth restriction.
• Score: 3.4473935399022415
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper introduces an evolutionary computation approach for consensus in structural Bayesian Network (BN) fusion under the constraint of limited treewidth. The consensus BN aims to reconcile multiple input BNs into a single one that retains key structural features present in the original networks. Treewidth, a graph-based parameter associated with computationally tractable inference, is utilized to restrict the complexity of the resulting network. A genetic algorithm is proposed to look for a BN that codifies as much information about the unrestricted fusion as possible while ensuring the treewidth restriction. Experimental evaluation demonstrates the genetic algorithm's ability to obtain consensus BNs with limited treewidth, providing a valuable tool for aggregating information from diverse sources while returning a computationally actionable model.

Related papers

• Genetic Algorithms for Tractable Bayesian Network Fusion via Pre-Fusion Edge Pruning [3.5232028627328895]
  This paper introduces a consensus framework that prioritizes shared structures among input networks while enforcing treewidth constraints.<n> Experiments on synthetic and real-world BNs show the superiority of the proposed genetic algorithms over the adapted methods and greedy baselines.
  arXiv  Detail & Related papers  (2026-09-03T11:55:48Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• Bayesian Network Structural Consensus via Greedy Min-Cut Analysis [3.5232028627328895]
  Min-Cut Bayesian Network Consensus (MCBNC) is a greedy method for structural consensus of Bayesian Networks (BNs)<n>MCBNC prunes weak edges from an initial unrestricted fusion using a structural score based on min-cut analysis.<n>The method is scalable, data-agnostic, and well-suited for distributed or federated scenarios.
  arXiv  Detail & Related papers  (2025-04-01T06:47:33Z)
• A Discrete Perspective Towards the Construction of Sparse Probabilistic Boolean Networks [3.807361298718093]
  We propose a novel Greedy Entry Removal (GER) algorithm for constructing sparse PBNs. GER gives the best performance among state-of-the-art sparse PBN construction algorithms.
  arXiv  Detail & Related papers  (2024-07-16T09:50:04Z)
• Robust Training and Verification of Implicit Neural Networks: A Non-Euclidean Contractive Approach [64.23331120621118]
  This paper proposes a theoretical and computational framework for training and robustness verification of implicit neural networks. We introduce a related embedded network and show that the embedded network can be used to provide an $ell_infty$-norm box over-approximation of the reachable sets of the original network. We apply our algorithms to train implicit neural networks on the MNIST dataset and compare the robustness of our models with the models trained via existing approaches in the literature.
  arXiv  Detail & Related papers  (2022-08-08T03:13:24Z)
• BScNets: Block Simplicial Complex Neural Networks [79.81654213581977]
  Simplicial neural networks (SNN) have recently emerged as the newest direction in graph learning. We present Block Simplicial Complex Neural Networks (BScNets) model for link prediction. BScNets outperforms state-of-the-art models by a significant margin while maintaining low costs.
  arXiv  Detail & Related papers  (2021-12-13T17:35:54Z)
• Algorithm Unrolling for Massive Access via Deep Neural Network with Theoretical Guarantee [30.86806523281873]
  Massive access is a critical design challenge of Internet of Things (IoT) networks. We consider the grant-free uplink transmission of an IoT network with a multiple-antenna base station (BS) and a large number of single-antenna IoT devices. We propose a novel algorithm unrolling framework based on the deep neural network to simultaneously achieve low computational complexity and high robustness.
  arXiv  Detail & Related papers  (2021-06-19T05:23:05Z)
• Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks [68.9026534589483]
  RioGNN is a novel Reinforced, recursive and flexible neighborhood selection guided multi-relational Graph Neural Network architecture. RioGNN can learn more discriminative node embedding with enhanced explainability due to the recognition of individual importance of each relation.
  arXiv  Detail & Related papers  (2021-04-16T04:30:06Z)
• Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition [161.09660864941603]
  We improve the scalability of Branch and Bound (BaB) algorithms for formally proving input-output properties of neural networks. We present a novel activation-based branching strategy and a BaB framework, named Branch and Dual Network Bound (BaDNB) BaDNB outperforms previous complete verification systems by a large margin, cutting average verification times by factors up to 50 on adversarial properties.
  arXiv  Detail & Related papers  (2021-04-14T09:22:42Z)
• A Convergence Theory Towards Practical Over-parameterized Deep Neural Networks [56.084798078072396]
  We take a step towards closing the gap between theory and practice by significantly improving the known theoretical bounds on both the network width and the convergence time. We show that convergence to a global minimum is guaranteed for networks with quadratic widths in the sample size and linear in their depth at a time logarithmic in both. Our analysis and convergence bounds are derived via the construction of a surrogate network with fixed activation patterns that can be transformed at any time to an equivalent ReLU network of a reasonable size.
  arXiv  Detail & Related papers  (2021-01-12T00:40:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.