English
Related papers

Related papers: A Maximal Large Deviation Inequality for Sub-Gauss…

200 papers

Let $n\geq 1$, $K>0$, and let $X=(X_1,X_2,\dots,X_n)$ be a random vector in $\mathbb{R}^n$ with independent $K$--subgaussian components. We show that for every $1$--Lipschitz convex function $f$ in $\mathbb{R}^n$ (the Lipschitzness with…

Probability · Mathematics 2023-05-02 Han Huang , Konstantin Tikhomirov

We derive a Gaussian approximation result for the maximum of a sum of random vectors under $(2+\iota)$-th moments. Our main theorem is abstract and nonasymptotic, and can be applied to a variety of statistical learning problems. The proof…

Statistics Theory · Mathematics 2019-05-28 Qiang Sun

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

Probability · Mathematics 2018-12-12 Pieter C. Allaart , Jose A. Islas

The principal results of this contribution are the weak and strong limits of maxima of contracted stationary Gaussian random sequences. Due to the random contraction we introduce a modified Berman condition which is sufficient for the weak…

Probability · Mathematics 2013-12-10 Enkelejd Hashorva , Zhichao Weng

The authors consider the problem of estimating the density $g$ of independent and identically distributed variables $X\_i$, from a sample $Z\_1, ..., Z\_n$ where $Z\_i=X\_i+\sigma\epsilon\_i$, $i=1, ..., n$, $\epsilon$ is a noise…

Statistics Theory · Mathematics 2008-02-11 Fabienne Comte , Yves Rozenholc , Marie-Luce Taupin

We present an estimator of the covariance matrix $\Sigma$ of random $d$-dimensional vector from an i.i.d. sample of size $n$. Our sole assumption is that this vector satisfies a bounded $L^p-L^2$ moment assumption over its one-dimensional…

Statistics Theory · Mathematics 2024-03-27 Roberto I. Oliveira , Zoraida F. Rico

We obtain an optimal bound for a Gaussian approximation of a large class of vector-valued random processes. Our results provide a substantial generalization of earlier results that assume independence and/or stationarity. Based on the decay…

Statistics Theory · Mathematics 2020-01-29 Sayar Karmakar , Wei Biao Wu

Consider the Gaussian sequence model under the additional assumption that a fixed fraction of the means is known. We study the problem of variance estimation from a frequentist Bayesian perspective. The maximum likelihood estimator (MLE)…

Statistics Theory · Mathematics 2019-12-19 Gianluca Finocchio , Johannes Schmidt-Hieber

Graphical models with bi-directed edges (<->) represent marginal independence: the absence of an edge between two vertices indicates that the corresponding variables are marginally independent. In this paper, we consider maximum likelihood…

Methodology · Statistics 2012-12-12 Mathias Drton , Thomas S. Richardson

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Probability · Mathematics 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

It is well known that, under standard regularity conditions, the maximum likelihood estimator (MLE) satisfies a central limit theorem and converges in distribution to a Gaussian random variable as the sample size grows. This paper…

Information Theory · Computer Science 2026-05-26 Leighton P. Barnes , Alex Dytso

Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\{0,1\}$-matrix, and many others) reduce to creating random…

Computation · Statistics 2017-06-30 Mark Huber

Given a set of independent Poisson random variables with common mean, we study the distribution of their maximum and obtain an accurate asymptotic formula to locate the most probable value of the maximum. We verify our analytic results with…

Probability · Mathematics 2009-03-26 K. M. Briggs , L. Song , T. Prellberg

We show several variants of concentration inequalities on the sphere stated as subgaussian estimates with optimal constants. For a Lipschitz function, we give one-sided and two-sided bounds for deviation from the median as well as from the…

Probability · Mathematics 2026-04-02 Guillaume Aubrun , Justin Jenkinson , Stanislaw J. Szarek

We obtain a Bernstein type Gaussian concentration inequality for martingales. Our inequality improves the Azuma-Hoeffding inequality for moderate deviations $x$. Following the work of McDiarmid (1989), Talagrand (1996) and Boucheron, Lugosi…

Probability · Mathematics 2017-10-17 Xiequan Fan

We design efficient approximation algorithms for maximizing the expectation of the supremum of families of Gaussian random variables. In particular, let $\mathrm{OPT}:=\max_{\sigma_1,\cdots,\sigma_n}\mathbb{E}\left[\sum_{j=1}^{m}\max_{i\in…

Machine Learning · Computer Science 2025-02-26 Renato Purita Paes Leme , Cliff Stein , Yifeng Teng , Pratik Worah

We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…

Statistical Mechanics · Physics 2009-11-11 David S. Dean , Satya N. Majumdar

This paper provides a precise error analysis for the maximum likelihood estimate $\hat{a}_{\text{ML}}(u_1^n)$ of the parameter $a$ given samples $u_1^n = (u_1, \ldots, u_n)'$ drawn from a nonstationary Gauss-Markov process $U_i = a U_{i-1}…

Information Theory · Computer Science 2021-03-29 Peida Tian , Victoria Kostina

We derive a Gaussian approximation result for the maximum of a sum of high-dimensional random vectors. Specifically, we establish conditions under which the distribution of the maximum is approximated by that of the maximum of a sum of the…

Statistics Theory · Mathematics 2018-01-24 Victor Chernozhukov , Denis Chetverikov , Kengo Kato

Let $X$ be a random variable and define its concentration function by $$\mathcal{Q}_{h}(X)=\sup_{x\in \mathbb{R}}\mathbb{P}(X\in (x,x+h]).$$ For a sum $S_n=X_1+\cdots+X_n$ of independent real-valued random variables the Kolmogorov-Rogozin…

Probability · Mathematics 2022-01-25 Tomas Juškevičius