DoG (Distance over Gradients Parameter-Free Step Size Schedule)
Algorithms AIMech:DogDistanceOverGradientsParameterFreeStepSizeSchedule DRAFT
Aliases: DoG, Distance over Gradients, T-DoG and L-DoG (Distance over Gradients)
A parameter-free dynamic step-size schedule for stochastic gradient descent (x_{t+1} = x_t - eta_t g_t) that sets the initial step size to eta_0 = r_epsilon / ||g_0|| for a small initial movement parameter r_epsilon and dynamically sets subsequent step sizes to the ratio of the maximum observed distance from initialization r_bar_t = max_{i<=t} ||x_i - x_0|| vee r_epsilon to the root-sum-of-squares of observed stochastic gradient norms sqrt(G_t) = sqrt(sum_{i<=t} ||g_i||^2), i.e., eta_t = r_bar_t / sqrt(sum_{i<=t} ||g_i||^2), along with a tamed variant (T-DoG) that inflates the denominator by polylogarithmic factors to guarantee iterate boundedness r_bar_T <= 3 d_0 with high probability and a per-layer variant (L-DoG).
Identity Notes & Concept Scope
Distinct from LARS, LAMB, and Fromage in that DoG scales the step size by the maximum distance from the initial point max_{i<=t} ||x_i - x_0|| rather than the current parameter norm ||x_t|| and requires no multiplicative learning-rate hyperparameter (c = 1). Distinct from D-Adaptation and Prodigy in that DoG directly plugs the empirical displacement r_bar_t into the SGD step-size numerator instead of a dual regret lower bound d_hat_t.
Claims & Grounded Evidence
3 Claims
Mechanism
#c-r591-weighted-regret-and-locally-bounded-convergence
For any DoG-like step size eta_t = r_bar_t / sqrt(G'_t) on a closed convex domain X, the r_bar_k-weighted regret satisfies sum_{k=0}^{t-1} r_bar_k <g_k, x_k - x_*> <= r_bar_t (2 d_bar_t + r_bar_t) sqrt(G'_{t-1}) (Lemma 1), and T-DoG with G'_t = 8^4 theta_{T,delta}^2 log_+^2(1 + t l_bar_t^2 / l_bar_0^2)(G_{t-1} + 16 l_bar_t^2) guarantees P(r_bar_T > 3 d_0) <= delta (Proposition 2) and high-probability O(d_0 L_* / sqrt(T)) optimality up to logarithmic factors assuming only pointwise locally bounded stochastic gradients (Theorem 1).
Application
#c-r591-layerwise-ldog-and-polynomial-averaging
Applying the DoG formula independently to each network layer l as eta_t^l = max_{i<=t} ||x_i^l - x_0^l|| / sqrt(sum_{i<=t} ||g_i^l||^2 + epsilon) (L-DoG) combined with polynomial decay iterate averaging x_bar_t^gamma = (1 - (1+gamma)/(t+gamma)) x_bar_{t-1}^gamma + ((1+gamma)/(t+gamma)) x_t (gamma = 8) matches or outperforms tuned SGD across 79 of 80 vision and language fine-tuning tasks and narrows the performance gap to instance-tuned Adam.
Limitation
#c-r591-nemirovski-divergence-and-batchnorm-sensitivity
Untamed DoG is not universally iterate-bounded — on a pathological variant of Nemirovski's function in R^m, its displacement grows as r_bar_T / d_0 = sqrt(T) / 10 (Appendix C.3) — and in deep networks with batch normalization, scale invariance can make DoG sensitive to overly small initial movement sizes r_epsilon.
⚠️ Curated Limitations & Negative Results
- Untamed DoG can diverge on pathological convex objectives (such as Nemirovski's function where r_bar_T / d_0 = sqrt(T) / 10), while T-DoG's polylogarithmic taming factor is too conservative for practical training.
- Exhibits sensitivity to overly small initial movement sizes r_epsilon on architectures with batch normalization and lacks native momentum or coordinatewise Adam preconditioning.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:ArtificialNeuralNetwork
Artificial Neural Network
|
related_match | DoG is a parameter-free dynamic SGD step-size schedule for training and fine-tuning artificial neural networks. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r591-primary-pdf
|
Maor Ivgi, Oliver Hinder, Yair Carmon
|
primary paper
full_text
|
ID: https://dblp.org/rec/conf/icml/IvgiHC23
sha256:b66a44022187…
|
r591-arxiv-abs
|
Maor Ivgi, Oliver Hinder, Yair Carmon
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2302.12022
sha256:f50020911da6…
|
r591-metadata-cr
|
Maor Ivgi, Oliver Hinder, Yair Carmon
|
primary paper
abstract_only
|
ID: https://dblp.org/rec/conf/icml/IvgiHC23
sha256:110e9d8ff82e…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T11:14:00Z
Updated: 2026-10-19T11:14:00Z
Source File:
data/curated/DogDistanceOverGradientsParameterFreeStepSizeSchedule.yaml
· Schema:
curated_concept.yaml
Explore across X-Mech
Related computational & biological Mechs:
Embedding Map
Network Graph
ProteinTraitsMech (ESM-2 pLM)
DUFMech (Domain pLM)
TraitMech
CultureMech
All 14 X-Mech Repositories