MétaCan
Menu
Back to cohort
Record W2795626670 · doi:10.48550/arxiv.1804.00325

Aggregated Momentum: Stability Through Passive Damping

2018· preprint· en· W2795626670 on OpenAlexaff
James Lucas, Shengyang Sun, Richard S. Zemel, Roger Grosse

Bibliographic record

VenuearXiv (Cornell University) · 2018
Typepreprint
Languageen
FieldComputer Science
TopicStochastic Gradient Optimization Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMomentum (technical analysis)Convergence (economics)Quadratic equationBETA (programming language)Gradient descentStability (learning theory)PhysicsInstabilityRate of convergenceCurvatureControl theory (sociology)Applied mathematicsMathematicsMathematical analysisComputer scienceClassical mechanicsMechanicsGeometryTelecommunications

Abstract

fetched live from OpenAlex

Momentum is a simple and widely used trick which allows gradient-based optimizers to pick up speed along low curvature directions. Its performance depends crucially on a damping coefficient $β$. Large $β$ values can potentially deliver much larger speedups, but are prone to oscillations and instability; hence one typically resorts to small values such as 0.5 or 0.9. We propose Aggregated Momentum (AggMo), a variant of momentum which combines multiple velocity vectors with different $β$ parameters. AggMo is trivial to implement, but significantly dampens oscillations, enabling it to remain stable even for aggressive $β$ values such as 0.999. We reinterpret Nesterov's accelerated gradient descent as a special case of AggMo and analyze rates of convergence for quadratic objectives. Empirically, we find that AggMo is a suitable drop-in replacement for other momentum methods, and frequently delivers faster convergence.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.101
GPT teacher head0.205
Teacher spread0.104 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations7
Published2018
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicStochastic Gradient Optimization TechniquesFrench-language works237,207