Pith. sign in

REVIEW 1 cited by

Training Sparse 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 1611.06694 v1 pith:6GGDHQ4Z submitted 2016-11-21 cs.CV cs.LG

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

Deep neural networks with lots of parameters are typically used for large-scale computer vision tasks such as image classification. This is a result of using dense matrix multiplications and convolutions. However, sparse computations are known to be much more efficient. In this work, we train and build neural networks which implicitly use sparse computations. We introduce additional gate variables to perform parameter selection and show that this is equivalent to using a spike-and-slab prior. We experimentally validate our method on both small and large networks and achieve state-of-the-art compression results for sparse neural network models.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Principled Approximation Methods for Efficient and Scalable Deep Learning

    cs.LG 2025-08 conditional novelty 3.0 of 10

    A thesis that synthesizes the author's published work on continuous approximations to discrete deep learning problems, with experiments showing efficiency gains, but offering little new beyond the author's prior papers.

Pith tools