Related papers: A Concentration Bound for Stochastic Approximation…

In this paper, we obtain the Berry-Esseen bound for multivariate normal approximation for the Polyak-Ruppert averaged iterates of the linear stochastic approximation (LSA) algorithm with decreasing step size. Moreover, we prove the…

This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…

We design an algorithm which finds an $\epsilon$-approximate stationary point (with $\|\nabla F(x)\|\le \epsilon$) using $O(\epsilon^{-3})$ stochastic gradient and Hessian-vector products, matching guarantees that were previously available…

We study pathwise approximation of scalar stochastic differential equations at a single time point or globally in time by means of methods that are based on finitely many observations of the driving Brownian motion. We prove lower error…

In the present paper we obtain a new correlation inequality and use it for the purpose of extending the theory of the Almost Sure Local Limit Theorem to the case of lattice random sequences in the domain of attraction of a stable law. In…

This article establishes sufficient conditions for a linear-in-time bound on the non-asymptotic variance of particle approximations of time-homogeneous Feynman-Kac formulae. These formulae appear in a wide variety of applications including…

Via operator theoretic methods, we formalize the concentration phenomenon for a given observable `$r$' of a discrete time Markov chain with `$\mu_{\pi}$' as invariant ergodic measure, possibly having support on an unbounded state space. The…

We derive novel concentration inequalities that bound the statistical error for a large class of stochastic optimization problems, focusing on the case of unbounded objective functions. Our derivations utilize the following key tools: 1) A…

Non-asymptotic bounds for Gaussian and bootstrap approximation have recently attracted significant interest in high-dimensional statistics. This paper studies Berry-Esseen bounds for such approximations with respect to the multivariate…

The steady-state approximation (hereafter abbreviated as SSA) consists in setting $dy/dt=0$, where $y$ denotes the concentration of a short-lived intermediate subject to first-order decay with a rate constant $k$. The sole reason for…

We prove the existence and uniqueness of solution of the obstacle problem for quasilinear Stochastic PDEs with non-homogeneous second order operator. Our method is based on analytical technics coming from the parabolic potential theory. The…

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted)…

We are interested in the long-time behaviour of the kinetic Vicsek equation, rigorously derived as the mean-field limit~\cite{bolley2012meanfield} of a coupled system of~$N$ stochastic differential equations describing particles moving at…

This paper considers the penalized least squares estimator with arbitrary convex penalty. When the observation noise is Gaussian, we show that the prediction error is a subgaussian random variable concentrated around its median. We apply…

This paper studies the performative prediction problem which optimizes a stochastic loss function with data distribution that depends on the decision variable. We consider a setting where the agent(s) provides samples adapted to the…

Logarithmic Sobolev inequalities are a powerful way to estimate the rate of convergence of Markov chains and to derive concentration inequalities on distributions. We prove that the log-Sobolev constant of any isotropic logconcave density…

We consider Nonlinear Schrodinger type equations on $S^1$. In this paper, we obtain polynomial bounds on the growth in time of high Sobolev norms of their solutions. The key is to derive an iteration bound based on a frequency decomposition…

We extend traditional complexity analyses of trust-region methods for unconstrained, possibly nonconvex, optimization. Whereas most complexity analyses assume uniform boundedness of the model Hessians, we work with potentially unbounded…

In this paper, we aim to study the asymptotic behaviour for a class of McKean-Vlasov stochastic partial differential equations with slow and fast time-scales. Using the variational approach and classical Khasminskii time discretization, we…

Let $Q$ be a transition probability on a measurable space $E$, let $(X\_n)\_n$ be a Markov chain associated to $Q$, and let $\xi$ be a real-valued measurable function on $E$, and $S\_n = \sum\_{k=1}^{n} \xi(X\_k)$. Under functional…