
Constrained Monte Carlo Markov Chains on Graphs
This paper presents a novel theoretical Monte Carlo Markov chain procedu...
read it

Normalizing Constant Estimation with Gaussianized Bridge Sampling
Normalizing constant (also called partition function, Bayesian evidence,...
read it

A Markov Jump Process for More Efficient Hamiltonian Monte Carlo
In most sampling algorithms, including Hamiltonian Monte Carlo, transiti...
read it

Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chainMonte Carlo algorithm for computingr...
read it

Efficient sampling of conditioned Markov jump processes
We consider the task of generating draws from a Markov jump process (MJP...
read it

Bayesian analysis of Turkish Income and Living Conditions data, using clustered longitudinal ordinal modelling with Bridge distributed randomeffects
This paper is motivated by the panel surveys, called Statistics on Incom...
read it

Gathering with extremely restricted visibility
We consider the classical problem of making mobile processes gather or c...
read it
Schrödinger Bridge Samplers
Consider a reference Markov process with initial distribution π_0 and transition kernels {M_t}_t∈[1:T], for some T∈N. Assume that you are given distribution π_T, which is not equal to the marginal distribution of the reference process at time T. In this scenario, Schrödinger addressed the problem of identifying the Markov process with initial distribution π_0 and terminal distribution equal to π_T which is the closest to the reference process in terms of Kullback–Leibler divergence. This special case of the socalled Schrödinger bridge problem can be solved using iterative proportional fitting, also known as the Sinkhorn algorithm. We leverage these ideas to develop novel Monte Carlo schemes, termed Schrödinger bridge samplers, to approximate a target distribution π on R^d and to estimate its normalizing constant. This is achieved by iteratively modifying the transition kernels of the reference Markov chain to obtain a process whose marginal distribution at time T becomes closer to π_T = π, via regressionbased approximations of the corresponding iterative proportional fitting recursion. We report preliminary experiments and make connections with other problems arising in the optimal transport, optimal control and physics literatures.
READ FULL TEXT
Comments
There are no comments yet.