Tighter Linear Program Relaxations for High Order Graphical Models.
Elad MezumanDaniel TarlowAmir GlobersonYair WeissPublished in: UAI (2013)
Keyphrases
- high order
- graphical models
- linear program
- lp relaxation
- linear programming
- linear programming relaxation
- lower bound
- belief propagation
- higher order
- column generation
- np hard
- semi infinite
- integer program
- optimal solution
- probabilistic model
- random variables
- upper bound
- message passing
- pairwise
- interior point methods
- dynamic programming
- bayesian networks
- structure learning
- primal dual
- mixed integer
- feasible solution
- objective function
- conditional random fields
- markov random field
- machine learning
- markov networks
- search algorithm
- integer programming
- approximation algorithms
- knapsack problem
- semidefinite programming
- branch and bound
- least squares