Stacking Factorizing Partitioned Expressions in Hybrid Bayesian Network Models
Hybrid Bayesian networks (HBN) contain complex conditional probabilistic distributions (CPD) specified as partitioned expressions over discrete and continuous variables. The size of these CPDs grows exponentially with the number of parent nodes when using discrete inference, resulting in significant inefficiency. Normally, an effective way to reduce the CPD size is to use a binary factorization (BF) algorithm to decompose the statistical or arithmetic functions in the CPD by factorizing the number of connected parent nodes to sets of size two. However, the BF algorithm was not designed to handle partitioned expressions. Hence, we propose a new algorithm called stacking factorization (SF) to decompose the partitioned expressions. The SF algorithm creates intermediate nodes to incrementally reconstruct the densities in the original partitioned expression, allowing no more than two continuous parent nodes to be connected to each child node in the resulting HBN. SF can be either used independently or combined with the BF algorithm. We show that the SF+BF algorithm significantly reduces the CPD size and contributes to lowering the tree-width of a model, thus improving efficiency.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Partitioned hybrid learning of Bayesian network structures
We develop a novel hybrid method for Bayesian network structure learning called partitioned hybrid greedy search (pHGS), composed of three distinct yet compatible new algorithms: Partitioned PC (pPC) accelerates skeleton…
Personalized Federated Learning via Stacking
Traditional Federated Learning (FL) methods typically train a single global model collaboratively without exchanging raw data. In contrast, Personalized Federated Learning (PFL) techniques aim to create multiple models t…
Federated LearningPersonalized Federated LearningPrivacy PreservingBayesian hierarchical stacking: Some models are (somewhere) useful
Stacking is a widely used model averaging technique that asymptotically yields optimal predictions among linear averages. We show that stacking is most effective when model predictive performance is heterogeneous in inpu…
Bayesian InferenceTime SeriesTime Series AnalysisPartitioned Tensor Factorizations for Learning Mixed Membership Models
We present an efficient algorithm for learning mixed membership models when the number of variables p is much larger than the number of hidden components k. This algorithm reduces the computational complexity of sta…
Stacking hybrid GARCH models for forecasting Bitcoin volatility
Machine learning techniques have been used frequentlyfor volatility forecasting. However, previous studies have built these hybrid models in a form of a first-order GARCH(1,1) process by following general use for GARCH m…
feature selectionMeta-Learning