Decoupled Weight Decay for Any p Norm

Nadav Joseph Outmezguine, Noam Levi
4/16/2024
cs.LGcs.AIcs.NE

No official code found. Best implementation: Nadav-out/PAdam (0 stars, last commit 2024-05-22).

Abstract

With the success of deep neural networks (NNs) in a variety of domains, the computational and storage requirements for training and deploying large NNs have become a bottleneck for further improvements. Sparsification has consequently emerged as a leading approach to tackle these issues. In this work, we consider a simple yet effective approach to sparsification, based on the Bridge, or $L_p$ regularization during training. We introduce a novel weight decay scheme, which generalizes the standard $L_2$ weight decay to any $p$ norm. We show that this scheme is compatible with adaptive optimizers, and avoids the gradient divergence associated with $0<p<1$ norms. We empirically demonstrate that it leads to highly sparse networks, while maintaining generalization performance comparable to standard $L_2$ regularization.

View on arXivView PDF

Code Implementations(1)

Nadav-out/PAdamCommunity100%

An Adam optimizer for any p-norm regularization.

01PythonNov 11, 20232 years ago

Similar Papers

Cite this paper

@article{outmezguine2024decoupled,
  title  = {Decoupled Weight Decay for Any p Norm},
  author = {Nadav Joseph Outmezguine and Noam Levi},
  year   = {2024},
  eprint = {2404.10824},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.10824v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.10824.svg)](https://codeofpaper.com/paper/2404.10824)

Discussion