MLLGJul 5, 2024

Training Guarantees of Neural Network Classification Two-Sample Tests by Kernel Analysis

arXiv:2407.04806v2h-index: 15
Originality Incremental advance
AI Analysis

This work provides theoretical guarantees for neural network-based two-sample testing, addressing a foundational issue in statistical machine learning with potential applications in domain-specific tasks like anomaly detection.

The paper tackles the problem of determining training time guarantees for neural network two-sample tests by analyzing neural tangent kernel dynamics, deriving theoretical minimum and maximum training times to detect dataset deviations, and proving statistical power approaches 1 with infinite samples.

We construct and analyze a neural network two-sample test to determine whether two datasets came from the same distribution (null hypothesis) or not (alternative hypothesis). We perform time-analysis on a neural tangent kernel (NTK) two-sample test. In particular, we derive the theoretical minimum training time needed to ensure the NTK two-sample test detects a deviation-level between the datasets. Similarly, we derive the theoretical maximum training time before the NTK two-sample test detects a deviation-level. By approximating the neural network dynamics with the NTK dynamics, we extend this time-analysis to the realistic neural network two-sample test generated from time-varying training dynamics and finite training samples. A similar extension is done for the neural network two-sample test generated from time-varying training dynamics but trained on the population. To give statistical guarantees, we show that the statistical power associated with the neural network two-sample test goes to 1 as the neural network training samples and test evaluation samples go to infinity. Additionally, we prove that the training times needed to detect the same deviation-level in the null and alternative hypothesis scenarios are well-separated. Finally, we run some experiments showcasing a two-layer neural network two-sample test on a hard two-sample test problem and plot a heatmap of the statistical power of the two-sample test in relation to training time and network complexity.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes