Pith. sign in

REVIEW 1 cited by

Efficient Sparse-Winograd Convolutional 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 1802.06367 v1 pith:RZFGOIPT submitted 2018-02-18 cs.CV cs.LGcs.NE

classification cs.CVcs.LGcs.NE
keywords timeswinogradsparsitydomainactivationscnnsconvolutionalexploit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Convolutional Neural Networks (CNNs) are computationally intensive, which limits their application on mobile devices. Their energy is dominated by the number of multiplies needed to perform the convolutions. Winograd's minimal filtering algorithm (Lavin, 2015) and network pruning (Han et al., 2015) can reduce the operation count, but these two methods cannot be directly combined $-$ applying the Winograd transform fills in the sparsity in both the weights and the activations. We propose two modifications to Winograd-based CNNs to enable these methods to exploit sparsity. First, we move the ReLU operation into the Winograd domain to increase the sparsity of the transformed activations. Second, we prune the weights in the Winograd domain to exploit static weight sparsity. For models on CIFAR-10, CIFAR-100 and ImageNet datasets, our method reduces the number of multiplications by $10.4\times$, $6.8\times$ and $10.8\times$ respectively with loss of accuracy less than $0.1\%$, outperforming previous baselines by $2.0\times$-$3.0\times$. We also show that moving ReLU to the Winograd domain allows more aggressive pruning.

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. Accelerated CNN Training Through Gradient Approximation

    cs.CV 2019-08 conditional novelty 5.0 of 10

    Approximating the weight gradient for a subset of layers and batches yields 3.5% to 7% wall-clock training speedup on CIFAR-10 deep CNNs with minimal validation accuracy loss.

Pith tools