Discrete sticky couplings of functional autoregressive processes

In this paper, we provide bounds in Wasserstein and total variation distances between the distributions of the successive iterates of two functional autoregressive processes with isotropic Gaussian noise of the form Yk+1 = Tγ(Yk) + √ γσ2Zk+1 and Ỹk+1 = T̃γ(Ỹk)+ √ γσ2Z̃k+1. More precisely, we give non-asymptotic bounds on ρ(L(Yk),L(Ỹk)), where ρ is an appropriate weighted Wasserstein distance or a V -distance, uniformly in the parameter γ, and on ρ(πγ , π̃γ), where πγ and π̃γ are the respective stationary measures of the two processes. The class of considered processes encompasses the Euler-Maruyama discretization of Langevin diffusions and its variants. The bounds we derive are of order γ as γ → 0. To obtain our results, we rely on the construction of a discrete sticky Markov chain (W (γ) k )k∈N which bounds the distance between an appropriate coupling of the two processes. We then establish stability and quantitative convergence results for this process uniformly on γ. In addition, we show that it converges in distribution to the continuous sticky process studied in [20, 18]. Finally, we apply our result to Bayesian inference of ODE parameters and numerically illustrate them on two particular problems.

[1]  Alain Durmus,et al.  High-dimensional Bayesian inference via the unadjusted Langevin algorithm , 2016, Bernoulli.

[2]  Miranda C. Holmes-Cerfon,et al.  Sticky Brownian Motion and its Numerical Solution , 2019, SIAM Rev..

[3]  A. Eberle,et al.  Sticky couplings of multidimensional diffusions with different drifts , 2016, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.

[4]  Mykhaylo Shkolnikov,et al.  Multidimensional sticky Brownian motions as limits of exclusion processes , 2013, 1302.2678.

[5]  F. Browder Nonlinear functional analysis and its applications , 1986 .

[6]  A. Eberle Couplings, distances and contractivity for diffusion processes revisited , 2013 .

[7]  Tony Shardlow,et al.  A Perturbation Theory for Ergodic Markov Chains and Application to Numerical Approximations , 2000, SIAM J. Numer. Anal..

[8]  Christopher John Howitt,et al.  Stochastic flows and sticky Brownian motion , 2007 .

[9]  Alain Durmus,et al.  Analysis of Langevin Monte Carlo via Convex Optimization , 2018, J. Mach. Learn. Res..

[10]  Shinzo Watanabe,et al.  On stochastic differential equations for multi-dimensional diffusion processes with boundary conditions II , 1971 .

[11]  D. Rudolf,et al.  Perturbation bounds for Monte Carlo within Metropolis via restricted approximations , 2018, Stochastic processes and their applications.

[12]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[13]  L. Ambrosio,et al.  Gradient Flows: In Metric Spaces and in the Space of Probability Measures , 2005 .

[14]  S. Mukherjee,et al.  Approximations of Markov Chains and High-Dimensional Bayesian Inference , 2015 .

[15]  A. Cherny,et al.  Singular Stochastic Differential Equations , 2004 .

[16]  M. Manhart,et al.  Markov Processes , 2018, Introduction to Stochastic Processes and Simulation.

[17]  A. Y. Mitrophanov,et al.  Sensitivity and convergence of uniformly ergodic Markov chains , 2005 .

[18]  Richard McElreath,et al.  Statistical Rethinking: A Bayesian Course with Examples in R and Stan , 2015 .

[19]  D. Burkholder Distribution Function Inequalities for Martingales , 1973 .

[20]  D. Rudolf,et al.  Perturbation theory for Markov chains via Wasserstein distance , 2015, Bernoulli.

[21]  M. Yor,et al.  Continuous martingales and Brownian motion , 1990 .

[22]  Mateusz B. Majka,et al.  Quantitative contraction rates for Markov chains on general state spaces , 2018, Electronic Journal of Probability.

[23]  Alain Durmus,et al.  Convergence of diffusions and their discretizations: from continuous to discrete processes and back , 2019, 1904.09808.

[24]  Valentin De Bortoli,et al.  Efficient stochastic optimisation by unadjusted Langevin Monte Carlo , 2019, Statistics and Computing.

[25]  A. Dalalyan Theoretical guarantees for approximate sampling from smooth and log‐concave densities , 2014, 1412.7392.

[26]  S. Meyn,et al.  Computable exponential convergence rates for stochastically ordered Markov processes , 1996 .

[27]  É. Moulines,et al.  Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm , 2015, 1507.05021.

[28]  Achim Klenke,et al.  Probability theory - a comprehensive course , 2008, Universitext.

[29]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[30]  Arnak S. Dalalyan,et al.  User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient , 2017, Stochastic Processes and their Applications.

[31]  Martin E. Dyer,et al.  An elementary analysis of a procedure for sampling points in a convex body , 1998, Random Struct. Algorithms.

[32]  R. L. Tweedie,et al.  Rates of convergence of stochastically monotone and continuous time Markov models , 2000 .