Pith. sign in

REVIEW 1 cited by

Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.13896 v1 pith:E7EMALAR submitted 2021-12-27 cs.LG cs.AIcs.ARcs.NE

classification cs.LGcs.AIcs.ARcs.NE
keywords sparsitynetworksperformanceactivationcomplementaryneuralsparseweight
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In principle, sparse neural networks should be significantly more efficient than traditional dense networks. Neurons in the brain exhibit two types of sparsity; they are sparsely interconnected and sparsely active. These two types of sparsity, called weight sparsity and activation sparsity, when combined, offer the potential to reduce the computational cost of neural networks by two orders of magnitude. Despite this potential, today's neural networks deliver only modest performance benefits using just weight sparsity, because traditional computing hardware cannot efficiently process sparse networks. In this article we introduce Complementary Sparsity, a novel technique that significantly improves the performance of dual sparse networks on existing hardware. We demonstrate that we can achieve high performance running weight-sparse networks, and we can multiply those speedups by incorporating activation sparsity. Using Complementary Sparsity, we show up to 100X improvement in throughput and energy efficiency performing inference on FPGAs. We analyze scalability and resource tradeoffs for a variety of kernels typical of commercial convolutional networks such as ResNet-50 and MobileNetV2. Our results with Complementary Sparsity suggest that weight plus activation sparsity can be a potent combination for efficiently scaling future AI models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TopK Language Models

    cs.CL 2025-06 conditional novelty 6.0 of 10

    A transformer LM trained with TopK activations in its hidden layers produces sparse, SAE-like internal representations without needing post-hoc sparse autoencoder training.

Pith tools