Tighter Linear Program Relaxations for High Order Graphical Models.
Elad MezumanDaniel TarlowAmir GlobersonYair WeissPublished in: CoRR (2013)
Keyphrases
- high order
- graphical models
- linear program
- lp relaxation
- linear programming
- linear programming relaxation
- belief propagation
- lower bound
- higher order
- integer program
- optimal solution
- column generation
- random variables
- probabilistic model
- np hard
- semi infinite
- message passing
- objective function
- mixed integer
- pairwise
- upper bound
- markov networks
- bayesian networks
- structure learning
- conditional random fields
- dynamic programming
- integer programming
- primal dual
- interior point methods
- markov random field
- feasible solution
- valid inequalities
- semidefinite
- knapsack problem
- cutting plane
- computational complexity
- image processing