No article text was recorded for this version.
MAP inference complexity
Version 2 of 2226 papers255 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A new algorithm for finding MAP assignments to belief networks
- Blog: New Results for the MAP Problem in Bayesian Networks
- Blog: The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages
- Blog: Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks
- Blog: Variational Algorithms for Marginal MAP
- Blog: LPMLN, Weak Constraints, and P-log
- Blog: Accelerated Message Passing for Entropy-Regularized MAP Inference
- Blog: Maximum A Posteriori Inference in Sum-Product Networks
- Blog: Low-Rank Constraints for Fast Inference in Structured Models
- Blog: Maximum a Posteriori Estimation by Search in Probabilistic Programs
- Blog: NP-hardness of MAP in Ternary Tree Bayesian Networks
- Blog: MAP estimation via agreement on trees: message-passing and linear programming
- Blog: Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference
- Blog: Neural Network Approximators for Marginal MAP in Probabilistic Circuits
- Blog: Solving MAP Exactly using Systematic Search
- Blog: MAP Complexity Results and Approximation Methods
- Blog: Local Approximate Inference Algorithms
- Blog: Maximum Persistency via Iterative Relaxed Inference in Graphical Models.
- Blog: New Results for the MAP Problem in Bayesian Networks
- Blog: Partial Optimality by Pruning for MAP-Inference with General Graphical Models
- Blog: Scaling-Up MAP and Marginal MAP Inference in Markov Logic
- Blog: MAP Inference Via ℓ 2-Sphere Linear Program Reformulation
- Blog: Inference in Graphical Models via Semidefinite Programming Hierarchies
- Blog: Complexity Results and Approximation Strategies for MAP Explanations
- Blog: Solving Marginal MAP Exactly by Probabilistic Circuit Transformations
- Blog: Markov Random Fields with Efficient Approximations
- Blog: An Augmented Lagrangian Approach to Constrained MAP Inference
- Blog: On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori Perturbations
- Blog: Viterbi Decoding of Directed Acyclic Transformer for Non-Autoregressive Machine Translation
- Blog: Approximating MAP by Compensating for Structural Relaxations
- Blog: Graph Cuts Always Find a Global Optimum for Potts Models (With a Catch)
- Blog: A Delayed Column Generation Strategy for Exact k-Bounded MAP Inference in Markov Logic Networks
- Blog: Partial Optimality of Dual Decomposition for MAP Inference in Pairwise MRFs
- Blog: Dynamic MAP Calculations for Abduction
- Blog: How Hard is Inference for Structured Prediction?
- Blog: Conditions beyond treewidth for tightness of higher-order LP relaxations
- Blog: Tightness of LP Relaxations for Almost Balanced Models
- Blog: Bethe-ADMM for Tree Decomposition based Parallel MAP Inference
- Blog: Approximating the Sum Operation for Marginal-MAP Inference
- Blog: Fast search for Dirichlet process mixture models
- Blog: Hinge-Loss Markov Random Fields and Probabilistic Soft Logic
- Blog: Clusters and Coarse Partitions in LP Relaxations
- Blog: MAP Inference via L2-Sphere Linear Program Reformulation
- Blog: Variational message passing neural network for Maximum-A-Posteriori (MAP) inference
- Blog: Efficient Computation of Jointree Bounds for Systematic MAP Search
- Blog: Determinantal point processes for machine learning
- Blog: Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees.
- Blog: Maximum A Posteriori Inference in Sum-Product Networks
- Blog: Tightening LP Relaxations for MAP using Message Passing
- Blog: From Fields to Random Trees
- Blog: Computing the M Most Probable Modes of a Graphical Model
- Blog: Improving Grammar-based Sequence-to-Sequence Modeling with Decomposition and Constraints
- Blog: Perturb-and-max-product: Sampling and learning in discrete energy-based models
- Blog: Coarse-to-Fine Lifted MAP Inference in Computer Vision
- Blog: Message-Passing for Approximate MAP Inference with Latent Variables
- Blog: Solving Marginal MAP Problems with NP Oracles and Parity Constraints
- Blog: Distributed Anytime MAP Inference
- Blog: Newton-type Methods for Inference in Higher-Order Markov Random Fields
- Blog: Tractable Learning for Complex Probability Queries
- Blog: Correct Convergence of Min-Sum Loopy Belief Propagation in a Block Interpolation Problem
Showing 60 of 226 papers.
History & citation
Current · Permanent link
- integrality gap minimization split from this direction (67% overlap)
- recursive best-first search split from this direction (55% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_map_inference_complexity_8599092d,
title = {MAP inference complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/map-inference-complexity/rdr_8599092d082a47fe981198f731561d83},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 2, frozen text):
@misc{lacuna_map_inference_complexity_8599092d_v2,
title = {MAP inference complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/map-inference-complexity/rdr_8599092d082a47fe981198f731561d83/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}