mlsanityData to 7 Oct 2026

Pruning for Improved ADC Efficiency in Crossbar-based Analog In-memory Accelerators

arXiv 2403.13082 ↗First posted 19 Mar 2024cs.ET cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep learning has proved successful in many applications but suffers from high computational demands and requires custom accelerators for deployment. Crossbar-based analog in-memory architectures are attractive for acceleration of deep neural networks (DNN), due to their high data reuse and high efficiency enabled by combining storage and computation in memory. However, they require analog-to-digital converters (ADCs) to communicate crossbar outputs. ADCs consume a significant portion of energy and area of every crossbar processing unit, thus diminishing the potential efficiency benefits. Pruning is a well-studied technique to improve the efficiency of DNNs but requires modifications to be effective for crossbars. In this paper, we motivate crossbar-attuned pruning to target ADC-specific inefficiencies. This is achieved by identifying three key properties (dubbed D.U.B.) that induce sparsity that can be utilized to reduce ADC energy without sacrificing accuracy. The first property ensures that sparsity translates effectively to hardware efficiency by restricting sparsity levels to Discrete powers of 2. The other 2 properties encourage columns in the same crossbar to achieve both Unstructured and Balanced sparsity in order to amortize the accuracy drop. The desired D.U.B. sparsity is then achieved by regularizing the variance of L0 norms of neighboring columns within the same crossbar. Our proposed implementation allows it to be directly used in end-to-end gradient-based training. We apply the proposed algorithm to convolutional layers of VGG11 and ResNet18 models, trained on CIFAR-10 and ImageNet datasets, and achieve up to 7.13x and 1.27x improvement, respectively, in ADC energy with less than 1% drop in accuracy.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 43 references that are in the map. First posted on arXiv 19 Mar 2024.

Builds on

18 of 43 references.

References · 18

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  6. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  7. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  8. 2020What is the State of Neural Network Pruning?cited by 578
  9. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  10. 2022DETRs with Collaborative Hybrid Assignments Trainingcited by 273
  11. 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 118
  12. 2019PUMA: A Programmable Ultra-efficient Memristor-based Accelerator for Machine Learning Inferencecited by 57
6 more
  1. 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
  2. 2017STDP Based Pruning of Connections and Weight Quantization in Spiking Neural Networks for Energy Efficient Recognitioncited by 41
  3. 2019PANTHER: A Programmable Architecture for Neural Network Training Harnessing Energy-efficient ReRAMcited by 16
  4. 2018A Low Effort Approach to Structured CNN Design Using PCAcited by 14
  5. 2018Crossbar-aware neural network pruningcited by 6
  6. 2020Gradual Channel Pruning while Training using Feature Relevance Scores for Convolutional Neural Networkscited by 6

Built on by

Not cited yet.