Probabilistic Duality for Parallel Gibbs Sampling without Graph Coloring.
Lars M. MeschederSebastian NowozinAndreas GeigerPublished in: CoRR (2016)
Keyphrases
- gibbs sampling
- graph coloring
- belief networks
- markov chain
- combinatorial problems
- topic models
- job shop scheduling
- expectation maximization
- parameter estimation
- approximate inference
- latent dirichlet allocation
- generative model
- probabilistic model
- em algorithm
- phase transition
- scheduling problem
- max sat
- constraint satisfaction problems
- markov chain monte carlo
- bayesian networks
- exact inference
- hyper heuristics
- probability distribution
- linear programming
- conditional probabilities
- probabilistic inference
- graphical models
- metaheuristic
- optimization algorithm
- neural network
- np complete
- lower bound
- image segmentation