ReMAP: Lossless Residual Neural Lifting for Scalable MAP Inference in Arbitrary-Order Markov Random Fields
Not on the map. Why?
Abstract (arXiv)
Maximum a posteriori inference in a finite Markov random field is generally NP-hard. We study an instance-wise optimizer that minimizes the exact multilinear energy under product marginals. The canonical parameterization adds a GNN output to free per-node logits. This residual bypass is a global change of coordinates, so the lifting preserves the infimum, critical points, local extrema (modulo the GNN-parameter fiber), and Hessian inertia of the free-logit problem. Joint gradient flow then induces the preconditioner I+JJtop: the GNN cannot enlarge the feasible set, but it can add dissipation |Jtopnablaℓ|22. For a two-layer branch this extra coupling is four-hop local. We also show that every finite critical point of a nonconstant multilinear objective is a saddle, and that a unique MAP gap Gamma makes conditional-expectation rounding exact once the relaxed gap falls below Gamma; residual gradient flow and joint gradient descent then obey explicit O(1/t) and O(1/k) rates in a small-gap region, with an improved bound under residual alignment. Experiments on synthetic MRFs, UAI 2022 benchmarks, and Physical Cell Identity (PCI) problems evaluate this residual geometry at scale.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 46 references that are in the map. First posted on arXiv 28 Nov 2024.
Builds on
23 of 46 references.
References · 23
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2021Combinatorial optimization and reasoning with graph neural networkscited by 268
- 2020Solving Mixed Integer Programs Using Neural Networkscited by 182
- 2021Combinatorial Optimization with Physics-Inspired Graph Neural Networkscited by 108
11 more
- 2019GMNN: Graph Markov Neural Networkscited by 82
- 2023Unsupervised Learning for Solving the Travelling Salesman Problemcited by 58
- 2020Neural Enhanced Belief Propagation on Factor Graphscited by 57
- 2018Inference in Probabilistic Graphical Models by Graph Neural Networkscited by 38
- 2020Belief Propagation Neural Networkscited by 33
- 2023Factor Graph Neural Networkscited by 15
- 2013A new look at reweighted message passingcited by 9
- 2024Boosting Graph Pooling with Persistent Homologycited by 9
- 2014Conditional Random Field Autoencoders for Unsupervised Structured Predictioncited by 8
- 2024Learning to Solve the Constrained Most Probable Explanation Task in Probabilistic Graphical Modelscited by 3
- 2024Neural Network Approximators for Marginal MAP in Probabilistic Circuitscited by 2
Built on by
Not cited yet.