atlas

Research map / Graph learning / Graph algorithms and clustering

The Linearization of Belief Propagation on Pairwise Markov Random Fields

AAAI 2017 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 10 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace loopy BP with linearized BP (matrix formulation)pairwise MRF node labeling · synthetic planted-potential graphsinference speed per iteration: 50 times faster per iterationHelped
replace loopy BP with linearized BP, weak potentialspairwise MRF node labeling · synthetic planted-potential graphslabeling accuracyNo clear effect
replace loopy BP with linearized BP, strong potentials (h > 3)pairwise MRF node labeling · synthetic planted-potential graphslabeling accuracyHurt
stop iterating early with convergence parameter s near or above 1 (ablation)linearized BP · synthetic graph, f=0.05, h=8, d=5labeling accuracyHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy