English
Related papers

Related papers: Moderate Deviations for Functionals over infinitel…

200 papers

A new Berry-Esseen bound for non-linear functionals of non-symmetric and non-homogeneous infinite Rademacher sequences is established. It is based on a discrete version of the Malliavin-Stein method and an analysis of the discrete…

Probability · Mathematics 2015-11-13 Kai Krokowski , Anselm Reichenbachs , Christoph Thaele

The work of Gantert, Kim, and Ramanan [Large deviations for random projections of $\ell^p$ balls, Ann. Probab. 45 (6B), 2017] has initiated and inspired a new direction of research in the asymptotic theory of geometric functional analysis.…

Functional Analysis · Mathematics 2024-03-08 Joscha Prochno

We present a series of new and more favorable margin-based learning guarantees that depend on the empirical margin loss of a predictor. We give two types of learning bounds, both distribution-dependent and valid for general families, in…

Machine Learning · Computer Science 2020-10-30 Corinna Cortes , Mehryar Mohri , Ananda Theertha Suresh

We show that various functionals related to the supremum of a real function defined on an arbitrary set or a measure space are Hadamard directionally differentiable. We specifically consider the supremum norm, the supremum, the infimum, and…

Statistics Theory · Mathematics 2019-12-18 Javier Cárcamo , Luis-Alberto Rodríguez , Antonio Cuevas

We establish explicit bounds on the convex distance between the distribution of a vector of smooth functionals of a Gaussian field, and that of a normal vector with a positive definite covariance matrix. Our bounds are commensurate to the…

Probability · Mathematics 2021-02-26 Ivan Nourdin , Giovanni Peccati , Xiaochuan Yang

Finite sample bounds on the estimation error of the mean by the empirical mean, uniform over a class of functions, can often be conveniently obtained in terms of Rademacher or Gaussian averages of the class. If a function of n variables has…

Probability · Mathematics 2015-03-10 Andreas Maurer

We combine Malliavin calculus with Stein's method to derive bounds for the Variance-Gamma approximation of functionals of isonormal Gaussian processes, in particular of random variables living inside a fixed Wiener chaos induced by such a…

Probability · Mathematics 2014-09-22 Peter Eichelsbacher , Christoph Thäle

We derive normal approximation bounds for generalized $U$-statistics of the form \begin{equation*} S_{n,k}(f):=\sum_{ 1 \leq \beta (1),\dots,\beta (k) \leq n \atop \beta (i)\ne\beta (j), \ 1\leq i\ne j \leq k} f\big(X_{\beta…

Probability · Mathematics 2025-11-12 Qingwei Liu , Nicolas Privault

We use a new method via $p$-Wasserstein bounds to prove Cram\'er-type moderate deviations in (multivariate) normal approximations. In the classical setting that $W$ is a standardized sum of $n$ independent and identically distributed…

Probability · Mathematics 2022-05-27 Xiao Fang , Yuta Koike

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

Probability · Mathematics 2019-09-25 Ioana Dumitriu , Tobias Johnson , Soumik Pal , Elliot Paquette

The random field Curie-Weiss model is derived from the classical Curie-Weiss model by replacing the deterministic global magnetic field by random local magnetic fields. This opens up a new and interestingly rich phase structure. In this…

Probability · Mathematics 2013-04-18 Matthias Löwe , Raphael Meiners

The term moderate deviations is often used in the literature to mean a class of large deviation principles that, in some sense, fills the gap between a convergence in probability of some random variables to a constant and a weak convergence…

Probability · Mathematics 2024-11-20 Rita Giuliano , Claudio Macci , Barbara Pacchiarotti

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

Number Theory · Mathematics 2011-02-03 Sourav Chatterjee , Kannan Soundararajan

We introduce an adaptation of integral approximation operators to set-valued functions (SVFs, multifunctions), mapping a compact interval $[a,b]$ into the space of compact non-empty subsets of ${\mathbb R}^d$. All operators are adapted by…

Classical Analysis and ODEs · Mathematics 2022-12-02 Elena E. Berdysheva , Nira Dyn , Elza Farkhi , Alona Mokhov

We give estimates of the distance between the densities of the laws of two functionals $F$ and $G$ on the Wiener space in terms of the Malliavin-Sobolev norm of $F-G.$ We actually consider a more general framework which allows one to treat…

Probability · Mathematics 2016-04-07 Vlad Bally , Lucia Caramellino

We establish a normal approximation for the limiting distribution of partial sums of random Rademacher multiplicative functions over function fields, provided the number of irreducible factors of the polynomials is small enough. This…

Number Theory · Mathematics 2022-07-26 Daksh Aggarwal , Unique Subedi , William Verreault , Asif Zaman , Chenghui Zheng

The generalized perturbative approach is an all purpose variant of Stein's method used to obtain rates of normal approximation. Originally developed for functions of independent random variables this method is here extended to functions of…

Probability · Mathematics 2020-10-12 Christian Houdré , George Kerchev

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…

Probability · Mathematics 2021-04-28 Qi-Man Shao , Mengchen Zhang , Zhuo-Song Zhang

We investigate Stein-Malliavin approximations for nonlinear functionals of geometric interest of Gaussian random eigenfunctions on the unit $d$ -dimensional sphere ${\mathbb{S}}^{d},$ $d\geq 2.$ All our results are established in the high…

Probability · Mathematics 2015-04-29 Domenico Marinucci , Maurizia Rossi

We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In addition…

Data Structures and Algorithms · Computer Science 2018-05-22 Liat Cohen , Dror Fried , Gera Weiss