Related papers: Exponential approximation and Stein's method of ex…
We develop a functional Stein-Malliavin method in a non-diffusive Poissonian setting, thus obtaining a) quantitative central limit theorems for approximation of arbitrary non-degenerate Gaussian random elements taking values in a separable…
Here we introduce a generalization of the exponential sampling series of optical physics and establish pointwise and uniform convergence theorem, also in a quantitative form. Moreover we compare the error of approximation for Mellin…
In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of…
A Cram\'er-type moderate deviation theorem quantifies the relative error of the tail probability approximation. It provides theoretical justification when the limiting tail probability can be used to estimate the tail probability under…
In a recent paper by Kamrani et al. (2024), exponential Euler method for stiff stochastic differential equations with additive fractional Brownian noise was discussed, and the convergence order close to the Hurst parameter H was proved.…
For a family of linear preferential attachment graphs, we provide rates of convergence for the total variation distance between the degree of a randomly chosen vertex and an appropriate power law distribution as the number of vertices tends…
We present efficient approximation of the error function obtained by Fourier expansion of the exponential function $\exp [{- {(t - 2 \sigma)^2}/4}]$. The error analysis reveals that it is highly accurate and can generate numbers that match…
We analyze the behavior of stochastic approximation algorithms where iterates, in expectation, progress towards an objective at each step. When progress is proportional to the step size of the algorithm, we prove exponential concentration…
The Expectation Maximisation (EM) algorithm is widely used to optimise non-convex likelihood functions with latent variables. Many authors modified its simple design to fit more specific situations. For instance, the Expectation (E) step…
The critical exponents and the critical amplitude ratio of the scalar model are determined using finite-temperature field theory with auxiliary mass. A new numerical method is developed to solve an evolution equation. The results are…
We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…
The purpose of this paper is to discuss the existence of a nontrivial tradeoff relation for estimating two unitary-shift parameters in a relativistic spin-1/2 system. It is shown that any moving observer cannot estimate two parameters…
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter $\alpha>1$, and the goal is to design an $\alpha$-approximation algorithm with the…
We propose an explicit recursive method to approximate a power-law with a finite sum of weighted exponentials. Applications to moving averages with long memory are discussed in relationship with stochastic volatility models.
We improve the error term in the van der Corput transform for exponential sums \sum_{a \le n \le b} g(n) exp(2\pi i f(n)). For many functions g and f, we can extract the next term in the asymptotic, showing that previous results, such as…
Exchangeability is a central notion in statistics and probability theory. The assumption that an infinite sequence of data points is exchangeable is at the core of Bayesian statistics. However, finite exchangeability as a statistical…
Using Stein's method, we prove an abstract result that yields multivariate central limit theorems with a rate of convergence for time-dependent dynamical systems. As examples we study a model of expanding circle maps and a quasistatic…
We provide a Lyapunov type bound in the multivariate central limit theorem for sums of independent, but not necessarily identically distributed random vectors. The error in the normal approximation is estimated for certain classes of sets,…
We apply the Stein-Chen method to problems from extreme value theory. On the one hand, the Stein-Chen method for Poisson approximation allows us to obtain bounds on the Kolmogorov distance between the law of the maximum of i.i.d. random…
Pattern learning in an important problem in Natural Language Processing (NLP). Some exhaustive pattern learning (EPL) methods (Bod, 1992) were proved to be flawed (Johnson, 2002), while similar algorithms (Och and Ney, 2004) showed great…