Search

Search IconIcon to open search

RMSProp

Last updatedUpdated: by Jakub Žovák · 1 min read

Properties
created 09.03.2026, 10:00
modified 26.07.2026, 13:31
published Empty
topics Optimizers, Adaptive Learning Rate
authors Empty
ai-assisted Yes

RMSProp (Root Mean Square Propagation) fixes the vanishing learning rate problem of AdaGrad by replacing the cumulative sum of squared gradients with an exponential moving average. Proposed by Hinton in his Coursera lecture (2012).

# Motivation

# Update Rule

$$ v_t = \rho\, v_{t-1} + (1 - \rho)\, g_t^2 $$


$$ \theta_t = \theta_{t-1} - \frac{\alpha}{\sqrt{v_t} + \epsilon}\, g_t $$

where:

  • \(t\) is the current time step / iteration index
  • \(g_t\) is the gradient of the loss w.r.t. parameter \(\theta\) at step \(t\)
  • \(v_t\) is the exponential moving average of squared gradients
  • \(\theta_t\) is the parameter vector being updated
  • \(\rho \approx 0.9\) is the decay rate (controls how quickly past gradients are forgotten)
  • \(\alpha\) is the learning rate
  • \(\epsilon\) is a small constant for numerical stability (avoids division by zero)

# Properties

  • Effective learning rate is stabilized — does not monotonically decrease
  • Works well in non-stationary settings (RNNs, online learning)
  • Does not include bias correction (unlike Adam)
  • Adam can be seen as RMSProp + momentum + bias correction