Tight Non-asymptotic Inference via Sub-Gaussian Intrinsic Moment Norm

Huiming Zhang, Haoyu Wei, Guang Cheng
3/13/2023
stat.MLcs.LGecon.EM

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhang2023tight,
  title  = {Tight Non-asymptotic Inference via Sub-Gaussian Intrinsic Moment Norm},
  author = {Huiming Zhang and Haoyu Wei and Guang Cheng},
  year   = {2023},
  eprint = {2303.07287},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.07287v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.07287.svg)](https://codeofpaper.com/paper/2303.07287)

Discussion