Automating Model Comparison in Factor Graphs
Bayesian state and parameter estimation have been automated effectively in a variety of probabilistic programming languages. The process of model comparison on the other hand, which still requires error-prone and time-consuming manual derivations, is often overlooked despite its importance. This paper efficiently automates Bayesian model averaging, selection, and combination by message passing on a Forney-style factor graph with a custom mixture node. Parameter and state inference, and model comparison can then be executed simultaneously using message passing with scale factors. This approach shortens the model design cycle and allows for the straightforward extension to hierarchical and temporal model priors to accommodate for modeling complicated time-varying processes.
Code (1)
Tasks
modelparameter estimationProbabilistic ProgrammingSimilar Papers 제목 키워드 기반
KALAM: toolKit for Automating high-Level synthesis of Analog computing systeMs
Diverse computing paradigms have emerged to meet the growing needs for intelligent energy-efficient systems. The Margin Propagation (MP) framework, being one such initiative in the analog computing domain, stands out due…
Bayesian InferenceHigh-Level SynthesisLDPC codes: comparing cluster graphs to factor graphs
We present a comparison study between a cluster and factor graph representation of LDPC codes. In probabilistic graphical models, cluster graphs retain useful dependence between random variables during inference, which a…
A Factor Graph Approach to Automated Design of Bayesian Signal Processing Algorithms
The benefits of automating design cycles for Bayesian inference-based algorithms are becoming increasingly recognized by the machine learning community. As a result, interest in probabilistic programming frameworks has m…
Bayesian Inferenceparameter estimationProbabilistic ProgrammingState Space Models+1Measuring Similarity in Causal Graphs: A Framework for Semantic and Structural Analysis
Causal graphs are commonly used to understand and model complex systems. Researchers often construct these graphs from different perspectives, leading to significant variations for the same problem. Comparing causal grap…
Semantic SimilaritySemantic Textual SimilarityBayesian Sparse Factor Models and DAGs Inference and Comparison
In this paper we present a novel approach to learn directed acyclic graphs (DAG) and factor models within the same framework while also allowing for model comparison between them. For this purpose, we exploit the connect…
valid