paper-with-me

홈 › Papers

Gradient Smoothing: Coupling Layer-wise Updates for Improved Optimization

2026-06-29 · Haoming Meng, Anton Sugolov, Vardan Papyan arxiv

Deep neural networks with repeated architectural blocks, such as transformers, often exhibit structured relationships across layers that emerge during training. Motivated by this observation, we introduce \emph{Depth-wise Gradient Augmentation}, a general optimization paradigm in which the update applied to each layer is obtained by transforming the collection of block-wise optimizer updates along the depth dimension. Within this framework, we study \emph{Gradient Smoothing}, a family of depth-wise smoothing methods, and instantiate it with a simple local \emph{Window Smoothing} operator. The resulting method operates directly on block-wise updates produced by arbitrary base optimizers (e.g., SGD, Adam, Muon), incurs minimal computational overhead, and is compatible with existing optimization pipelines. We evaluate Gradient Smoothing across a diverse set of architectures and training regimes, including language model pretraining, RL post-training of LLMs for reasoning, diffusion modeling, and image classification with Vision Transformers. Across these settings, Gradient Smoothing consistently improves optimization and generalization performance without modifying model architectures or training objectives. We further show that it promotes more structured representation evolution across depth, consistent with its interpretation as a structured depth-wise preconditioning method. Together, these results establish Depth-wise Gradient Augmentation as a promising framework for exploiting cross-depth structure in optimization and demonstrate Gradient Smoothing as a simple and broadly applicable instantiation.

📄 PDF Abstract BibTeX arXiv:2606.30813

Code (0)

등록된 구현이 없습니다.

Tasks

Image Classification

Similar Papers 제목 키워드 기반

Boosting Graph Neural Networks by Injecting Pooling in Message Passing

2022-02-08 · Hyeokjin Kwon, Jong-Min Lee

There has been tremendous success in the field of graph neural networks (GNNs) as a result of the development of the message-passing (MP) layer, which updates the representation of a node by combining it with its neighbo…

AlphaAdam:Asynchronous Masked Optimization with Dynamic Alpha for Selective Updates

2025-01-30 · Da Chang, Yu Li, Ganzhao Yuan

In the training of large language models (LLMs), updating parameters more efficiently and stably has always been an important challenge. To achieve efficient parameter updates, existing methods usually achieve performanc…

Computational Efficiency

Asynchronous Stochastic Gradient Descent with Decoupled Backpropagation and Layer-Wise Updates

2024-10-08 · Cabrel Teguemne Fokam, Khaleelulla Khan Nazeer, Lukas König, David Kappel 외

The increasing size of deep learning models has made distributed training across multiple devices essential. However, current methods such as distributed data-parallel training suffer from large communication and synchro…

Distributed Computing

Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation

2025-09-17 · Philip Jordan, Maryam Kamgarpour arxiv

We study the existence and computation of Nash equilibria in concave games where the players' admissible strategies are subject to shared coupling constraints. Under playerwise concavity of constraints, we prove existenc…

Analyzing the Effect of Embedding Norms and Singular Values to Oversmoothing in Graph Neural Networks

2025-10-07 · Dimitrios Kelesis, Dimitris Fotakis, Georgios Paliouras arxiv

In this paper, we study the factors that contribute to the effect of oversmoothing in deep Graph Neural Networks (GNNs). Specifically, our analysis is based on a new metric (Mean Average Squared Distance - $MASED$) to qu…

Node Classification