Related papers: Weak Convergence Methods for Approximation of Path…

We demonstrate the use of a variational method to determine a quantitative lower bound on the rate of convergence of Markov Chain Monte Carlo (MCMC) algorithms as a function of the target density and proposal density. The bound relies on…

This monograph aims at presenting the core weak convergence theory for sequences of random vectors with values in $\mathbb{R}^k$. In some places, a more general formulation in metric spaces is provided. It lays out the necessary foundation…

In the context of finite sums minimization, variance reduction techniques are widely used to improve the performance of state-of-the-art stochastic gradient methods. Their practical impact is clear, as well as their theoretical properties.…

For each $n \geq 1$, let $\{X_{j,n}\}_{1 \leq j \leq n}$ be a sequence of strictly stationary random variables. In this article, we give some asymptotic weak dependence conditions for the convergence in distribution of the point process…

The paper presents efficient approaches for evaluating convergence rate in total variation for finite and general linear Markov chains. The motivation for studying convergence rate in this metric is its usefulness in various limit theorems.…

The ${\alpha}$-quantile of a stochastic process $M_{t,{\alpha}}$ has been introduced in Miura (Hitotsubashi J Commerce Manag 27(1):15-28, 1992), and important distributional results have been derived in Akahori (Ann Appl Probab…

This is a handbook of simple proofs of the convergence of gradient and stochastic gradient descent type methods. We consider functions that are Lipschitz, smooth, convex, strongly convex, and/or Polyak-{\L}ojasiewicz functions. Our focus is…

We propose a novel study of the stochastic proximal gradient method for minimizing the sum of two convex functions, one of which is smooth. Under suitable assumptions and without requiring any boundedness or control of the variance of the…

Let $\big(M_k, Q_k\big)_{k\in\mathbb{N}}$ be independent copies of an $\mathbb{R}^2$-valued random vector. It is known that if $Y_n:=Q_1+M_1Q_2+...+M_1\cdot...\cdot M_{n-1}Q_n$ converges a.s. to a random variable $Y$, then the law of $Y$…

Stochastic variational inference for collapsed models has recently been successfully applied to large scale topic modelling. In this paper, we propose a stochastic collapsed variational inference algorithm for hidden Markov models, in a…

We study the so-called two-time-scale stochastic approximation, a simulation-based approach for finding the roots of two coupled nonlinear operators. Our focus is to characterize its finite-time performance in a Markov setting, which often…

A number of coupling strategies are presented for stochastically modeled biochemical processes with time-dependent parameters. In particular, the stacked coupling is introduced and is shown via a number of examples to provide an…

We study exit times from time-dependent domains under joint perturbations of the trajectory and the domain. Representing a moving domain by a continuous barrier $\Phi$ on space-time, we reduce the exit problem to a one-dimensional…

Existing studies on the degree correlation of evolving networks typically rely on differential equations and statistical analysis, resulting in only approximate solutions due to inherent randomness. To address this limitation, we propose an…

This paper is devoted to the variational inequality problems. We consider two classes of problems, the first is classical constrained variational inequality and the second is the same problem with functional (inequality type) constraints.…

First-order methods are often analyzed via their continuous-time models, where their worst-case convergence properties are usually approached via Lyapunov functions. In this work, we provide a systematic and principled approach to find and…

We introduce a class of stochastic algorithms for minimizing weakly convex functions over proximally smooth sets. As their main building blocks, the algorithms use simplified models of the objective function and the constraint set, along…

We consider the problem of sketching set valuation functions, defined as the expectation of a valuation function applied to independent random item values. For valuation functions that are monotone and either subadditive or submodular, and…

In this paper we analyze the approximation of stable linear time-invariant systems, like the Hilbert transform, by sampling series for bandlimited functions in the Paley-Wiener space $\mathcal{PW}_{\pi}^{1}$. It is known that there exist…

This work develops Monte Carlo Euler adaptive time stepping methods for the weak approximation problem of jump diffusion driven stochastic differential equations. The main result is the derivation of a new expansion for the omputational…