English
Related papers

Related papers: AdamHD: Decoupled Huber Decay Regularization for L…

200 papers

How does the choice of optimization algorithm shape a model's ability to learn features? To address this question for steepest descent methods --including sign descent, which is closely related to Adam --we introduce steepest mirror flows…

Machine Learning · Computer Science 2026-03-03 Tom Jacobs , Chao Zhou , Rebekka Burkholz

Training instability in modern deep learning systems is frequently triggered by rare but extreme gradient-norm spikes, which can induce oversized parameter updates, corrupt optimizer state, and lead to slow recovery or divergence. Widely…

Adam has achieved strong empirical success, but its theory remains incomplete even in the deterministic full-batch setting, largely because adaptive preconditioning and momentum are tightly coupled. In this work, a convergent reformulation…

Optimization and Control · Mathematics 2026-04-13 Yaxin Yu , Long Chen , Zeyi Xu

Here I present a small update to the bias-correction term in the Adam optimizer that has the advantage of making smaller gradient updates in the first several steps of training. With the default bias-correction, Adam may actually make…

Machine Learning · Computer Science 2021-10-25 John St John

This study investigates how weight decay affects the update behavior of individual neurons in deep neural networks through a combination of applied analysis and experimentation. Weight decay can cause the expected magnitude and angular…

Machine Learning · Computer Science 2024-06-04 Atli Kosson , Bettina Messmer , Martin Jaggi

Averaging techniques such as Ruppert--Polyak averaging and exponential movering averaging (EMA) are powerful approaches to accelerate optimization procedures of stochastic gradient descent (SGD) optimization methods such as the popular ADAM…

Optimization and Control · Mathematics 2025-05-29 Arnulf Jentzen , Julian Kranz , Adrian Riekert

Entropy Minimization (EM) is beneficial to reducing class overlap, bridging domain gap, and restricting uncertainty for various tasks in machine learning, yet its potential is limited. To study the internal mechanism of EM, we reformulate…

Machine Learning · Computer Science 2025-11-06 Jing Ma , Hanlin Li , Xiang Xiang

Recent evidence suggests that Adam performs robustly when its momentum parameters are tied, $\beta_1=\beta_2$, reducing the optimizer to a single remaining parameter. However, how this parameter should be set remains poorly understood. We…

Most popular optimizers for deep learning can be broadly categorized as adaptive methods (e.g. Adam) and accelerated schemes (e.g. stochastic gradient descent (SGD) with momentum). For many models such as convolutional neural networks…

Machine Learning · Computer Science 2020-12-22 Juntang Zhuang , Tommy Tang , Yifan Ding , Sekhar Tatikonda , Nicha Dvornek , Xenophon Papademetris , James S. Duncan

Weight decay is a standard technique to improve generalization performance in modern deep neural network optimization, and is also widely adopted in federated learning (FL) to prevent overfitting in local clients. In this paper, we first…

Machine Learning · Computer Science 2024-02-19 Junbo Li , Ang Li , Chong Tian , Qirong Ho , Eric P. Xing , Hongyi Wang

The rapid scaling of large language models (LLMs) has made low-precision training essential for reducing memory, improving efficiency, and enabling larger models and datasets. Existing convergence theories for adaptive optimizers, however,…

Machine Learning · Computer Science 2026-03-03 Xuan Tang , Jichu Li , Difan Zou

Large Language Models (LLMs) have demonstrated exceptional capabilities across diverse natural language processing benchmarks. However, the escalating scale of model parameters imposes prohibitive memory overheads during training,…

Machine Learning · Computer Science 2026-04-28 Ziqing Wen , Ping Luo , Jiahuan Wang , Kun Yuan , Dongsheng Li , Tao Sun

Increasing the batch size during training -- a ''batch ramp'' -- is a promising strategy to accelerate large language model pretraining. While for SGD, doubling the batch size can be equivalent to halving the learning rate, the optimal…

Machine Learning · Computer Science 2025-10-17 Alexandru Meterez , Depen Morwani , Jingfeng Wu , Costin-Andrei Oncescu , Cengiz Pehlevan , Sham Kakade

Deep learning methods - usually consisting of a class of deep neural networks (DNNs) trained by a stochastic gradient descent (SGD) optimization method - are nowadays omnipresent in data-driven learning problems as well as in scientific…

Optimization and Control · Mathematics 2025-01-13 Steffen Dereich , Arnulf Jentzen , Adrian Riekert

Applying weight decay (WD) to matrix layers is standard practice in large-language-model pretraining. Prior work suggests that stochastic gradient noise induces a Brownian-like expansion of the weight matrices W, whose growth is…

Machine Learning · Computer Science 2026-01-09 Maksim Velikanov , Ilyas Chahed , Jingwei Zuo , Dhia Eddine Rhaiem , Younes Belkada , Hakim Hacid

The best performing Binary Neural Networks (BNNs) are usually attained using Adam optimization and its multi-step training variants. However, to the best of our knowledge, few studies explore the fundamental reasons why Adam is superior to…

Machine Learning · Computer Science 2021-06-22 Zechun Liu , Zhiqiang Shen , Shichao Li , Koen Helwegen , Dong Huang , Kwang-Ting Cheng

Adam is a widely used stochastic optimization method for deep learning applications. While practitioners prefer Adam because it requires less parameter tuning, its use is problematic from a theoretical point of view since it may not…

Machine Learning · Computer Science 2020-11-25 Mingrui Liu , Wei Zhang , Francesco Orabona , Tianbao Yang

AdamZ is an advanced variant of the Adam optimiser, developed to enhance convergence efficiency in neural network training. This optimiser dynamically adjusts the learning rate by incorporating mechanisms to address overshooting and…

Machine Learning · Computer Science 2024-11-26 Ilia Zaznov , Atta Badii , Alfonso Dufour , Julian Kunkel

A novel regularization technique, AdaCubic, is proposed that adapts the weight of the cubic term. The heart of AdaCubic is an auxiliary optimization problem with cubic constraints that dynamically adjusts the weight of the cubic term in…

Machine Learning · Computer Science 2026-04-13 Ioannis Tsingalis , Constantine Kotropoulos , Corentin Briat

Recent studies have shown that proximal gradient (PG) method and accelerated gradient method (APG) with restarting can enjoy a linear convergence under a weaker condition than strong convexity, namely a quadratic growth condition (QGC).…

Optimization and Control · Mathematics 2017-05-16 Mingrui Liu , Tianbao Yang
‹ Prev 1 3 4 5 6 7 10 Next ›