Related papers: A Local Limit Theorem for Robbins-Monro Procedure
Continuous-time Mallows processes are processes of random permutations of the set $\{1, \ldots, n\}$ whose marginal at time $t$ is the Mallows distribution with parameter $t$. Recently Corsini showed that there exists a unique Markov…
A local algorithm is a distributed algorithm where each node must operate solely based on the information that was available at system startup within a constant-size neighbourhood of the node. We study the applicability of local algorithms…
We present an adaptive method for the automatic scaling of Random-Walk Metropolis-Hastings algorithms, which quickly and robustly identifies the scaling factor that yields a specified overall sampler acceptance probability. Our method…
We prove explicit, i.e., non-asymptotic, error bounds for Markov Chain Monte Carlo methods, such as the Metropolis algorithm. The problem is to compute the expectation (or integral) of f with respect to a measure which can be given by a…
This paper studies a method, which has been proposed in the Physics literature by [8, 7, 10], for estimating the quasi-stationary distribution. In contrast to existing methods in eigenvector estimation, the method eliminates the need for…
In this paper, we are concerned with centered Markov Additive Processes $\{(X_t,Y_t)\}_{t\in\T}$ where the driving Markov process $\{X_t\}_{t\in\T}$ has a finite state space. Under suitable conditions, we provide a local limit theorem for…
In this paper, we consider a continuous-time Markov process and prove a local limit theorem for the integral of a time-inhomogeneous function of the process. One application is in the study of the fast-oscillating perturbations of linear…
The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and…
In this paper, we develop a general approach to proving global and local uniform limit theorems for the Horvitz-Thompson empirical process arising from complex sampling designs. Global theorems such as Glivenko-Cantelli and Donsker…
For a class of degenerate diffusion processes of rank 2, i.e. when only Poisson brackets of order one are needed to span the whole space, we obtain a parametrix representation of the density from which we derive some explicit Gaussian…
A local convergence rate is established for a Gauss orthogonal collocation method applied to optimal control problems with control constraints. If the Hamiltonian possesses a strong convexity property, then the theory yields convergence for…
In this paper, we propose a Robbins-Monro augmented Lagrangian method (RMALM) to solve a class of constrained stochastic convex optimization, which can be regarded as a hybrid of the Robbins-Monro type stochastic approximation method and…
We attempt to answer the question what data brings adaptive diffusion algorithms converging to true parameters. The discussion begins with the diffusion recursive least squares (RLS). When unknown parameters are scalar, the necessary and…
We study a limit behavior of a sequence of Markov processes (or Markov chains) such that their distributions outside of any neighborhood of a "singular" point attract to some probability law. In any neighborhood of this point the behavior…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
We prove a limit theorem for an integral functional of a Markov process. The Markovian dynamics is characterized by a linear Boltzmann equation modeling a one-dimensional test particle of mass $\lambda^{-1}\gg 1$ in an external periodic…
Motivated by the goal of improving the efficiency of small sample design, we propose a novel Bayesian stochastic approximation method to estimate the root of a regression function. The method features adaptive local modelling and…
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a…
Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…
The paper proposes and justifies a new algorithm of the proximal Newton type to solve a broad class of nonsmooth composite convex optimization problems without strong convexity assumptions. Based on advanced notions and techniques of…