Co-occurring keywords · papers mentioning both
Papers
On the Relationship Between Monotone and Squared Probabilistic Circuits
AAAI 2025
Abductive Reasoning in Logical Credal Networks
NeurIPS 2024
A Fast and Sound Tagging Method for Discontinuous Named-Entity Recognition
EMNLP 2024
Polynomial Semantics of Tractable Probabilistic Circuits
UAI 2024
Theory-guided Message Passing Neural Network for Probabilistic Inference
AISTATS 2024
Approximate inference of marginals using the IBIA framework
NeurIPS 2023
Query Training: Learning a Worse Model to Infer Better Marginals in Undirected Graphical Models with Hidden Variables
AAAI 2021
Relaxed Marginal Consistency for Differentially Private Query Answering
NeurIPS 2021
Deep Convolutional Sum-Product Networks
AAAI 2019
Look Ma, No Latent Variables: Accurate Cutset Networks via Compilation
ICML 2019
Marginal Inference in Continuous Markov Random Fields Using Mixtures
AAAI 2019
On the Convergence of Gaussian Belief Propagation with Nodes of Arbitrary Size
JMLR 2019
Efficient Localized Inference for Large Graphical Models
IJCAI 2018
The Effect of Combination Functions on the Complexity of Relational Bayesian Networks
PGM 2016
Uprooting and Rerooting Graphical Models
ICML 2016
Barrier Frank-Wolfe for Marginal Inference
NeurIPS 2015
Message Passing for Collective Graphical Models
ICML 2015
Sampling from Probabilistic Submodular Models
NeurIPS 2015
Transformation of Markov Random Fields for Marginal Distribution Estimation
CVPR 2015
Efficient Inference for Complex Queries on Complex Distributions
AISTATS 2014
Bethe Bounds and Approximating the Global Optimum
AISTATS 2013
Discrete MRF Inference of Marginal Densities for Non-uniformly Discretized Variable Space
CVPR 2013
Discriminative Learning of Sum-Product Networks
NeurIPS 2012
Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction
NeurIPS 2012
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
AISTATS 2010