English
Related papers

Related papers: The sharp one-dimensional convex sub-Gaussian comp…

200 papers

Let $Z$ be an $n$-dimensional Gaussian vector and let $f: \mathbb R^n \to \mathbb R$ be a convex function. We show that: $$\mathbb P \left( f(Z) \leq \mathbb E f(Z) -t\sqrt{ {\rm Var} f(Z)} \right) \leq \exp(-ct^2),$$ for all $t>1$, where…

Probability · Mathematics 2017-06-19 Grigoris Paouris , Petros Valettas

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 show that for some constant $\kappa>0$, any centered $\kappa$-subgaussian random variable is equal to the sum of three standard Gaussian random variables, confirming a conjecture of M. Talagrand. We also prove that given $\Lambda\geq 1$,…

Probability · Mathematics 2026-02-27 Antoine Song

We derive sharp upper and lower bounds for the pointwise concentration function of the maximum statistic of $d$ identically distributed real-valued random variables. Our first main result places no restrictions either on the common marginal…

Statistics Theory · Mathematics 2025-08-04 Matias D. Cattaneo , Ricardo P. Masini , William G. Underwood

Let $X$ be a $d\times d$ symmetric random matrix with independent but non-identically distributed Gaussian entries. It has been conjectured by Lata\l{a} that the spectral norm of $X$ is always of the same order as the largest Euclidean norm…

Probability · Mathematics 2018-06-22 Ramon van Handel

It is well known that the ratio of two independent standard Gaussian random variables follows a Cauchy distribution. Any convex combination of independent standard Cauchy random variables also follows a Cauchy distribution. In a recent…

Statistics Theory · Mathematics 2016-03-04 Natesh S. Pillai

This paper establishes the optimal sub-Gaussian variance proxy for truncated Gaussian and truncated exponential random variables. The proofs rely on first characterizing the optimal variance proxy as the unique solution to a set of two…

Statistics Theory · Mathematics 2024-11-27 Mathias Barreto , Olivier Marchal , Julyan Arbel

We take an $L_1$-dense class of functions $\Cal F$ on a measurable space $(X,\Cal X)$ and a sequence of i.i.d. $X$-valued random variables $\xi_1,\dots,\xi_n$, and give a good estimate on the tail behaviour of $\sup\limits_{f\in\Cal…

Probability · Mathematics 2014-07-07 Peter Major

In recent years, stochastic dominance for independent and identically distributed (iid) infinite-mean random variables has received considerable attention. The literature has identified several classes of distributions of nonnegative random…

Probability · Mathematics 2026-04-28 Keyi Zeng , Zhenfeng Zou , Yuting Su , Taizhong Hu

Sparse estimation for Gaussian graphical models is a crucial technique for making the relationships among numerous observed variables more interpretable and quantifiable. Various methods have been proposed, including graphical lasso, which…

Machine Learning · Computer Science 2024-08-09 Tomokaze Shiratori , Yuichi Takano

The results of a series of theoretical studies are reported, examining the convergence rate for different approximate representations of $\alpha$-stable distributions. Although they play a key role in modelling random processes with jumps…

Probability · Mathematics 2020-01-03 Marina Riabiz , Tohid Ardeshiri , Ioannis Kontoyiannis , Simon Godsill

This paper delves into the stability of the $2$-domination number in simple undirected graphs. The $2$-domination number of a graph $G$, $\gamma_2(G)$, represents the minimum size of a vertex subset where every other vertex in the graph is…

Combinatorics · Mathematics 2025-07-25 Mazharuddin Mehraban , Saeid Alikhani

We derive in this short report the exact exponential decreasing tail of distribution for naturel normed sums of independent centered random variables (r.v.), applying the theory of Grand Lebesgue Spaces (GLS). We consider also some…

Probability · Mathematics 2024-09-10 M. R. Formica , E. Ostrovsky , L. Sirota

We investigate graph problems in the following setting: we are given a graph $G$ and we are required to solve a problem on $G^2$. While we focus mostly on exploring this theme in the distributed CONGEST model, we show new results and…

Data Structures and Algorithms · Computer Science 2020-06-09 Reuven Bar-Yehuda , Keren Censor-Hillel , Yannic Maus , Shreyas Pai , Sriram V. Pemmaraju

This paper focuses on finding approximate solutions to stochastic optimal control problems with control domains being not necessarily convex, where the state trajectory is subject to controlled stochastic differential equations. The…

Optimization and Control · Mathematics 2025-07-15 Shaolin Ji , Rundong Xu

We consider the optimization of a smooth and strongly convex objective using constant step-size stochastic gradient descent (SGD) and study its properties through the prism of Markov chains. We show that, for unbiased gradient estimates…

Machine Learning · Statistics 2025-11-25 Ibrahim Merad , Stéphane Gaïffas

This paper studies the Gaussian approximation of high-dimensional and non-degenerate U-statistics of order two under the supremum norm. We propose a two-step Gaussian approximation procedure that does not impose structural assumptions on…

Statistics Theory · Mathematics 2016-10-04 Xiaohui Chen

Let $X$ be a centered random vector in a finite dimensional real inner product space $\mathcal{E}$. For a subset $C$ of the ambient vector space $V$ of $\mathcal{E}$ and $x,\,y\in V$, write $x\preceq_C y$ if $y-x\in C$. When $C$ is a closed…

Probability · Mathematics 2023-07-10 Nicola Apollonio

Since the celebrated works of Russo and Zou (2016,2019) and Xu and Raginsky (2017), it has been well known that the generalization error of supervised learning algorithms can be bounded in terms of the mutual information between their input…

Machine Learning · Statistics 2022-07-20 Gábor Lugosi , Gergely Neu

Given n (discrete or continuous) random variables X_i, the (2^n-1)-dimensional vector obtained by evaluating the joint entropy of all non-empty subsets of {X_1,...,X_n} is called an entropic vector. Determining the region of entropic…

Information Theory · Computer Science 2011-12-02 Sormeh Shadbakht , Babak Hassibi