2012
NIPS
NeurIPS 2012
Continuous Relaxations for Discrete Hamiltonian Monte Carlo
Abstract
Continuous relaxations play an important role in discrete optimization, but have not seen much use in approximate probabilistic inference. Here we show that a general form of the Gaussian Integral Trick makes it possible to transform a wide class of discrete variable undirected models into fully continuous systems. The continuous representation allows the use of gradient-based Hamiltonian Monte Carlo for inference, results in new ways of estimating normalization constants (partition functions), and in general opens up a number of new avenues for inference in difficult discrete systems. We demonstrate some of these continuous relaxation inference algorithms on a number of illustrative problems.
🌉
Interdisciplinary Bridge
— Artificial Intelligence and Machine Learning and Mathematics & Optimization
🧭
Keyword Pioneer
— discrete inference
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio
📈
Trend Setter
— Markov Chain Monte Carlo
Authors
Topics
Artificial Intelligence > Bayesian & Probabilistic > Probabilistic Modeling
Machine Learning > Learning Types > Unsupervised Learning
Machine Learning > Optimization & Theory > Bayesian Inference
Mathematics & Optimization > Optimization > Stochastic Methods
Machine Learning > Optimization & Theory > Stochastic Methods
Machine Learning > Bayesian & Probabilistic > Bayesian Inference
Machine Learning > Bayesian & Probabilistic > Variational Inference
Machine Learning > Bayesian & Probabilistic > Markov Chain Monte Carlo
Machine Learning > Learning Types > Sampling
Machine Learning > Optimization & Theory > Sampling