Revisiting Optimism and Model Complexity in the Wake of Overparameterized Machine Learning
<|reference_start|>Revisiting Optimism and Model Complexity in the Wake of Overparameterized Machine Learning: Common practice in modern machine learning involves fitting a large number of parameters relative to the number of observations. These overparameterized models can exhibit surprising generalization behavior, e.g., ``double descent'' in the prediction error curve when plotted against the raw number of model parameters, or another simplistic notion of complexity. In this paper, we revisit model complexity from first principles, by first reinterpreting and then extending the classical statistical concept of (effective) degrees of freedom. Whereas the classical definition is connected to fixed-X prediction error (in which prediction error is defined by averaging over the same, nonrandom covariate points as those used during training), our extension of degrees of freedom is connected to random-X prediction error (in which prediction error is averaged over a new, random sample from the covariate distribution). The random-X setting more naturally embodies modern machine learning problems, where highly complex models, even those complex enough to interpolate the training data, can still lead to desirable generalization performance under appropriate conditions. We demonstrate the utility of our proposed complexity measures through a mix of conceptual arguments, theory, and experiments, and illustrate how they can be used to interpret and compare arbitrary prediction models.<|reference_end|>
@article{patil2024revisiting,
    title={Revisiting Optimism and Model Complexity in the Wake of
  Overparameterized Machine Learning},
    author={Pratik Patil, Jin-Hong Du, Ryan J. Tibshirani},
    journal={arXiv preprint arXiv:2410.01259},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01259},
    primaryClass={stat.ML cs.LG math.ST stat.TH}
}