paper-with-me

Papers

Gradient Normalization Provably Benefits Nonconvex SGD under Heavy-Tailed Noise

2024-10-21 · Tao Sun, Xinwang Liu, Kun Yuan

This paper investigates the roles of gradient normalization and clipping in ensuring the convergence of Stochastic Gradient Descent (SGD) under heavy-tailed noise. While existing approaches consider gradient clipping indispensable for SGD convergence, we theoretically demonstrate that gradient normalization alone without clipping is sufficient to ensure convergence. Furthermore, we establish that combining gradient normalization with clipping offers significantly improved convergence rates compared to using either technique in isolation, notably as gradient noise diminishes. With these results, our work provides the first theoretical evidence demonstrating the benefits of gradient normalization in SGD under heavy-tailed noise. Finally, we introduce an accelerated SGD variant incorporating gradient normalization and clipping, further enhancing convergence rates under heavy-tailed noise.

📄 PDF Abstract BibTeX arXiv:2410.16561

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Gradient Clipping One difficulty that arises with optimization of deep neural networks is that large parameter gradients can lead an SGD optimizer to update…
Gradient Normalization 설명 없음
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 제목 키워드 기반

Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization

2024-10-17 · Yufeng Yang, Erin Tripp, Yifan Sun, Shaofeng Zou 외

Recent studies have shown that many nonconvex machine learning problems satisfy a generalized-smooth condition that extends beyond traditional smooth nonconvex optimization. However, the existing algorithms are not fully…

Exponential convergence rates for Batch Normalization: The power of length-direction decoupling in non-convex optimization

2018-05-27 · Jonas Kohler, Hadi Daneshmand, Aurelien Lucchi, Ming Zhou 외

Normalization techniques such as Batch Normalization have been applied successfully for training deep neural networks. Yet, despite its apparent empirical benefits, the reasons behind the success of Batch Normalization a…

Fast Stochastic Methods for Nonsmooth Nonconvex Optimization

2016-05-23 · Sashank J. Reddi, Suvrit Sra, Barnabas Poczos, Alex Smola

We analyze stochastic algorithms for optimizing nonconvex, nonsmooth finite-sum problems, where the nonconvex part is smooth and the nonsmooth part is convex. Surprisingly, unlike the smooth case, our knowledge of this f…

Proximal Stochastic Methods for Nonsmooth Nonconvex Finite-Sum Optimization

2016-12-01 · NeurIPS 2016 12 · Sashank J. Reddi, Suvrit Sra, Barnabas Poczos, Alexander J. Smola

We analyze stochastic algorithms for optimizing nonconvex, nonsmooth finite-sum problems, where the nonsmooth part is convex. Surprisingly, unlike the smooth case, our knowledge of this fundamental problem is very limit…

Fast Incremental Method for Nonconvex Optimization

2016-03-19 · Sashank J. Reddi, Suvrit Sra, Barnabas Poczos, Alex Smola

We analyze a fast incremental aggregated gradient method for optimizing nonconvex problems of the form $\min_x \sum_i f_i(x)$. Specifically, we analyze the SAGA algorithm within an Incremental First-order Oracle framewor…