mlsanityData to 7 Oct 2026

On Accelerating Edge AI: Optimizing Resource-Constrained Environments

arXiv 2501.15014 ↗First posted 25 Jan 2025cs.LG cs.AI cs.NEcited by 5

Not on the map. Why?

Abstract (arXiv)

Resource-constrained edge deployments demand AI solutions that balance high performance with stringent compute, memory, and energy limitations. In this survey, we present a comprehensive overview of the primary strategies for accelerating deep learning models under such constraints. First, we examine model compression techniques-pruning, quantization, tensor decomposition, and knowledge distillation-that streamline large models into smaller, faster, and more efficient variants. Next, we explore Neural Architecture Search (NAS), a class of automated methods that discover architectures inherently optimized for particular tasks and hardware budgets. We then discuss compiler and deployment frameworks, such as TVM, TensorRT, and OpenVINO, which provide hardware-tailored optimizations at inference time. By integrating these three pillars into unified pipelines, practitioners can achieve multi-objective goals, including latency reduction, memory savings, and energy efficiency-all while maintaining competitive accuracy. We also highlight emerging frontiers in hierarchical NAS, neurosymbolic approaches, and advanced distillation tailored to large language models, underscoring open challenges like pre-training pruning for massive networks. Our survey offers practical insights, identifies current research gaps, and outlines promising directions for building scalable, platform-independent frameworks to accelerate deep learning models at the edge.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 95 of its 133 references that are in the map. First posted on arXiv 25 Jan 2025.

Builds on

95 of 133 references.

References · 95

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2022Generative Adversarial Networkscited by 5,603
  5. 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,674
  6. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  8. 2023Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflectioncited by 1,800
  9. 2018DARTS: Differentiable Architecture Searchcited by 1,782
  10. 2020Knowledge Distillation: A Surveycited by 1,578
  11. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
  12. 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
38 more
  1. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
  2. 2023Gorilla: Large Language Model Connected with Massive APIscited by 1,302
  3. 2017Mixed Precision Trainingcited by 1,135
  4. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  5. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  6. 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
  7. 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
  8. 2024Length-Controlled AlpacaEval: A Simple Way to Debias Automatic Evaluatorscited by 865
  9. 2018Efficient Neural Architecture Search via Parameter Sharingcited by 831
  10. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  11. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
  12. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  13. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  14. 2017Deep Mutual Learningcited by 621
  15. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  16. 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 491
  17. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  18. 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
  19. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  20. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  21. 2020NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Searchcited by 412
  22. 2019AutoML: A Survey of the State-of-the-Artcited by 388
  23. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  24. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
  25. 2021Explaining Neural Scaling Lawscited by 353
  26. 2017Large-Scale Evolution of Image Classifierscited by 348
  27. 2019NAS-Bench-101: Towards Reproducible Neural Architecture Searchcited by 340
  28. 2024A Survey on Knowledge Distillation of Large Language Modelscited by 276
  29. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
  30. 2019Data-Free Learning of Student Networkscited by 203
  31. 2019BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Searchcited by 175
  32. 2015Cross Modal Distillation for Supervision Transfercited by 173
  33. 2020Self-Distillation Amplifies Regularization in Hilbert Spacecited by 171
  34. 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
  35. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  36. 2021Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Bettercited by 153
  37. 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
  38. 2018Graph HyperNetworks for Neural Architecture Searchcited by 131

50 most cited of 95 All 95 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 3.

5 papers.