stat.MLOct 12, 2026

Feature Normalization under Finite Training Budgets

Authors: Johan Larsson

Organizations: Department of Mathematical Sciences, University of Copenhagen, Universitetsparken 5, 2100 Copenhagen, Denmark

Abstract

Standardizing a rare feature can help stochastic gradient descent learn its effect within a finite budget, but it also changes the noise cost of learning. We characterize the lowest rare-subgroup risks attainable by standardized and unscaled training when each chooses a nonnegative constant learning rate and a deterministic stopping time under the same observation cap. For two independent binary features, we derive both optimized risks as prevalence vanishes while the expected number of rare observations remains finite. Uniform control over rates and stopping times reduces each limiting oracle to a scalar minimization. With positive noise, the preferred scaling changes exactly once as we move signal to the rare feature while the limiting risk at initialization stays fixed and positive. The formulas also explain how noise and budget affect the comparison. Separate finite-prevalence bounds favor standardization on a rare-dominant signal family and unscaled training on a common-dominant family. The results concern final iterates with population preprocessing and fresh observations. Exact-moment searches assess the approximation at finite prevalence. In a controlled study, both orderings persist under observation reuse, estimated preprocessing, and intercept fitting when tuning choices are fixed before evaluation. Selecting a predictor after observing training can reverse an ordering, even when selection uses exact population risk.

Figures & tables

Appendix figures & tables11 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Asymptotic Risk of Learning-Rate Schedules for Least-Squares Regression with Discretely Distributed Features

    Oct 12, 2026Noé Colomban, Francis Bach, Fabian SchaippLearning Rate SchedulingStochastic Gradient Descent

  2. Beyond Second-Order Information: Paid Logistic Regression with Noisy Features

    Oct 9, 2026Sanghwa Kim, Kyoungseok Jang, Se-Young YunOnline LearningLogistic Regression

  3. Scaling Laws of SignSGD in Linear Regression: When Does It Outperform SGD?

    Mar 2, 2026Jihwan Kim, Dogyoon Song, Chulhee YunSign-Based OptimizationRandom Feature Methods