Related papers: Convergence bound in total variation for an image …
Recurrent temporal dynamics is a phenomenon observed frequently in high-dimensional complex systems and its detection is a challenging task. Recurrence quantification analysis utilizing recurrence plots may extract such dynamics, however it…
Mostof the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample. However, many practical problems are characterized by temporal dependence and strong…
In this paper, we use Stein's method to obtain optimal bounds, both in Kolmogorov and in Wasserstein distance, in the normal approximation for the empirical distribution of the ground state of a many-interacting-worlds harmonic oscillator…
We study the long time asymptotics of a nonlinear, nonlocal equation used in the modelling of granular media. We prove a uniform exponential convergence to equilibrium for degenerately convex and non convex interaction or confinement…
In this paper, we consider the mean field optimal switching problem with a Markov chain under viscosity solution notion. Based on the conditional distribution of the Markov chain, the value function and corresponding dynamic programming…
The purpose of this paper is to analyze the distribution distance between random vectors derived from the magnitude of the analytic wavelet transform of the squared envelopes of Gaussian processes and their large-scale limits. When the…
In this paper, we show that the Gibbs measure of the stochastic hyperbolic sine-Gordon equation on the circle is the unique invariant measure for the Markov process. Moreover, the Markov transition probabilities converge exponentially fast…
In the field of Markov models for image generation, the main idea is to learn how non-trivial images are gradually destroyed by a trivial forward Markov dynamics over the large time window $[0,t]$ converging towards pure noise for $t \to +…
This paper derives non-asymptotic error bounds for nonlinear stochastic approximation algorithms in the Wasserstein-$p$ distance. To obtain explicit finite-sample guarantees for the last iterate, we develop a coupling argument that compares…
Using the renewal approach we prove Bernstein-like inequalities for additive functionals of geometrically ergodic Markov chains, thus obtaining counterparts of inequalities for sums of independent random variables. The coefficient in the…
The stochastic growth-fragmentation model describes the temporal evolution of a structured cell population through a discrete-time and continuous-state Markov chain. The simulations of this stochastic process and its invariant measure are…
Gradient information on the sampling distribution can be used to reduce the variance of Monte Carlo estimators via Stein's method. An important application is that of estimating an expectation of a test function along the sample path of a…
Time estimation is a fundamental task that underpins precision measurement, global navigation systems, financial markets, and the organisation of everyday life. Many biological processes also depend on time estimation by nanoscale clocks,…
In this work we develop a new numerical approach for recovering a spatially dependent source component in a standard parabolic equation from partial interior measurements. We establish novel conditional Lipschitz stability and H\"{o}lder…
In this paper, we propose image restoration models using optimal transport (OT) and total variation regularization. We present theoretical results of the proposed models based on the relations between the dual Lipschitz norm from OT and the…
A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting approximation is a four tuple Markov…
We propose a new joint image reconstruction method by recovering edge directly from observed data. More specifically, we reformulate joint image reconstruction with vectorial total-variation regularization as an $l_1$ minimization problem…
We propose a new tamed Milstein-type scheme for stochastic differential equation with Markovian switching when drift coefficient is assumed to grow super-linearly. The strong rate of convergence is shown to be equal to $1.0$ under mild…
In this paper, we establish optimal rates of adaptive estimation of a vector in the multi-reference alignment model, a problem with important applications in fields such as signal processing, image processing, and computer vision, among…
Perturbation theory for Markov chains addresses the question how small differences in the transitions of Markov chains are reflected in differences between their distributions. We prove powerful and flexible bounds on the distance of the…