message passing

Minimization of Continuous Bethe Approximations: A Positive Variation NeurIPS 2012 Minimizing Sparse High-Order Energies by Submodular Vertex-Cover NeurIPS 2012 Online Sum-Product Computation Over Trees NeurIPS 2012 Part & Clamp: Efficient Structured Output Learning AISTATS 2012 An Application of Tree-Structured Expectation Propagation for Channel Decoding NeurIPS 2011 Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011 Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Functions on Graphs JMLR 2011 Fast b-matching via Sufficient Selection Belief Propagation AISTATS 2011 Faster Algorithms for Max-Product Message-Passing JMLR 2011 Generalised Coupled Tensor Factorisation NeurIPS 2011 Kernel Belief Propagation AISTATS 2011 Machine Learning Markets AISTATS 2011 Message-Passing for Approximate MAP Inference with Latent Variables NeurIPS 2011 Revisiting MAP Estimation, Message Passing and Perfect Graphs AISTATS 2011 Structure Learning for Optimization NeurIPS 2011 A Primal-Dual Message-Passing Algorithm for Approximated Large Scale Structured Prediction NeurIPS 2010 Boosted Optimization for Network Classification AISTATS 2010 Coherent Inference on Optimal Play in Game Trees AISTATS 2010 Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials JMLR 2010 Dense Message Passing for Sparse Principal Component Analysis AISTATS 2010 HOP-MAP: Efficient Message Passing with High Order Potentials AISTATS 2010 MAP Estimation for Graphical Models by Likelihood Maximization NeurIPS 2010 MAP estimation in Binary MRFs via Bipartite Multi-cuts NeurIPS 2010 Maximum-likelihood learning of cumulative distribution functions on graphs AISTATS 2010 Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes JMLR 2010