Deep Learning Optimizers
Optimization algorithms for training neural networks: SGD, Momentum, NAG, Adam, AdamW, RMSprop, AdaGrad, and learning rate scheduling strategies.
Optimization algorithms for training neural networks: SGD, Momentum, NAG, Adam, AdamW, RMSprop, AdaGrad, and learning rate scheduling strategies.
| Name | Year | Update | Pros | Cons | Best for | Notes |
|---|---|---|---|---|---|---|
| SGD (Stochastic Gradient Descent) | 1951 (Robbins-Monro) | θ = θ - α * ∇L(θ) |
|
| When generalization matters more than speed; convex or nearly convex problems | Still the gold standard for many vision tasks; often generalizes better than adaptive methods |
| SGD + Momentum | 1964 (Polyak) | v = γv + α∇L(θ); θ = θ - v |
|
| Most deep learning tasks; default choice for CNNs | Momentum term accumulates gradient in consistent directions; γ=0.9 is standard |
| NAG (Nesterov Accelerated Gradient) | 1983 | v = γv + α∇L(θ - γv); θ = θ - v |
|
| RNNs, problems with high curvature | Computes gradient at approximate future position rather than current position |
| AdaGrad (Adaptive Gradient) | 2011 (Duchi et al.) | G = G + ∇L²; θ = θ - α/(√G + ε) * ∇L |
|
| Sparse features (NLP, recommender systems), convex optimization | Accumulates squared gradients; LR shrinks to zero eventually — problematic for deep nets |
| RMSprop (Root Mean Square Propagation) | 2012 (Hinton) | E[g²] = γE[g²] + (1-γ)∇L²; θ = θ - α/(√E[g²] + ε) * ∇L |
|
| RNNs, non-stationary objectives, online learning | Uses exponential moving average of squared gradients instead of cumulative sum |
| Adam (Adaptive Moment Estimation) | 2014 (Kingma & Ba) | m = β₁m + (1-β₁)∇L; v = β₂v + (1-β₂)∇L²; θ = θ - α * m̂/(√v̂ + ε) |
|
| Default optimizer for most deep learning; fast prototyping; NLP, vision, RL | Default: β₁=0.9, β₂=0.999, ε=1e-8, α=0.001. Most widely used optimizer. |
| AdamW (Adam with Decoupled Weight Decay) | 2017 (Loshchilov & Hutter) | θ = θ - α * (m̂/(√v̂ + ε) + λθ) |
|
| Transformers (BERT, GPT), vision transformers, any architecture with weight decay | Weight decay applied outside adaptive LR computation; default for most modern architectures |
| LAMB / LARS | 2019 | Trust ratio × adaptive step (layer-wise adaptive scaling) |
|
| Large-batch distributed training (TPU pods, multi-node GPU), BERT pretraining at scale | LARS (Layer-wise Adaptive Rate Scaling) and LAMB (Large Batch Adam) enable batch sizes that would diverge with standard Adam |
The static files are identical to what the API returns, but with no rate limit and no server round trip. Use the API when you want a query and a content type; use the files when you want to cache one document.
curl "https://yjtoon.com/api/dataset/deep-learning-optimizers?format=toon"
const res = await fetch( "https://yjtoon.com/static-data/dataset/deep-learning-optimizers.toon" ); const toon = await res.text();
Rate limit: 120 requests per minute per IP, no key and no signup. API reference →