SOTAVerified

L2 Regularization

See Weight Decay.

$L_{2}$ Regularization or Weight Decay, is a regularization technique applied to the weights of a neural network. We minimize a loss function compromising both the primary loss function and a penalty on the $L_{2}$ Norm of the weights:

$$L_{new}\left(w\right) = L_{original}\left(w\right) + \lambda{w^{T}w}$$

where $\lambda$ is a value determining the strength of the penalty (encouraging smaller weights).

Weight decay can be incorporated directly into the weight update rule, rather than just implicitly by defining it through to objective function. Often weight decay refers to the implementation where we specify it directly in the weight update rule (whereas L2 regularization is usually the implementation which is specified in the objective function).

Papers

Showing 8190 of 128 papers

TitleStatusHype
Revisiting Activation Regularization for Language RNNs0
Robust method for finding sparse solutions to linear inverse problems using an L2 regularization0
Self-Distillation Amplifies Regularization in Hilbert Space0
Semantic segmentation for building houses from wooden cubes0
Sequence Length is a Domain: Length-based Overfitting in Transformer Models0
Improved error rates for sparse (group) learning with Lipschitz loss functions0
The Ant Swarm Neuro-Evolution Procedure for Optimizing Recurrent Networks0
The Theory Behind Overfitting, Cross Validation, Regularization, Bagging, and Boosting: Tutorial0
Tighter Bound Estimation of Sensitivity Analysis for Incremental and Decremental Data Modification0
Tight Sample Complexity of Large-Margin Learning0
Show:102550
← PrevPage 9 of 13Next →

No leaderboard results yet.