Regularization in Deep Learning
A deep learning model is shaped by decisions made before training begins.
Choices Before Training
A deep learning model is shaped by decisions made before training begins. You may choose the number of layers, the number of units or filters in each layer, the activation functions, whether to use BatchNormalization, and how much dropout to apply. These choices are hyperparameters. They affect the model, but they are not trained through backpropagation.
A hyperparameter is an architecture-level choice made as part of deciding how a model will be constructed. Examples include layer count, units or filters, activation functions, BatchNormalization usage, and dropout rate. Unlike the values trained inside the model, hyperparameters are not trained through backpropagation.
The Trial-and-Feedback Cycle
Hyperparameter optimization is best understood as a sequence of model trials. A search procedure proposes one configuration. A model is built with that configuration and trained on the training data. The model is then measured on validation data. That validation measurement becomes feedback for deciding which configuration to test next.
Tracing Three Configuration Trials
Suppose a search procedure evaluates several possible model configurations. Trace what the procedure does for each trial.
- 1Propose
The search procedure chooses one configuration containing architecture-level decisions such as layer count, units or filters, activation functions, or dropout rate.
- 2Construct
A new model is created using that configuration.
- 3Train
The model is trained on the training data.
- 4Validate
The trained model is measured on validation data.
- 5Repeat
The validation result becomes feedback for selecting another configuration, and the cycle continues.
A hyperparameter search is a repeated sequence of configuration proposal, model construction, training, validation measurement, and another selection.
Why Trials Cost So Much
A search procedure does not receive useful feedback merely by comparing settings on paper. To discover whether a configuration works well, it generally has to create a new model and train that model from scratch on the dataset. Every candidate configuration can therefore expand into a complete model-training run before its validation performance is known.
Ordinary backpropagation does not directly guide this search because the choices are treated as a typically non-differentiable search space. Layer count and activation-function selection are examples of architecture-level choices, not ordinary trainable values updated by backpropagation. Search methods therefore propose configurations and obtain feedback by evaluating completed trials.
Three Search Strategies
The search method decides what configuration to try next. Random search selects hyperparameter settings at random and evaluates them repeatedly. Bayesian optimization uses information from earlier evaluations to propose promising settings. Genetic algorithms are another family of search techniques. These methods differ in how they use the history of trials, but each still depends on evaluating proposed configurations.
| Method | How it proposes configurations | Use of earlier evaluations |
|---|---|---|
| Random search | Selects hyperparameter settings at random | Does not use earlier results to make the random selection |
| Bayesian optimization | Proposes promising settings | Uses information from earlier evaluations |
| Genetic algorithms | Uses a family of search techniques | The source identifies it as another search family without specifying a single proposal rule |
High-level distinctions among three hyperparameter search approaches
Do not assume that a more elaborate search method automatically wins. The source notes that random search can sometimes be the best practical choice despite its simplicity, while every method still pays the cost of evaluating candidates.
Validation Feedback and Overfitting
Validation data provides the feedback that drives hyperparameter search. That usefulness creates a risk: if hyperparameters are repeatedly updated according to validation performance, the hyperparameters themselves can overfit to the validation data. The validation set is no longer being used only to compare independent choices; it is also becoming part of the evidence that shapes those choices.
Recognizing Validation-Set Overfitting
A search repeatedly proposes configurations, trains a new model for each one, and keeps using validation performance to decide what to try next. What changes about the role of the validation set?
- 1Initial comparison
The validation data provides feedback for comparing candidate configurations.
- 2Repeated selection
The search repeatedly updates its choices according to validation performance.
- 3Accumulated influence
The validation set becomes part of the evidence shaping the hyperparameters, rather than serving only as a one-time comparison source.
- 4Later measurement
A final test-data measurement remains a distinct later step in the optimization process.
Repeatedly selecting based on validation performance can make the hyperparameters overfit to the validation data, so final evaluation must use a distinct test-data measurement.
Common Search Mistakes
Common mistake Treating hyperparameters as values that backpropagation trains
What it looks likeAssuming that layer count, activation function, or dropout rate will be directly updated during model training
Why it failsThese are architecture-level choices and are not trained through backpropagation.
Do this insteadTreat them as candidate settings proposed by a hyperparameter search procedure.
Common mistake Counting a configuration comparison as the entire trial
What it looks likeComparing two dropout rates on paper without building and training models
Why it failsValidation feedback generally requires creating a new model and training it from scratch.
Do this insteadInclude model construction, training, and validation measurement in the cost of each candidate.
Common mistake Assuming Bayesian optimization removes evaluation cost
What it looks likeExpecting a search strategy that uses earlier evaluations to avoid training the proposed model
Why it failsNo search method eliminates the cost of evaluating a candidate.
Do this insteadUnderstand Bayesian optimization as a way to propose promising settings using earlier results, followed by another evaluation.
Common mistake Treating repeated validation selection as independent testing
What it looks likeUsing the same validation performance repeatedly to choose hyperparameters and then treating it as an untouched final score
Why it failsRepeated selection can cause the hyperparameters to overfit to the validation data.
Do this insteadUse a distinct later test-data measurement for final evaluation.
Practice the Reasoning
A search procedure evaluates a configuration by constructing a model, training it from scratch, measuring validation performance, and using that result to select the next configuration. Identify which part makes the search expensive, which part prevents ordinary backpropagation from directly choosing the next architecture, and what risk appears after many rounds of using the same validation data.
Hints
- Separate the cost of obtaining feedback from the method used to propose a configuration.
- Think about whether architecture-level choices form the same kind of values as those updated through backpropagation.
- Ask whether repeated validation-based selection leaves the validation set uninvolved.
- 1Hyperparameters shape a model before training and are not trained through backpropagation. Hyperparameter optimization repeatedly proposes configurations, constructs models, trains them, and measures validation performance. Each trial can be expensive because it may require a new model trained from scratch. Random search, Bayesian optimization, and genetic algorithms differ in how they propose configurations, but none removes evaluation cost. Repeatedly choosing hyperparameters from validation results can make the hyperparameters overfit to the validation set, so final test-data measurement must remain distinct.
Key Takeaways
- Hyperparameters are architecture-level choices such as layer count, units or filters, activation functions, BatchNormalization usage, and dropout rate.
- Hyperparameters are not trained through backpropagation; search procedures propose them and evaluate the resulting models.
- Hyperparameter optimization follows a repeated cycle of selection, construction, training, validation measurement, and new selection.
- Random search, Bayesian optimization, and genetic algorithms are different ways to propose configurations in a typically non-differentiable search space.
- Repeated validation-based selection can overfit hyperparameters to the validation data, making a distinct final test measurement important.