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
Approximate Bayesian computation (ABC) is a powerful and elegant framework for performing inference ...
We analyse convex formulations for com-bined discrete-continuous MAP inference us-ing the dual decom...
© 2017 IEEE. We report the results of a series of numerical studies examining the convergence rate f...
International audienceIn this paper gradient and Hamiltonian dynamics are investigated in both discr...
International audienceContinuous relaxations are central to map inference in discrete Markov random ...
We show how the worldline quantum Monte Carlo procedure, which usually relies on an artificial time ...
Numerous models for supervised and reinforcement learning benefit from combinations of discrete and ...
While the design of algorithms is traditionally a discrete endeavour, in recent years many advances ...
We propose new continuous-time formulations for first-order stochastic optimization algorithms such ...
The reparameterization trick enables optimizing large scale stochastic computation graphs via gradie...
International audienceIn this paper, we study a nonconvex continuous relaxation of MAP inference in ...
The recently introduced self-learning Monte Carlo method is a general-purpose numerical method that ...
Approaches like finite differences with common random numbers, infinitesimal perturbation analysis, ...
International audienceWe study the optimization of a continuous function by its stochastic relaxatio...
We show how to use a variational approximation to the logistic function to perform approximate infer...
Approximate Bayesian computation (ABC) is a powerful and elegant framework for performing inference ...
We analyse convex formulations for com-bined discrete-continuous MAP inference us-ing the dual decom...
© 2017 IEEE. We report the results of a series of numerical studies examining the convergence rate f...
International audienceIn this paper gradient and Hamiltonian dynamics are investigated in both discr...
International audienceContinuous relaxations are central to map inference in discrete Markov random ...
We show how the worldline quantum Monte Carlo procedure, which usually relies on an artificial time ...
Numerous models for supervised and reinforcement learning benefit from combinations of discrete and ...
While the design of algorithms is traditionally a discrete endeavour, in recent years many advances ...
We propose new continuous-time formulations for first-order stochastic optimization algorithms such ...
The reparameterization trick enables optimizing large scale stochastic computation graphs via gradie...
International audienceIn this paper, we study a nonconvex continuous relaxation of MAP inference in ...
The recently introduced self-learning Monte Carlo method is a general-purpose numerical method that ...
Approaches like finite differences with common random numbers, infinitesimal perturbation analysis, ...
International audienceWe study the optimization of a continuous function by its stochastic relaxatio...
We show how to use a variational approximation to the logistic function to perform approximate infer...
Approximate Bayesian computation (ABC) is a powerful and elegant framework for performing inference ...
We analyse convex formulations for com-bined discrete-continuous MAP inference us-ing the dual decom...
© 2017 IEEE. We report the results of a series of numerical studies examining the convergence rate f...