Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.

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

Open access
Dai, Xiaoliang, Yin, Hongxu, Jha, Niraj K. · 2019 · IEEE Transactions on Computers

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.2× (74.3×) and floating-point operations (FLOPs) by 79.4× (43.7×). For the AlexNet, VGG-16, and ResNet-50 architectures, we reduce network parameters (FLOPs) by 15.7× (4.6×), 33.2× (8.9×), and 4.1× (2.1×) respectively. NeST's grow-and-prune paradigm delivers significant additional parameter and FLOPs reduction relative to pruning-only methods.

Overview

Integrity signals

Registry

Crossref · 10.1109/tc.2019.2914438

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 37 references

Research works printed but not linked: 5

  1. li, 0, Pruning filters for efficient convnets, Proc Int Conf Learn Represent
  2. han, 2015, Learning both weights and connections for efficient neural network, Proc Int Conf Neural Inf Process, 1135
  3. dong, 0, Learning to prune deep neural networks via layer-wise optimal brain surgeon, Proc Advances in Neural Information Processing Systems, 4857
  4. wen, 2016, Learning structured sparsity in deep neural networks, Proc Int Conf Neural Inf Process, 2074
  5. guo, 2016, Dynamic network surgery for efficient DNNs, Proc Int Conf Neural Inf Process, 1379

Cited by

See all 233

Metadata

Authors
Dai, X., Yin, H., & Jha, N. K.
Affiliations
Princeton University (US)
Venue
IEEE Transactions on Computers
Published
2019-10-01
Volume
68
Issue
10
Pages
1487-1497
ISSN
  • 0018-9340 (ISSN-L)
  • 1557-9956
  • 2326-3814
OpenAlex
W2963319203
Cited by
233
References
37
Citations by year
2026: 8 · 2025: 18 · 2024: 15 · 2023: 25 · 2022: 38 · 2021: 54 · 2020: 45 · 2019: 20
FWCI
17.36
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Computers (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
US National Science Foundation (CNS-1617640)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
Keywords
neural network synthesis, network pruning, network expansion, architecture search, compact neural networks, magnitude-based pruning, parameter reduction, FLOPs reduction

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigm. https://app.cochat.ai/papers/10.1109/tc.2019.2914438
The paper
Dai, X., Yin, H., & Jha, N. K. (2019). NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigm. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2019.2914438

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.