A One-Sample Test for Normality with Kernel Methods
J\'er\'emie Kellner (INRIA Lille - Nord Europe), Alain Celisse (INRIA, Lille - Nord Europe)

TL;DR
This paper introduces a kernel-based one-sample normality test in RKHS that is computationally efficient and effective in high-dimensional data, outperforming traditional methods.
Contribution
It presents a novel normality test using kernel methods and a specialized bootstrap, applicable to data and parameter testing, with improved performance in high dimensions.
Findings
Outperforms traditional normality tests in high-dimensional settings
Uses a computationally efficient bootstrap method
Provides bounds on Type-II error based on influential quantities
Abstract
We propose a new one-sample test for normality in a Reproducing Kernel Hilbert Space (RKHS). Namely, we test the null-hypothesis of belonging to a given family of Gaussian distributions. Hence our procedure may be applied either to test data for normality or to test parameters (mean and covariance) if data are assumed Gaussian. Our test is based on the same principle as the MMD (Maximum Mean Discrepancy) which is usually used for two-sample tests such as homogeneity or independence testing. Our method makes use of a special kind of parametric bootstrap (typical of goodness-of-fit tests) which is computationally more efficient than standard parametric bootstrap. Moreover, an upper bound for the Type-II error highlights the dependence on influential quantities. Experiments illustrate the practical improvement allowed by our test in high-dimensional settings where common normality tests…
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.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Adversarial Robustness in Machine Learning · Statistical Methods and Inference
