Related papers: Fast rates for empirical vector quantization

In N.V. Krylov, Approximating value functions for controlled degenerate diffusion processes by using piece-wise constant policies, Electron. J. Probab., 4(2), 1999, it is proved under standard assumptions that the value functions of…

Estimating the unknown density from which a given independent sample originates is more difficult than estimating the mean, in the sense that for the best popular non-parametric density estimators, the mean integrated square error converges…

We consider a statistical inverse learning problem, where we observe the image of a function $f$ through a linear operator $A$ at i.i.d. random design points $X_i$, superposed with an additive noise. The distribution of the design points is…

The Lasso is one of the most important approaches for parameter estimation and variable selection in high dimensional linear regression. At the heart of its success is the attractive rate of convergence result even when $p$, the dimension…

We study the rates of convergence of the posterior distribution for Bayesian density estimation with Dirichlet mixtures of normal distributions as the prior. The true density is assumed to be twice continuously differentiable. The bandwidth…

System identification is a fundamental problem in control and learning, particularly in high-stakes applications where data efficiency is critical. Classical approaches, such as the ordinary least squares estimator (OLS), achieve an…

We study the optimal rates of convergence for estimating a prior distribution over a VC class from a sequence of independent data sets respectively labeled by independent target functions sampled from the prior. We specifically derive upper…

Multi-layer feedforward networks have been used to approximate a wide range of nonlinear functions. An important and fundamental problem is to understand the learnability of a network model through its statistical risk, or the expected…

This paper deals with empirical processes of the type \[C_n(B)=\sqrt{n}\{\mu_n(B)-P(X_{n+1}\in B\mid X_1,...,X_n)\},\] where $(X_n)$ is a sequence of random variables and $\mu_n=(1/n)\sum_{i=1}^n\delta_{X_i}$ the empirical measure.…

We study the probabilistic zero forcing process, a probabilistic variant of the classical zero forcing process. We show that for every connected graph $G$ on $n$ vertices, there exists an initial set consisting of a single vertex such that…

We deal with the problem of the mean square optimal estimation of linear transformations of the unobserved values of a continuous time stochastic process with periodically correlated increments. Estimates are based on observations of the…

Part I of this work [2] developed the exact diffusion algorithm to remove the bias that is characteristic of distributed solutions for deterministic optimization problems. The algorithm was shown to be applicable to a larger set of…

We approximate the uniform measure on an equilateral triangle by a measure supported on $n$ points. We find the optimal sets of points ($n$-means) and corresponding approximation (quantization) error for $n\leq4$, give numerical…

Let $(X,Y)\in\mathcal{X}\times \mathcal{Y}$ be a random couple with unknown distribution $P$. Let $\GG$ be a class of measurable functions and $\ell$ a loss function. The problem of statistical learning deals with the estimation of the…

For a skew normal random sequence, convergence rates of the distribution of its partial maximum to the Gumbel extreme value distribution are derived. The asymptotic expansion of the distribution of the normalized maximum is given under an…

In this paper, first we have defined a uniform distribution on the boundary of a regular hexagon, and then investigated the optimal sets of $n$-means and the $n$th quantization errors for all positive integers $n$. We give an exact formula…

In the present paper, we prove that under the assumption of the finite sixth moment for elements of a Wigner matrix, the convergence rate of its empirical spectral distribution to the Wigner semicircular law in probability is $O(n^{-1/2})$…

In this paper we provide an $O(m (\log \log n)^{O(1)} \log(1/\epsilon))$-expected time algorithm for solving Laplacian systems on $n$-node $m$-edge graphs, improving improving upon the previous best expected runtime of $O(m \sqrt{\log n}…

We are interested in the kernel of one-dimensional diffusion equations with continuous coefficients as evaluated by means of explicit discretization schemes of uniform step $h>0$ in the limit as $h\to0$. We consider both semidiscrete…

We employ stabilization methods and second order Poincar\'e inequalities to establish rates of multivariate normal convergence for a large class of vectors $(H_s^{(1)},...,H_s^{(m)})$, $s \geq 1$, of statistics of marked Poisson processes…