Co-occurring keywords · papers mentioning both
Papers
Inference algorithms for pattern-based CRFs on sequence data
ICML 2013
Linear Approximation to ADMM for MAP inference
ACML 2013
Nonlinearly Constrained MRFs: Exploring the Intrinsic Dimensions of Higher-Order Cliques
CVPR 2013
On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori Perturbations
NeurIPS 2013
Scaling the Indian Buffet Process via Submodular Maximization
ICML 2013
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passing
ICML 2013
Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization
CVPR 2013
Universality of the Local Marginal Polytope
CVPR 2013
Convergence Rate Analysis of MAP Coordinate Minimization Algorithms
NeurIPS 2012
Efficient and Exact MAP-MRF Inference using Branch and Bound
AISTATS 2012
Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins
NeurIPS 2012
Learning as MAP Inference in Discrete Graphical Models
NeurIPS 2012
Learning Low-order Models for Enforcing High-order Statistics
AISTATS 2012
MAP Inference in Chains using Column Generation
NeurIPS 2012
Multiple Choice Learning: Learning to Produce Multiple Structured Outputs
NeurIPS 2012
Near-Optimal MAP Inference for Determinantal Point Processes
NeurIPS 2012
Priors for Diversity in Generative Latent Variable Models
NeurIPS 2012
Scaling MPE Inference for Constrained Continuous Markov Random Fields with Consensus Optimization
NeurIPS 2012
Adaptive Exact Inference in Graphical Models
JMLR 2011
Message-Passing for Approximate MAP Inference with Latent Variables
NeurIPS 2011
Tighter Relaxations for MAP-MRF Inference: A Local Primal-Dual Gap based Separation Algorithm
AISTATS 2011
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
AISTATS 2010
HOP-MAP: Efficient Message Passing with High Order Potentials
AISTATS 2010
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
JMLR 2010
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
AISTATS 2010