mlsanityData to 14 Oct 2026

EDropout: Energy-Based Dropout and Pruning of Deep Neural Networks

arXiv 2006.04270 ↗First posted 7 Jun 2020cs.LG cs.CV cs.NEcited by 20

Not on the map. Why?

Abstract (arXiv)

Dropout is a well-known regularization method by sampling a sub-network from a larger deep neural network and training different sub-networks on different subsets of the data. Inspired by the dropout concept, we propose EDropout as an energy-based framework for pruning neural networks in classification tasks. In this approach, a set of binary pruning state vectors (population) represents a set of corresponding sub-networks from an arbitrary provided original neural network. An energy loss function assigns a scalar energy loss value to each pruning state. The energy-based model stochastically evolves the population to find states with lower energy loss. The best pruning state is then selected and applied to the original network. Similar to dropout, the kept weights are updated using backpropagation in a probabilistic model. The energy-based model again searches for better pruning states and the cycle continuous. Indeed, this procedure is in fact switching between the energy model, which manages the pruning states, and the probabilistic model, which updates the temporarily unpruned weights, in each iteration. The population can dynamically converge to a pruning state. This can be interpreted as dropout leading to pruning the network. From an implementation perspective, EDropout can prune typical neural networks without modification of the network architecture. We evaluated the proposed method on different flavours of ResNets, AlexNet, and SqueezeNet on the Kuzushiji, Fashion, CIFAR-10, CIFAR-100, and Flowers datasets, and compared the pruning rate and classification performance of the models. On average the networks trained with EDropout achieved a pruning rate of more than 50% of the trainable parameters with approximately <5% and <1% drop of Top-1 and Top-5 classification accuracy, respectively.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 4; 2022: 6; 2023: 3; 2024: 4; 2025: 2; 2026: 1.

20 papers.

Sort:

By area:

  1. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  2. 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNNcited by 9
  3. 2021Deep Model Compression based on the Training Historycited by 7
  4. 2022S-Rocket: Selective Random Convolution Kernels for Time Series Classificationcited by 7
  5. 2022Perturbation of Deep Autoencoder Weights for Model Compression and Classification of Tabular Datacited by 7
  6. 2021Not All Attention Is All You Needcited by 5
  7. 2022A Survey on Dropout Methods and Experimental Verification in Recommendationcited by 4
  8. 2023A Hybrid of Generative and Discriminative Models Based on the Gaussian-coupled Softmax Layercited by 4
  9. 2022Regularization-based Pruning of Irrelevant Weights in Deep Neural Architecturescited by 3
  10. 2022Compact Model Training by Low-Rank Projection with Energy Transfercited by 3
  11. 2025Deep Neural Networks Inspired by Differential Equationscited by 2
  12. 2021Learning Pruned Structure and Weights Simultaneously from Scratch: an Attention based Approachcited by 1
8 more
  1. 2022Latency Adjustable Transformer Encoder for Language Understandingcited by 1
  2. 2024CALICO: Confident Active Learning with Integrated Calibrationcited by 1
  3. 2023Magnificent Minified Modelscited by 0
  4. 2024Pseudo-label Learning with Calibrated Confidence Using an Energy-based Modelcited by 0
  5. 2024A Comprehensive Study of Structural Pruning for Vision Modelscited by 0
  6. 2024Toward Efficient Convolutional Neural Networks With Structured Ternary Patternscited by 0
  7. 2025Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networkscited by 0
  8. 2026Fast Tensorization of Neural Networks via Slice-wise Feature Distillationcited by 0