Methods › General › Stochastic Optimization › AdaSmooth
Adaptive Smooth Optimizer
AdaSmooth
Introduced by Jun Lu in AdaSmooth: An Adaptive Learning Rate Method based on Effective Ratio
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
AdaSmooth is a stochastic optimization technique that allows for per-dimension learning rate method for SGD. It is an extension of Adagrad and AdaDelta that seek to reduce its aggressive, monotonically decreasing learning rate. Instead of accumulating all past squared gradients, Adadelta restricts the window of accumulated past gradients to a fixed size w while AdaSmooth adaptively selects the size of the window.
Given the window size M, the effective ratio is calculated by
eₜ = sₜ/nₜ= (| xₜ - x_(t-M)|)/(∑ᵢ₌₀ᴹ⁻¹ | xₜ₋ᵢ - xₜ₋₁₋ᵢ|) = (| ∑ᵢ₌₀ᴹ⁻¹ Δxₜ₋₁₋ᵢ|)/(∑ᵢ₌₀ᴹ⁻¹ | Δxₜ₋₁₋ᵢ|).
Given the effective ratio, the scaled smoothing constant is obtained by:
cₜ = ( ρ₂- ρ₁) ×eₜ + (1-ρ₂),
The running average E[g²]ₜ at time step t then depends only on the previous average and current gradient:
E[g²]ₜ = cₜ² ⊙gₜ² + (1-cₜ² )⊙E[g²]ₜ₋₁
Usually ρ₁ is set to around 0.5 and ρ₂ is set to around 0.99. The update step the follows:
Δxₜ = -η/(√(E[g²]ₜ + ϵ)) ⊙gₜ,
which is incorporated into the final update:
xₜ₊₁ = xₜ + Δxₜ.
The main advantage of AdaSmooth is its faster convergence rate and insensitivity to hyperparameters.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 2 · with a code link: 0 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 2 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 2 of 2, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Gradient Descent, Stochastic Optimization, and Other Tales 2 May 2022 · 0 repositories · arXiv:2205.00832
-
AdaSmooth: An Adaptive Learning Rate Method based on Effective Ratio 2 Apr 2022 · 0 repositories · arXiv:2204.00825
Tasks archive 2025-07-28
1 task the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Stochastic Optimization | 2 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections