Tight Non-asymptotic Inference via Sub-Gaussian Intrinsic Moment Norm
Not on the map. Why?
Abstract (arXiv)
In non-asymptotic learning, variance-type parameters of sub-Gaussian distributions are of paramount importance. However, directly estimating these parameters using the empirical moment generating function (MGF) is infeasible. To address this, we suggest using the sub-Gaussian intrinsic moment norm [Buldygin and Kozachenko (2000), Theorem 1.3] achieved by maximizing a sequence of normalized moments. Significantly, the suggested norm can not only reconstruct the exponential moment bounds of MGFs but also provide tighter sub-Gaussian concentration inequalities. In practice, we provide an intuitive method for assessing whether data with a finite sample size is sub-Gaussian, utilizing the sub-Gaussian plot. The intrinsic moment norm can be robustly estimated via a simple plug-in approach. Our theoretical findings are also applicable to reinforcement learning, including the multi-armed bandit scenario.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 54 references that are in the map. First posted on arXiv 13 Mar 2023.
Builds on
15 of 54 references.
References · 15
- 2013Loss minimization and parameter estimation with heavy tailscited by 50
- 2019Robust subgaussian estimation of a mean vector in nearly linear timecited by 37
- 2019Bootstrapping Upper Confidence Boundcited by 36
- 2021Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Banditscited by 25
- 2020Concentration Inequalities for Statistical Inferencecited by 24
- 2013Concentration in unbounded metric spaces and algorithmic stabilitycited by 21
- 2018On the Non-asymptotic and Sharp Lower Tail Bounds of Random Variablescited by 19
- 2020Two-sample Test using Projected Wasserstein Distancecited by 17
- 2013Large Deviation Methods for Approximate Probabilistic Inferencecited by 12
- 2017Finite-Sample Optimal Estimation and Inference on Average Treatment Effects Under Unconfoundednesscited by 11
- 2021Non-asymptotic Confidence Intervals of Off-policy Evaluation: Primal and Dual Boundscited by 11
- 2021Sharper Sub-Weibull Concentrationscited by 8
3 more
- 2021Exact Statistical Inference for the Wasserstein Distance by Selective Inferencecited by 7
- 2022Residual Bootstrap Exploration for Stochastic Linear Banditcited by 7
- 2019Inference in a class of optimization problems: Confidence regions and finite sample bounds on errors in coverage probabilitiescited by 1
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Zero-Inflated Banditscited by 0
- 2023Zero-Inflated Bandits25 Dec 2023