DropNeuron: Simplifying the Structure of Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep learning using multi-layer neural networks (NNs) architecture manifests superb power in modern machine learning systems. The trained Deep Neural Networks (DNNs) are typically large. The question we would like to address is whether it is possible to simplify the NN during training process to achieve a reasonable performance within an acceptable computational time. We presented a novel approach of optimising a deep neural network through regularisation of net- work architecture. We proposed regularisers which support a simple mechanism of dropping neurons during a network training process. The method supports the construction of a simpler deep neural networks with compatible performance with its simplified version. As a proof of concept, we evaluate the proposed method with examples including sparse linear regression, deep autoencoder and convolutional neural network. The valuations demonstrate excellent performance. The code for this work can be found in http://www.github.com/panweihit/DropNeuron
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Jun 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 3; 2025: 2; 2026: 2.
11 papers.
- 2026Topology and Geometry of the Learning Space of ReLU Networks: Connectivity and Singularitiescited by 6
- 2021On the Compression of Neural Networks Using ℓ0-Norm Regularization and Weight Pruningcited by 4
- 2025BLaST: High Performance Inference and Pretraining using BLock Sparse Transformerscited by 2
- 2022What to Prune and What Not to Prune at Initializationcited by 0
- 2022Training Lightweight Graph Convolutional Networks with Phase-field Modelscited by 0
- 2023One-Shot Multi-Rate Pruning of Graph Convolutional Networkscited by 0
- 2024On GNN explanability with activation rulescited by 0
- 2024Designing Semi-Structured Pruning of Graph Convolutional Networks for Skeleton-based Recognitioncited by 0
- 2024Learning Coarse-to-Fine Pruning of Graph Convolutional Networks for Skeleton-based Recognitioncited by 0
- 2025Downsized and Compromised?: Assessing the Faithfulness of Model Compressioncited by 0
- 2026Layerwise Decoupling for Stable Structured Sparsification of Fully Connected Layerscited by 0
- 2026Layerwise Decoupling for Stable Structured Sparsification of Fully Connected Layers17 Sep 2026
- 2026Topology and Geometry of the Learning Space of ReLU Networks: Connectivity and Singularities31 Jan 2026
- 2025Downsized and Compromised?: Assessing the Faithfulness of Model Compression7 Oct 2025
- 2025BLaST: High Performance Inference and Pretraining using BLock Sparse Transformers3 Jul 2025
- 2024Learning Coarse-to-Fine Pruning of Graph Convolutional Networks for Skeleton-based Recognition17 Dec 2024
- 2024Designing Semi-Structured Pruning of Graph Convolutional Networks for Skeleton-based Recognition16 Dec 2024
- 2024On GNN explanability with activation rules17 Jun 2024
- 2023One-Shot Multi-Rate Pruning of Graph Convolutional Networks29 Dec 2023
- 2022Training Lightweight Graph Convolutional Networks with Phase-field Models19 Dec 2022
- 2022What to Prune and What Not to Prune at Initialization6 Sep 2022
- 2021On the Compression of Neural Networks Using ℓ0-Norm Regularization and Weight Pruning10 Sep 2021