New Message Passing Methods for Min-Max and Sum-Product Inference

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Unknown venue

• Publication date

  2018-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Incomplete Algorithms

  2021cited by this paper
• Min-max and min-max regret versions of some combinatorial optimization problems: a survey

  2016cited by this paper
• Perturbed message passing for constraint satisfaction problems

  2014cited by this paper
• Revisiting Algebra and Complexity of Inference in Graphical Models

  2014cited by this paper
• A Message-Passing Approach to Decentralized Parallel Machine Scheduling

  2014influential reference
• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs

  2013cited by this paper
• Density Propagation and Improved Bounds on the Partition Function

  2012cited by this paper
• Cavity approach to sphere packing in Hamming space.

  2012cited by this paper
• Fast Exact Inference for Recursive Cardinality Models

  2012cited by this paper
• On the performance of a cavity method based algorithm for the Prize-Collecting Steiner Tree Problem on graphs

  2012cited by this paper
• Complexity on Parallel Machine Scheduling: A Review

  2012cited by this paper
• Comparison of Heuristics for Identical Parallel Machine Scheduling

  2012cited by this paper
• Robust max-product belief propagation

  2011cited by this paper
• Information, Physics and Computation, by Marc Mézard and Andrea Montanari

  2010influential reference
• Melting of Peridotite to 140 Gigapascals

  2010cited by this paper
• Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

  2010cited by this paper
• HOP-MAP: Efficient Message Passing with High Order Potentials

  2010cited by this paper
• libDAI: A Free and Open Source C++ Library for Discrete Approximate Inference in Graphical Models

  2010cited by this paper
• A Binary Variable Model for Affinity Propagation

  2009cited by this paper
• Efficient belief propagation for higher-order cliques using linear constraint nodes

  2008cited by this paper
• The Bottleneck TSP

  2007cited by this paper
• Is SP BP

  2007cited by this paper
• Efficient inference with cardinality-based clique potentials

  2007cited by this paper
• Loop Corrections for Approximate Inference on Factor Graphs

  2007cited by this paper
• Cooled and Relaxed Survey Propagation for MRFs

  2007cited by this paper
• MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies

  2007cited by this paper
• Survey Propagation Revisited

  2007cited by this paper
• Phase Transitions in the Coloring of Random Graphs

  2007cited by this paper
• Clustering by Passing Messages Between Data Points

  2007cited by this paper
• Truncating the Loop Series Expansion for Belief Propagation

  2006cited by this paper
• Convergent Tree-Reweighted Message Passing for Energy Minimization

  2006cited by this paper
• Linear Programming Relaxations and Belief Propagation - An Empirical Study

  2006cited by this paper
• Loop series for discrete statistical models on graphs

  2006cited by this paper
• Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies

  2006cited by this paper
• Pattern Recognition and Machine Learning

  2006cited by this paper
• Constructing free-energy approximations and generalized belief propagation algorithms

  2005cited by this paper
• Cluster Variation Method in Statistical Physics and Probabilistic Graphical Models

  2005cited by this paper
• MAP estimation via agreement on trees: message-passing and linear programming

  2005cited by this paper
• Coding for the blackwell channel: a survey propagation approach

  2005cited by this paper
• Asymmetric k-center is log* n-hard to approximate

  2005cited by this paper
• Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes

  2005cited by this paper
• How to compute loop corrections to the Bethe approximation

  2005cited by this paper
• A new look at survey propagation and its generalizations

  2004cited by this paper
• Survey propagation as local equilibrium equations

  2003cited by this paper
• Polynomial iterative algorithms for coloring and analyzing random graphs.

  2003cited by this paper
• Survey propagation: An algorithm for satisfiability

  2002cited by this paper
• Factor graphs and the Sum-Product Algorithm

  2002cited by this paper
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation

  2002cited by this paper
• Analytic and Algorithmic Solution of Random Satisfiability Problems

  2002cited by this paper
• Stable Fixed Points of Loopy Belief Propagation Are Local Minima of the Bethe Free Energy

  2002cited by this paper
• Constraint Satisfaction by Survey Propagation

  2002cited by this paper
• A LISTFIT heuristic for minimizing makespan on identical parallel machines

  2001cited by this paper
• Recursive conditioning

  2001cited by this paper
• On the complexity of a class of combinatorial optimization problems with uncertainty

  2001cited by this paper
• The capacity of low-density parity-check codes under message-passing decoding

  2001cited by this paper
• The Generalized Distributive Law and Free Energy Minimization

  2001cited by this paper
• Graphical Models for Game Theory

  2001cited by this paper
• The generalized distributive law

  2000cited by this paper
• The Capacitated K-Center Problem

  2000cited by this paper
• Generalized Belief Propagation

  2000cited by this paper
• Correctness of Local Probability Propagation in Graphical Models with Loops

  2000cited by this paper
• Loopy Belief Propagation for Approximate Inference: An Empirical Study

  1999cited by this paper
• A Revolution : Belief Propagation inGraphs With

  1998cited by this paper
• Graphical models in R

  1996cited by this paper
• An O(log*n) approximation algorithm for the asymmetric p-center problem

  1996cited by this paper
• Scheduling: Theory, Algorithms, and Systems

  1994cited by this paper
• Probabilistic reasoning in intelligent systems: Networks of plausible inference

  1991cited by this paper
• The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks

  1990influential reference
• Local computations with probabilities on graphical structures and their application to expert systems

  1990cited by this paper
• A unified approach to approximation algorithms for bottleneck problems

  1986influential reference
• A simple heuristic for the p-centre problem

  1985influential reference
• Clustering to Minimize the Maximum Intercluster Distance

  1985cited by this paper
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

  1984cited by this paper
• Guaranteed performance heuristics for the bottleneck travelling salesman problem

  1984influential reference
• Min-Max Results in Combinatorial Optimization

  1982cited by this paper
• The Computational Complexity of the m -Center Problems on the Plane

  1981cited by this paper
• Likelihood calculations for matched case-control studies and survival studies with tied death times

  1981cited by this paper
• Technical Note - An Improved Algorithm for the Bottleneck Assignment Problem

  1971cited by this paper
• Flow Networks and Combinatorial Operations Research

  1966cited by this paper
• Bounds for certain multiprocessing anomalies

  1966cited by this paper
• THE BOTTLENECK ASSIGNMENT PROBLEM

  1959cited by this paper

• No citing papers are available for this paper.