No article text was recorded for this version.
tree-reweighted max-product
Version 1 of 148 papers91 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- Blog: Belief Propagation for Linear Programming
- Blog: MAP estimation via agreement on trees: message-passing and linear programming
- Blog: MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies
- Blog: MAP Inference Via ℓ 2-Sphere Linear Program Reformulation
- Blog: Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization
- Blog: Loopy Belief Propagation for Bipartite Maximum Weight b-Matching
- Blog: Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees.
- Blog: Linear programming analysis of loopy belief propagation for weighted matching
- Blog: Max-Product Belief Propagation for Linear Programming: Convergence and Correctness
- Blog: Uniqueness of BP fixed point for the Potts model and applications to community detection
- Blog: Message passing for maximum weight independent set
- Blog: On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs
- Blog: Belief Propagation for Min-cost Network Flow: Convergence & Correctness
- Blog: Proteins, Particles, and Pseudo-Max-Marginals: A Submodular Approach
- Blog: On the Optimality of Tree-reweighted Max-product Message-passing
- Blog: Convergence of min-sum message passing for quadratic optimization
- Blog: Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Blog: Worst-case bounds on the quality of max-product fixed-points
- Blog: Maximum weight matching via max-product belief propagation
- Blog: Graph Rigidity, Cyclic Belief Propagation, and Point Pattern Matching.
- Blog: Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Blog: Message Passing for Max-weight Independent Set
- Blog: MAP Estimation, Message Passing, and Perfect Graphs
- Blog: A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
- Blog: Using a Deformation Field Model for Localizing Faces and Facial Points under Weak Supervision
- Blog: Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins
- Blog: Stochastic block model entropy and broadcasting on trees with survey
- Blog: Clusters and Coarse Partitions in LP Relaxations
- Blog: MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
- Blog: Efficient Structured Prediction with Latent Variables for General Graphical Models
- Blog: Biclustering Using Message Passing
- Blog: New Outer Bounds on the Marginal Polytope
- Blog: A Binary Factor Graph Model for Biclustering
- Blog: Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
- Blog: Document and Corpus Level Inference For Unsupervised and Transductive Learning of Information Structure of Scientific Documents
- Blog: Density Evolution for Asymmetric Memoryless Channels
- Blog: MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation
- Blog: Efficient Inference in Stochastic Block Models With Vertex Labels
- Blog: Hidden Hamiltonian Cycle Recovery via Linear Programming
- Blog: Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing
- Blog: Message-passing for Maximum Weight Independent Set
- Blog: Characterizing Tightness of LP Relaxations by Forbidding Signed Minors
- Blog: Max Product for Max-Weight Independent Set and Matching
- Blog: Minimum Weight Perfect Matching via Blossom Belief Propagation
- Blog: Exact MAP Estimates by (Hyper)tree Agreement
- Blog: Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
- Blog: Tightness of LP via Max-product Belief Propagation
History & citation
Current · Permanent link
- This direction split from loopy belief propagation convergence (58% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_tree_reweighted_max_product_ae532291,
title = {tree-reweighted max-product},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tree-reweighted-max-product/rdr_ae5322911c5c4b69b616286ea09704fc},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_tree_reweighted_max_product_ae532291_v1,
title = {tree-reweighted max-product},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tree-reweighted-max-product/rdr_ae5322911c5c4b69b616286ea09704fc/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}