Hidden Synergy: L₁ Weight Normalization and 1-Path-Norm Regularization

Aditya Biswas
4/29/2024
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

We present PSiLON Net, an MLP architecture that uses $L_1$ weight normalization for each weight vector and shares the length parameter across the layer. The 1-path-norm provides a bound for the Lipschitz constant of a neural network and reflects on its generalizability, and we show how PSiLON Net's design drastically simplifies the 1-path-norm, while providing an inductive bias towards efficient learning and near-sparse parameters. We propose a pruning method to achieve exact sparsity in the final stages of training, if desired. To exploit the inductive bias of residual networks, we present a simplified residual block, leveraging concatenated ReLU activations. For networks constructed with such blocks, we prove that considering only a subset of possible paths in the 1-path-norm is sufficient to bound the Lipschitz constant. Using the 1-path-norm and this improved bound as regularizers, we conduct experiments in the small data regime using overparameterized PSiLON Nets and PSiLON ResNets, demonstrating reliable optimization and strong performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{biswas2024hidden,
  title  = {Hidden Synergy: L₁ Weight Normalization and 1-Path-Norm Regularization},
  author = {Aditya Biswas},
  year   = {2024},
  eprint = {2404.19112},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.19112v1}
}

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.19112.svg)](https://codeofpaper.com/paper/2404.19112)

Discussion