paper-with-me

Papers

Gradient Noise Convolution (GNC): Smoothing Loss Function for Distributed Large-Batch SGD

2019-06-26 · Kosuke Haruki, Taiji Suzuki, Yohei Hamakawa, Takeshi Toda, Ryuji Sakai, Masahiro Ozawa, Mitsuhiro Kimura

Large-batch stochastic gradient descent (SGD) is widely used for training in distributed deep learning because of its training-time efficiency, however, extremely large-batch SGD leads to poor generalization and easily converges to sharp minima, which prevents naive large-scale data-parallel SGD (DP-SGD) from converging to good minima. To overcome this difficulty, we propose gradient noise convolution (GNC), which effectively smooths sharper minima of the loss function. For DP-SGD, GNC utilizes so-called gradient noise, which is induced by stochastic gradient variation and convolved to the loss function as a smoothing effect. GNC computation can be performed by simply computing the stochastic gradient on each parallel worker and merging them, and is therefore extremely easy to implement. Due to convolving with the gradient noise, which tends to spread along a sharper direction of the loss function, GNC can effectively smooth sharp minima and achieve better generalization, whereas isotropic random noise cannot. We empirically show this effect by comparing GNC with isotropic random noise, and show that it achieves state-of-the-art generalization performance for large-scale deep neural network optimization.

📄 PDF Abstract BibTeX arXiv:1906.10822

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization

2023-11-15 · Naoki Sato, Hideaki Iiduka

The graduated optimization approach is a method for finding global optimal solutions for nonconvex functions by using a function smoothing operation with stochastic noise. We show that stochastic noise in stochastic grad…

image-classificationImage ClassificationScheduling

Random Smoothing Regularization in Kernel Gradient Descent Learning

2023-05-05 · Liang Ding, Tianyang Hu, Jiahang Jiang, Donghao Li 외

Random smoothing data augmentation is a unique form of regularization that can prevent overfitting by introducing noise to the input data, encouraging the model to learn more generalized features. Despite its success in …

Data Augmentation

Rethinking the Principle of Gradient Smooth Methods in Model Explanation

2024-10-10 · Linjiang Zhou, Chao Ma, Zepeng Wang, Xiaochuan Shi

Gradient Smoothing is an efficient approach to reducing noise in gradient-based model explanation method. SmoothGrad adds Gaussian noise to mitigate much of these noise. However, the crucial hyper-parameter in this metho…

Axiomatization of Gradient Smoothing in Neural Networks

2024-06-29 · Linjiang Zhou, Xiaochuan Shi, Chao Ma, Zepeng Wang

Gradients play a pivotal role in neural networks explanation. The inherent high dimensionality and structural complexity of neural networks result in the original gradients containing a significant amount of noise. While…

LOTION: Smoothing the Optimization Landscape for Quantized Training

2025-10-09 · Mujin Kwun, Depen Morwani, Chloe Huangyuan Su, Stephanie Gil 외 arxiv

Optimizing neural networks for quantized objectives is fundamentally challenging because the quantizer is piece-wise constant, yielding zero gradients everywhere except at quantization thresholds where the derivative is …