The reviewed record of science sign in
Pith

arxiv: 2210.14012 · v2 · pith:CKHYDEOJ · submitted 2022-10-25 · cs.LG

Gradient-based Weight Density Balancing for Robust Dynamic Sparse Training

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:CKHYDEOJrecord.jsonopen to challenge →

classification cs.LG
keywords layerweightsdensitylayerssparsetrainingweightconnections
0
0 comments X
read the original abstract

Training a sparse neural network from scratch requires optimizing connections at the same time as the weights themselves. Typically, the weights are redistributed after a predefined number of weight updates, removing a fraction of the parameters of each layer and inserting them at different locations in the same layers. The density of each layer is determined using heuristics, often purely based on the size of the parameter tensor. While the connections per layer are optimized multiple times during training, the density of each layer remains constant. This leaves great unrealized potential, especially in scenarios with a high sparsity of 90% and more. We propose Global Gradient-based Redistribution, a technique which distributes weights across all layers - adding more weights to the layers that need them most. Our evaluation shows that our approach is less prone to unbalanced weight distribution at initialization than previous work and that it is able to find better performing sparse subnetworks at very high sparsity levels.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.