Do you want to publish a course? Click here

Constructing sampling schemes via coupling: Markov semigroups and optimal transport

272   0   0.0 ( 0 )
 Added by Nikolas Nuesken
 Publication date 2018
  fields
and research's language is English




Ask ChatGPT about the research

In this paper we develop a general framework for constructing and analysing coupled Markov chain Monte Carlo samplers, allowing for both (possibly degenerate) diffusion and piecewise deterministic Markov processes. For many performance criteria of interest, including the asymptotic variance, the task of finding efficient couplings can be phrased in terms of problems related to optimal transport theory. We investigate general structural properties, proving a singularity theorem that has both geometric and probabilistic interpretations. Moreover, we show that those problems can often be solved approximately and support our findings with numerical experiments. For the particular objective of estimating the variance of a Bayesian posterior, our analysis suggests using novel techniques in the spirit of antithetic variates. Addressing the convergence to equilibrium of coupled processes we furthermore derive a modified Poincare inequality.

rate research

Read More

We analyze random walks on a class of semigroups called ``left-regular bands. These walks include the hyperplane chamber walks of Bidigare, Hanlon, and Rockmore. Using methods of ring theory, we show that the transition matrices are diagonalizable and we calculate the eigenvalues and multiplicities. The methods lead to explicit formulas for the projections onto the eigenspaces. As examples of these semigroup walks, we construct a random walk on the maximal chains of any distributive lattice, as well as two random walks associated with any matroid. The examples include a q-analogue of the Tsetlin library. The multiplicities of the eigenvalues in the matroid walks are ``generalized derangement numbers, which may be of independent interest.
149 - J.-R. Chazottes , F. Redig 2010
We obtain moment and Gaussian bounds for general Lipschitz functions evaluated along the sample path of a Markov chain. We treat Markov chains on general (possibly unbounded) state spaces via a coupling method. If the first moment of the coupling time exists, then we obtain a variance inequality. If a moment of order 1+epsilon of the coupling time exists, then depending on the behavior of the stationary distribution, we obtain higher moment bounds. This immediately implies polynomial concentration inequalities. In the case that a moment of order 1+epsilon is finite uniformly in the starting point of the coupling, we obtain a Gaussian bound. We illustrate the general results with house of cards processes, in which both uniform and non-uniform behavior of moments of the coupling time can occur.
We investigate the dissipativity properties of a class of scalar second order parabolic partial differential equations with time-dependent coefficients. We provide explicit condition on the drift term which ensure that the relative entropy of one particular orbit with respect to some other one decreases to zero. The decay rate is obtained explicitly by the use of a Sobolev logarithmic inequality for the associated semigroup, which is derived by an adaptation of Bakrys $Gamma-$ calculus. As a byproduct, the systematic method for constructing entropies which we propose here also yields the well-known intermediate asymptotics for the heat equation in a very quick way, and without having to rescale the original equation.
We consider sampling and enumeration problems for Markov equivalence classes. We create and analyze a Markov chain for uniform random sampling on the DAGs inside a Markov equivalence class. Though the worst case is exponentially slow mixing, we find a condition on the Markov equivalence class for polynomial time mixing. We also investigate the ratio of Markov equivalence classes to DAGs and a Markov chain of He, Jia, and Yu for random sampling of sparse Markov equivalence classes.
In this paper, we start by showing that the intertwining relationship between two minimal Markov semigroups acting on Hilbert spaces implies that any recurrent extensions, in the sense of It^o, of these semigroups satisfy the same intertwining identity. Under mild additional assumptions on the intertwining operator, we prove that the converse also holds. This connection, which relies on the representation of excursion quantities as developed by Fitzsimmons and Getoor, enables us to give an interesting probabilistic interpretation of intertwining relationships between Markov semigroups via excursion theory: two such recurrent extensions that intertwine share, under an appropriate normalization, the same local time at the boundary point. Moreover, in the case when one of the (non-self-adjoint) semigroup intertwines with the one of a quasi-diffusion, we obtain an extension of Kreins theory of strings byshowing that its densely defined spectral measure is absolutely continuous with respect to the measure appearing in the Stieltjes representation of the Laplace exponent of the inverse local time. Finally, we illustrate our results with the class of positive self-similar Markov semigroups and also the reflected generalized Laguerre semigroups. For the latter, we obtain their spectral decomposition and provide, under some conditions, a perturbed spectral gap estimate for its convergence to equilibrium.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا