Skip to content
Preprint

Hybrid Momentum Methods for Optimizing Deep Learning Models

Oct 2026 · 0 citations · 36 references
Computer Science

TL;DR

This work proposes Hybrid Momentum (HyM), which combines a linearly weighted average of past gradients with a geometrically discounted fast momentum, and proposes HyMUON, which applies Newton--Schulz orthogonalization to the hybrid direction.

Abstract

Momentum is central to stochastic optimization in deep learning, including the training of large language models. Classical momentum methods typically rely on a fast exponential moving average (EMA) scheme, which discounts past gradients on a fixed timescale and may underweight older gradients that remain informative. This creates a trade-off between retaining long-term history and adapting to recent changes. We introduce Hybrid Momentum (HyM), which combines a linearly weighted average of past gradients with a geometrically discounted fast momentum. The former assigns weights proportional to the gradients'iteration indices and retains a growing span of history, while the latter emphasizes recent gradients. This hybrid construction is modular and can be combined with adaptive preconditioning and other update transformations. In particular, we propose HyMUON, which applies Newton--Schulz orthogonalization to the hybrid direction. Illustrative examples and controlled experiments demonstrate the benefits of combining gradient information across these two timescales. Across image classification, machine translation, and language modeling, HyM and HyMUON match or improve upon strong baselines. HyMUON improves over Muon on IWSLT14, and in both the 100k- and 600k-step GPT-2 124M OpenWebText regimes. For LLaMA-1.3B pretraining on C4, HyMUON achieves a final validation loss of 2.777, compared with 2.903 for Muon.

View source

Similar papers

A Distributional Optimisation Perspective on Combining Models in Deep Learning

Combining predictions from different models can improve performance at machine learning tasks, but the training of the individual models and the rule used to combine them are typically chosen separately, and by ad hoc means. Recent advances in distributional optimisation (i.e. where the optimisation occurs over the set...

Cong-Ye Wang, Yan-Kai Lin, Zhe-Yang Shen et al. · 0 citations
Preprint Oct 2026

From Generic to Dedicated: A Novel Optimizer for Online Continual Learning

This work reveals a new link between optimization dynamics and OCL needs by recasting Polyak-Ruppert averaging as the engine of"plasticity" and Primal averaging as the anchor of"stability" in SPIN, which explicitly decouples plasticity and stability by interpolating between a fast-moving"plasticity"sequence and an adap...

Yong-Yi Wu, Zheng Wang, Sen Lin · 0 citations
#natural language process... Preprint Oct 2026

LoGRA: Scaling LLM Reinforcement Learning with Low-Rank Gradient Sketches

Reinforcement learning has greatly advanced the capabilities of large language models, but its memory demands remain a barrier to broader adoption. We introduce LoGRA, an approach to RL post-training that reduces memory by retaining useful learning signals in low-rank gradient sketches. These compact representations su...

Shao-Kun Zhang, Yi-Fan Zhang, Jian Hu et al. · 0 citations

Same Loss, Different Gradients

Differentiable learning typically assumes that the scalar objective evaluated in the forward pass and the gradient supplied to the optimizer in the backward pass describe the same mathematical object. We show that this correspondence can fail when probabilistic objectives rely on finite special-function recurrences, cu...

Ning-Kang Peng, Xiao-Qian Peng, Yi-Fan He et al. · 0 citations
Preprint Oct 2026

Implicit Bias of (Stochastic) Gradient Descent on Deep Linear Diagonal Networks

Modern machine learning models are often overparameterized, i.e., have more parameters than training data. This typically implies that the loss function admits multiple minimizers so that training methods (and their hyperparameter choices) have significant influence on the computed solution. We study this so-called imp...

Wiebke Bartolomaeus, Holger Rauhut · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.