Linear Response Algorithms for Approximate Inference in Graphical Models
From MaRDI portal
Publication:4823748
DOI10.1162/08997660460734056zbMATH Open1097.68118OpenAlexW2098823658WikidataQ52001910 ScholiaQ52001910MaRDI QIDQ4823748FDOQ4823748
Authors: Max Welling, Yee Whye Teh
Publication date: 28 October 2004
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/08997660460734056
Recommendations
- Linear estimation in models based on a graph
- Likelihood-based inference for exponential-family random graph models via linear programming
- scientific article; zbMATH DE number 3928425
- Graphical model parameter learning by inverse linear programming
- A new algorithm for the maximum likelihood estimation of graphical log-linear models
- scientific article; zbMATH DE number 549945
- AN ALGORITHMIC APPROACH TO BAYESIAN LINEAR MODEL CALCULATIONS
- scientific article; zbMATH DE number 5957368
- scientific article; zbMATH DE number 6253970
Cites Work
Cited In (9)
- Improving variational methods via pairwise linear response identities
- Approximate inverse Ising models close to a Bethe reference point
- Covariances, robustness, and variational Bayes
- Recursive sum-product algorithm for generalized outer-planar graphs
- Tree-based reparameterization framework for analysis of sum-product and related algorithms
- Title not available (Why is that?)
- Cycle-based cluster variational method for direct and inverse inference
- Gaussian belief propagation solvers for nonsymmetric systems of linear equations
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
This page was built for publication: Linear Response Algorithms for Approximate Inference in Graphical Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4823748)