mlsanityData to 14 Oct 2026

Deeplite Neutrino: An End-to-End Framework for Constrained Deep Learning Model Optimization

arXiv 2101.04073 ↗First posted 11 Jan 2021cs.LG cs.AI cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

Designing deep learning-based solutions is becoming a race for training deeper models with a greater number of layers. While a large-size deeper model could provide competitive accuracy, it creates a lot of logistical challenges and unreasonable resource requirements during development and deployment. This has been one of the key reasons for deep learning models not being excessively used in various production environments, especially in edge devices. There is an immediate requirement for optimizing and compressing these deep learning models, to enable on-device intelligence. In this research, we introduce a black-box framework, Deeplite Neutrino for production-ready optimization of deep learning models. The framework provides an easy mechanism for the end-users to provide constraints such as a tolerable drop in accuracy or target size of the optimized models, to guide the whole optimization process. The framework is easy to include in an existing production pipeline and is available as a Python Package, supporting PyTorch and Tensorflow libraries. The optimization performance of the framework is shown across multiple benchmark datasets and popular deep learning models. Further, the framework is currently used in production and the results and testimonials from several clients are summarized.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 11 Jan 2021.

Builds on

25 of 35 references.

References · 25

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  4. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
  5. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
  6. 2019Big Transfer (BiT): General Visual Representation Learningcited by 769
  7. 2018Rethinking the Value of Network Pruningcited by 599
  8. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
  9. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 306
  10. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 301
  11. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 284
  12. 2018Horovod: fast and easy distributed deep learning in TensorFlowcited by 279
13 more
  1. 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
  2. 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 203
  3. 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 162
  4. 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
  5. 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
  6. 2019Pruning from Scratchcited by 72
  7. 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
  8. 2019AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Ratescited by 49
  9. 2019Few Shot Network Compression via Cross Distillationcited by 26
  10. 2020Pruning Algorithms to Accelerate Convolutional Neural Networks for Edge Applications: A Surveycited by 26
  11. 2019Towards Oracle Knowledge Distillation with Neural Architecture Searchcited by 13
  12. 2019DARB: A Density-Aware Regular-Block Pruning for Deep Neural Networkscited by 5
  13. 2019Knowledge Squeezed Adversarial Network Compressioncited by 3

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1.

4 papers.