A Normality Test for High-dimensional Data based on a Nearest Neighbor Approach
Not on the map. Why?
Abstract (arXiv)
Many statistical methodologies for high-dimensional data assume the population is normal. Although a few multivariate normality tests have been proposed, to the best of our knowledge, none of them can properly control the type I error when the dimension is larger than the number of observations. In this work, we propose a novel nonparametric test that utilizes the nearest neighbor information. The proposed method guarantees the asymptotic type I error control under the high-dimensional setting. Simulation studies verify the empirical size performance of the proposed test when the dimension grows with the sample size and at the same time exhibit a superior power performance of the new test compared with alternative methods. We also illustrate our approach through two popularly used data sets in high-dimensional classification and clustering literatures where deviation from the normality assumption may lead to invalid conclusions.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 2.
3 papers.
- 2026Two-Way Is Better Than One: Bidirectional Alignment with Cycle Consistency for Exemplar-Free Class-Incremental Learningcited by 1
- 2023Alteration Detection of Tensor Dependence Structure via Sparsity-Exploited Reranking Algorithmcited by 0
- 2026Anomaly detection in time-series via inductive biases in the latent space of conditional normalizing flowscited by 0
- 2026Two-Way Is Better Than One: Bidirectional Alignment with Cycle Consistency for Exemplar-Free Class-Incremental Learning4 Jun 2026
- 2026Anomaly detection in time-series via inductive biases in the latent space of conditional normalizing flows12 Mar 2026
- 2023Alteration Detection of Tensor Dependence Structure via Sparsity-Exploited Reranking Algorithm13 Oct 2023