2024
Convergence of Some Convex Message Passing Algorithms to a Fixed Point
ICML 2024spotlight
A popular approach to the MAP inference problem in graphical models is to minimize an upper bound obtained from a dual linear programming or Lagrangian relaxation by (block-)coordinate descent. This is also known as convex/convergent message passing; examples are max-sum diffusion and sequential tre…