Related papers: Consistency of randomized integration methods
Conformal inference is a fundamental and versatile tool that provides distribution-free guarantees for many machine learning tasks. We consider the transductive setting, where decisions are made on a test sample of $m$ new points, giving…
This work constructs Jonson-Lindenstrauss embeddings with best accuracy, as measured by variance, mean-squared error and exponential concentration of the length distortion. Lower bounds for any data and embedding dimensions are determined,…
We obtain an asymptotic H\"older estimate for expectations of a quite general class of discrete stochastic processes. Such expectations can also be described as solutions to a dynamic programming principle or as solutions to discretized…
We study the convergence of centered and normalized sums of i.i.d. random elements of the space $\mathcal{D}$ of c{{\'a}}dl{{\'a}}g functions endowed with Skorohod's $J\_1$ topology, to stable distributions in $\mathcal D$. Our results are…
In this paper, we present a study of a kernel-based consensual aggregation on randomly projected high-dimensional features of predictions for regression. The aggregation scheme is composed of two steps: the high-dimensional features of…
We discuss the question of the normalization of the correlation function and its consistency with the often used form C(p1,p2) = 1+|f(p1,p2)|^2. We suggest an event mixing method which allows one to obtain absolutely normalized correlation…
The random numbers driving Markov chain Monte Carlo (MCMC) simulation are usually modeled as independent U(0,1) random variables. Tribble [Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences (2007)…
Regularization-based approaches for injecting constraints in Machine Learning (ML) were introduced to improve a predictive model via expert knowledge. We tackle the issue of finding the right balance between the loss (the accuracy of the…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…
We study the asymptotics for jump-penalized least squares regression aiming at approximating a regression function by piecewise constant functions. Besides conventional consistency and convergence rates of the estimates in $L^2([0,1))$ our…
According to the classification scheme of the generalized random matrix ensembles, we present various kinds of concrete examples of the generalized ensemble, and derive their joint density functions in an unified way by one simple formula…
An algorithm is proposed for generalized mean curvature flow of closed two-dimensional surfaces, which include inverse mean curvature flow, powers of mean and inverse mean curvature flow, etc. Error estimates are proven for semi- and full…
In this paper we propose a wide class of truncated stochastic approximation procedures with moving random bounds. While we believe that the proposed class of procedures will find its way to a wider range of applications, the main motivation…
Equation with the symmetric integral with respect to stochastic measure is considered. For the integrator, we assume only $\sigma$-additivity in probability and continuity of the paths. It is proved that the averaging principle holds for…
A succesful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well chosen mean differential equation. Under an attainability condition,…
In this paper, we have established a new framework of truncated inverse sampling for estimating mean values of non-negative random variables such as binomial, Poisson, hyper-geometrical, and bounded variables. We have derived explicit…
We study the approximation of a square-integrable function from a finite number of evaluations on a random set of nodes according to a well-chosen distribution. This is particularly relevant when the function is assumed to belong to a…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
Concentration of measure is a phenomenon in which a random variable that depends in a smooth way on a large number of independent random variables is essentially constant. The random variable will "concentrate" around its median or…
We prove large (and moderate) deviations for a class of linear combinations of spacings generated by i.i.d. exponentially distributed random variables. We allow a wide class of coefficients which can be expressed in terms of continuous…