Guardado en:
Detalles Bibliográficos
Autores principales: Zhang, Huiming, Wei, Haoyu, Cheng, Guang
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:https://arxiv.org/abs/2303.07287
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866918384841523200
author Zhang, Huiming
Wei, Haoyu
Cheng, Guang
author_facet Zhang, Huiming
Wei, Haoyu
Cheng, Guang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2303_07287
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Tight Non-asymptotic Inference via Sub-Gaussian Intrinsic Moment Norm
Zhang, Huiming
Wei, Haoyu
Cheng, Guang
Machine Learning
Econometrics
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.
title Tight Non-asymptotic Inference via Sub-Gaussian Intrinsic Moment Norm
topic Machine Learning
Econometrics
url https://arxiv.org/abs/2303.07287