LGFeb 25, 2024

Deep Neural Network Initialization with Sparsity Inducing Activations

arXiv:2402.16184v13 citationsh-index: 5ICLR
Originality Incremental advance
AI Analysis

This addresses computational efficiency for large-scale deep learning applications, though it is incremental as it builds on existing sparsity methods.

The paper tackled training instability in deep neural networks using sparsity-inducing activations like shifted ReLU and soft thresholding, and overcame it by clipping activation magnitudes based on Gaussian process analysis, achieving up to 85% sparsity with minimal accuracy loss.

Inducing and leveraging sparse activations during training and inference is a promising avenue for improving the computational efficiency of deep networks, which is increasingly important as network sizes continue to grow and their application becomes more widespread. Here we use the large width Gaussian process limit to analyze the behaviour, at random initialization, of nonlinear activations that induce sparsity in the hidden outputs. A previously unreported form of training instability is proven for arguably two of the most natural candidates for hidden layer sparsification; those being a shifted ReLU ($φ(x)=\max(0, x-τ)$ for $τ\ge 0$) and soft thresholding ($φ(x)=0$ for $|x|\leτ$ and $x-\text{sign}(x)τ$ for $|x|>τ$). We show that this instability is overcome by clipping the nonlinear activation magnitude, at a level prescribed by the shape of the associated Gaussian process variance map. Numerical experiments verify the theory and show that the proposed magnitude clipped sparsifying activations can be trained with training and test fractional sparsity as high as 85\% while retaining close to full accuracy.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes