junction tree

Learning to Infer Fast by Attending to Sparse Temporal Observations UAI 2026 Lifted Division for Lifted Hugin Belief Propagation AISTATS 2022 On the complexity of the optimal transport problem with graph-structured cost AISTATS 2022 Learning General Latent-Variable Graphical Models with Predictive Belief Propagation AAAI 2020 Parameterised Queries and Lifted Query Answering IJCAI 2018 Privacy Sensitive Construction of Junction Tree Agent Organization for Multiagent Graphical Models PGM 2018 Simple Propagation with Arc-Reversal in Bayesian Networks PGM 2018 Tensor Belief Propagation ICML 2017 Active Learning for Undirected Graphical Model Selection AISTATS 2014 A Junction Tree Framework for Undirected Graphical Model Selection JMLR 2014 Learning Sum-Product Networks with Direct and Indirect Variable Interactions ICML 2014 A Fast and Exact Energy Minimization Algorithm for Cycle MRFs ICML 2013 Computing the M Most Probable Modes of a Graphical Model AISTATS 2013 Faster Algorithms for Max-Product Message-Passing JMLR 2011 Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees AISTATS 2011 Exact inference and learning for cumulative distribution functions on loopy graphs NeurIPS 2010 Exploiting Within-Clique Factorizations in Junction-Tree Algorithms AISTATS 2010 Learning Efficient Markov Networks NeurIPS 2010 An LP View of the M-best MAP problem NeurIPS 2009 Learning Bounded Treewidth Bayesian Networks NeurIPS 2008 Efficient Principled Learning of Thin Junction Trees NeurIPS 2007 Infinite State Bayes-Nets for Structured Domains NeurIPS 2007