Pith. sign in

REVIEW 1 cited by

SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural 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 2302.04852 v1 pith:ZXPVOHXY submitted 2023-02-09 cs.LG

classification cs.LG
keywords sparsenetworkstrainingalgorithmbackpropagationcommodityefficientneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We provide a new efficient version of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware.

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. Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures

    cs.LG 2025-09 conditional novelty 5.0 of 10

    A graph-sparsified neural network, NTM, approximates Nash equilibrium strategies in stochastic differential games with far fewer trainable parameters and accuracy comparable to fully connected networks.

Pith tools