Related papers: Finite-Sample Bounds for Expected Signature Estima…
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to…
We derive an invariance principle for the lift to the rough path topology of stochastic processes with delayed regenerative increments under an optimal moment condition. An interesting feature of the result is the emergence of area anomaly,…
Many machine learning and optimization algorithms are built upon the framework of stochastic approximation (SA), for which the selection of step-size (or learning rate) $\{\alpha_n\}$ is crucial for success. An essential condition for…
In this paper, we study non-asymptotic deviation bounds of the least squares estimator in Gaussian AR($n$) processes. By relying on martingale concentration inequalities and a tail-bound for $\chi^2$ distributed variables, we provide a…
This paper addresses the problem of estimating drift parameter of the Ornstein - Uhlenbeck type process, driven by the sum of independent standard and fractional Brownian motions. The maximum likelihood estimator is shown to be consistent…
We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed…
Mixing in open quantum systems is often summarized by a single worst-case time, even though that benchmark can be set by exponentially rare initial states. We show that for broad unstructured ensembles the nonlinear trace-distance…
The fractional Brownian motion (fBm) is parameterized by the Hurst exponent $H\in(0,1)$, which determines the dependence structure and regularity of sample paths. Empirical findings suggest that the Hurst exponent may be non-constant in…
It is known that state-dependent, multi-step Lyapunov bounds lead to greatly simplified verification theorems for stability for large classes of Markov chain models. This is one component of the "fluid model" approach to stability of…
The theory of rough paths arose from a desire to establish continuity properties of ordinary differential equations involving terms of low regularity. While essentially an analytic theory, its main motivation and applications are in…
We derive a finite-sample probabilistic bound on the parameter estimation error of a system identification algorithm for Linear Switched Systems. The algorithm estimates Markov parameters from a single trajectory and applies a variant of…
This paper establishes the averaging method to a coupled system consisting of two stochastic differential equations which has a slow component driven by fractional Brownian motion (FBM) with less regularity $1/3< H \leq 1/2$ and a fast…
We focus on analyzing the classical stochastic projected gradient methods under a general dependent data sampling scheme for constrained smooth nonconvex optimization. We show the worst-case rate of convergence $\tilde{O}(t^{-1/4})$ and…
Assuming that a threshold Ornstein-Uhlenbeck process is observed at discrete time instants, we propose generalized moment estimators to estimate the parameters. Our theoretical basis is the celebrated ergodic theorem. To use this theorem we…
Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…
For $(X_t)$ a two-sided $\alpha$-stable moving average, this paper studies the conditional distribution of future paths given a piece of observed trajectory when the process is far from its central values. Under this framework, vectors of…
We consider deterministic homogenization (convergence to a stochastic differential equation) for multiscale systems of the form \[ x_{k+1} = x_k + n^{-1} a_n(x_k,y_k) + n^{-1/2} b_n(x_k,y_k), \quad y_{k+1} = T_n y_k, \] where the fast…
Optimal sample path properties of stochastic processes often involve generalized H\"{o}lder- or variation norms. Following a classical result of Taylor, the exact variation of Brownian motion is measured in terms of $\psi (x) \equiv $…
We consider the problem of asymptotically efficient estimation of drift parameters of the ergodic fractional Ornstein-Uhlenbeck process under continuous observations when the Hurst parameter $H<1/2$ and the mean of its stationary…
Single Source Shortest Paths ($\textrm{SSSP}$) is among the most well-studied problems in computer science. In the incremental (resp. decremental) setting, the goal is to maintain distances from a fixed source in a graph undergoing edge…