SOURCE-LINKED INTELLIGENCE

A Data-dependent Early Stopping Rule using Rademacher Complexity with L1-norm

arXiv · AI, language, vision and robotics · article · Aug 25, 2026 · UTC

Training neural networks requires balancing the trade-off between fitting the training data and achieving robust performance on unseen inputs. This ability, commonly referred to as generalizability, is determined by the gap between the empirical risk on the training set (``empirical loss'') and the expected risk over the data distribution (``generalization error''). Existing approaches typically estimate the generalization error numerically, requiring gradient descent training and an ``early stopping'' strategy. In this work, we introduce an analytic framework that estimates the optimal time o

Read original source ↗ Open in workspace

recordType

paper

region

Global