Art of DS

Appearance

Palette
Theme
Unlock $20 one time
Sign in, or create an account

Sign in to Art of DSCreate your Art of DS account

We email you a link and a six-digit code. Either one signs you in; there is no password.Enter your email. We send a link and a six-digit code to confirm it — no password to remember. The account is free.

  • You come back to this page, right where you were.
  • Already have an account? The same email simply signs you in.

By continuing you accept the Terms and the Privacy policy.

Your account

Free accountLifetime access

difficulty 3/5

Adam

Definition

An optimiser that keeps a running average of both the gradient and its square, giving every parameter its own effective step size — the default choice for training neural networks.

Formula
θt+1=θt−η m^tv^t+ϵ\theta_{t+1} = \theta_t - \eta \, \frac{\hat{m}_t}{\sqrt{\hat{v}_t} + \epsilon}

Intuition

Plain SGD applies one learning rate to every parameter. But parameters are not alike: the loss is often highly sensitive to some directions in parameter space and insensitive to others, so a single η has to compromise between them [3, §8.5].

Adam gives each parameter its own effective step size, worked out from that parameter's own gradient history. A parameter with large gradients has them divided by a large running scale, one with small gradients by a small one, so rescaling one parameter's gradients leaves its steps unchanged: the method is "invariant to diagonal rescaling of the gradients" [1, abstract]. Its authors add that its hyper-parameters "typically require little tuning" [1, abstract], which is a large part of why it became the default. How far that holds is disputed; see the pitfalls.

Formal definition

How it works

Where it's used

Why & when

Worked example

Pitfalls

Check yourself

3 questions

The questions on this page come with access. They are graded on the server, so the answers stay there until you have given yours.

Unlock all quizzes

On the cheat sheet: Optimizers →

Sources

  1. Kingma, Ba. Adam: A Method for Stochastic Optimization (2014)paperhttps://arxiv.org/abs/1412.6980
  2. Zhang, Lipton, Li, Smola. Dive into Deep Learningbook · retrieved 2026-08-31https://d2l.ai/
  3. Goodfellow, Bengio, Courville. Deep Learning (2016)book · retrieved 2026-10-06https://www.deeplearningbook.org/contents/optimization.html
  4. Loshchilov, Hutter. Decoupled Weight Decay Regularization (2019)paperhttps://arxiv.org/abs/1711.05101
  5. Wilson, Roelofs, Stern, Srebro, Recht. The Marginal Value of Adaptive Gradient Methods in Machine Learning (2017)paperhttps://arxiv.org/abs/1705.08292
  6. tf.keras.optimizers.Adamdocs · retrieved 2026-10-06https://www.tensorflow.org/api_docs/python/tf/keras/optimizers/Adam

Have a promo code?

A code that takes 100% off unlocks everything at once. A smaller one takes its share off the price in the payment window: enter the same code there.

Write to support

A question, a problem with access, a refund? Write to us and we answer by email.

What is it about?

Your address is used only to answer you.

Message sent

Thank you. We will reply to the address you gave, by email.

Or write to us directly

support@artofds.com

Message sent Thank you. We will reply to the address you gave, by email.

Check the email address: we need it to reply.

That is our own address. Enter yours, so the reply reaches you.

This address cannot receive email. Check it for a typo.

Write a little more: at least 10 characters.

Too many messages in a short time. Try again in a few minutes.

The message could not be sent. Please write to us directly: support@artofds.com