Pith. sign in

REVIEW 2 cited by

NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigm

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 1711.02017 v3 pith:TRXDMZYY submitted 2017-11-06 cs.NE cs.AIcs.CV

classification cs.NEcs.AIcs.CV
keywords networkarchitecturenestarchitecturescompactdnnsflopsaccurate
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deep neural networks (DNNs) have begun to have a pervasive impact on various applications of machine learning. However, the problem of finding an optimal DNN architecture for large applications is challenging. Common approaches go for deeper and larger DNN architectures but may incur substantial redundancy. To address these problems, we introduce a network growth algorithm that complements network pruning to learn both weights and compact DNN architectures during training. We propose a DNN synthesis tool (NeST) that combines both methods to automate the generation of compact and accurate DNNs. NeST starts with a randomly initialized sparse network called the seed architecture. It iteratively tunes the architecture with gradient-based growth and magnitude-based pruning of neurons and connections. Our experimental results show that NeST yields accurate, yet very compact DNNs, with a wide range of seed architecture selection. For the LeNet-300-100 (LeNet-5) architecture, we reduce network parameters by 70.2x (74.3x) and floating-point operations (FLOPs) by 79.4x (43.7x). For the AlexNet and VGG-16 architectures, we reduce network parameters (FLOPs) by 15.7x (4.6x) and 30.2x (8.6x), respectively. NeST's grow-and-prune paradigm delivers significant additional parameter and FLOPs reduction relative to pruning-only methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-time Execution on Mobile Devices

    cs.LG 2019-09 conditional novelty 6.0 of 10

    PCONV combines fixed intra-kernel pattern pruning with inter-kernel connectivity pruning to create structured sparse CNNs that run in real time on mobile CPUs and GPUs.

  2. DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures

    cs.LG 2019-08 conditional novelty 6.0 of 10

    A differentiable, scale-invariant sparsity regularizer based on the squared L1/L2 ratio is applied to neural network pruning and is claimed to beat prior L0 and L1 based methods.

Pith tools