Neural Network Pruning with Tukey-Kramer Multiple Comparison Procedure
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Simulation of weight prunning process in backpropagation neural network for pattern classification: A self-running threshold approach
- Pruning of basis functions in nonlinear approximators
- A deletion/substitution/addition algorithm for classification neural networks, with applications to biomedical data
- Efficient and sparse neural networks by pruning weights in a multiobjective learning approach
- Reducing the hidden units in neural networks by using least square method
- scientific article; zbMATH DE number 1728732 (Why is no real title available?)
- A pruning algorithm based on neural complexity
- Some methods for optimization of neural networks
- Pruning from Adaptive Regularization
- scientific article; zbMATH DE number 2013533 (Why is no real title available?)
- scientific article; zbMATH DE number 2070736 (Why is no real title available?)
- scientific article; zbMATH DE number 1876961 (Why is no real title available?)
- Sensitivity-informed provable pruning of neural networks
- Backward Elimination Methods for Associative Memory Network Pruning
- MW-OBS: An improved pruning method for topology design of neural networks
- Dynamic schedule for effective on-line connection pruning
This page was built for publication: Neural Network Pruning with Tukey-Kramer Multiple Comparison Procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542444)