LGJan 12, 2023

Toward Theoretical Guidance for Two Common Questions in Practical Cross-Validation based Hyperparameter Selection

arXiv:2301.05131v11 citationsh-index: 41
Originality Incremental advance
AI Analysis

This work addresses incremental theoretical guidance for practitioners in machine learning dealing with hyperparameter selection and optimization efficiency.

The paper tackles two practical questions in cross-validation hyperparameter selection: whether to retrain on all data after selection and how to set optimization tolerance, introducing theoretical concepts like hold-in risk and model class mis-specification risk. In synthetic studies, the proposed heuristics achieve at least as good performance as baseline retraining strategies and reduce computational overhead by up to 2x without loss in predictive performance.

We show, to our knowledge, the first theoretical treatments of two common questions in cross-validation based hyperparameter selection: (1) After selecting the best hyperparameter using a held-out set, we train the final model using {\em all} of the training data -- since this may or may not improve future generalization error, should one do this? (2) During optimization such as via SGD (stochastic gradient descent), we must set the optimization tolerance $ρ$ -- since it trades off predictive accuracy with computation cost, how should one set it? Toward these problems, we introduce the {\em hold-in risk} (the error due to not using the whole training data), and the {\em model class mis-specification risk} (the error due to having chosen the wrong model class) in a theoretical view which is simple, general, and suggests heuristics that can be used when faced with a dataset instance. In proof-of-concept studies in synthetic data where theoretical quantities can be controlled, we show that these heuristics can, respectively, (1) always perform at least as well as always performing retraining or never performing retraining, (2) either improve performance or reduce computational overhead by $2\times$ with no loss in predictive performance.

Foundations

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

Your Notes