rademacher-complexity

Tag

Cards List
#rademacher-complexity

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

arXiv cs.LG ↗ · 2026-08-26 Cached

This paper proposes an analytical framework for estimating the optimal early stopping time in neural network training using Rademacher complexity with L1-norm, avoiding probabilistic assumptions and applicable to both linear and nonlinear models.

0 favorites 0 likes
← Back to home

Submit Feedback