
TL;DR
This paper develops sharper concentration inequalities for sums of independent sub-Weibull variables, improving bounds and introducing new tools for statistical estimation and random matrix theory under heavy-tailed conditions.
Contribution
It introduces sharper, constants-specified concentration bounds for sub-Weibull sums, a new sub-Weibull parameter, and applies these results to regression, random matrices, and robust estimation.
Findings
Sharper concentration inequalities with improved constants.
New sub-Weibull parameter enabling tight bounds.
Application to negative binomial regression and random matrix theory.
Abstract
Constant-specified and exponential concentration inequalities play an essential role in the finite-sample theory of machine learning and high-dimensional statistics area. We obtain sharper and constants-specified concentration inequalities for the sum of independent sub-Weibull random variables, which leads to a mixture of two tails: sub-Gaussian for small deviations and sub-Weibull for large deviations from the mean. These bounds are new and improve existing bounds with sharper constants. In addition, a new sub-Weibull parameter if the italic should be retained. Please check the whole text. is also proposed, which enables recovering the tight concentration inequality for a random variable (vector). For statistical applications, we give an -error of estimated coefficients in negative binomial regressions when the heavy-tailed covariates are sub-Weibull distributed with sparse…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
