Concurrent training and layer pruning of deep neural networks

We propose an algorithm capable of identifying and eliminating irrelevant layers of a neural network during the early stages of training. In contrast to weight or filter-level pruning, layer pruning reduces the harder to parallelize sequential computation of a neural network. We employ a structure using linear residual connections around nonlinear network sections that allow the flow of information through the network once a nonlinear section is pruned. Our approach is based on variational inference principles using Gaussian scale mixture priors on the neural network weights and allows for substantial cost savings during both training and inference. More specifically, the variational posterior distribution of scalar Bernoulli random variables multiplying a whole layer weight matrix of its nonlinear sections is learned, similarly to adaptive layer-wise dropout. To overcome challenges of concurrent learning and pruning such as premature pruning and lack of robustness with respect to weight initialization or the size of the starting network, we adopt the “flattening” hyper-prior on the prior parameters. We prove that, as a result of the usage of this hyper-prior, the solutions of the resulting optimization problem always describe deterministic networks with parameters of the posterior distribution at either 0 or 1. We formulate a projected stochastic gradient descent algorithm and prove its convergence to such a solution using well-known stochastic approximation results. In particular, we establish and prove analytically conditions that lead to a layer’s weights converging to zero and derive practical pruning conditions from the theoretical results. The proposed algorithm is evaluated on the MNIST, CIFAR-10 and ImageNet datasets and the commonly used fully-connected, convolutional and residual architectures LeNet, VGG16 and ResNet. The simulations demonstrate that our method achieves state-of the-art performance for layer pruning at reduced computational cost in distinction to competing methods due to the concurrent training and pruning.

Authors

Institutions

Publication Details

Journal
Neurocomputing
Published
2026-09-01
DOI
https://doi.org/10.1016/j.neucom.2026.134989
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Concurrent training and layer pruning of deep neural networks

Valentin Frank Ingmar Guenter, Athanasios Sideris
Neurocomputing
Neural Networks and Applications
article

Concurrent training and layer pruning of deep neural networks

Valentin Frank Ingmar Guenter, Athanasios Sideris
article en

Abstract

We propose an algorithm capable of identifying and eliminating irrelevant layers of a neural network during the early stages of training. In contrast to weight or filter-level pruning, layer pruning reduces the harder to parallelize sequential computation of a neural network. We employ a structure using linear residual connections around nonlinear network sections that allow the flow of information through the network once a nonlinear section is pruned. Our approach is based on variational inference principles using Gaussian scale mixture priors on the neural network weights and allows for substantial cost savings during both training and inference. More specifically, the variational posterior distribution of scalar Bernoulli random variables multiplying a whole layer weight matrix of its nonlinear sections is learned, similarly to adaptive layer-wise dropout. To overcome challenges of concurrent learning and pruning such as premature pruning and lack of robustness with respect to weight initialization or the size of the starting network, we adopt the “flattening” hyper-prior on the prior parameters. We prove that, as a result of the usage of this hyper-prior, the solutions of the resulting optimization problem always describe deterministic networks with parameters of the posterior distribution at either 0 or 1. We formulate a projected stochastic gradient descent algorithm and prove its convergence to such a solution using well-known stochastic approximation results. In particular, we establish and prove analytically conditions that lead to a layer’s weights converging to zero and derive practical pruning conditions from the theoretical results. The proposed algorithm is evaluated on the MNIST, CIFAR-10 and ImageNet datasets and the commonly used fully-connected, convolutional and residual architectures LeNet, VGG16 and ResNet. The simulations demonstrate that our method achieves state-of the-art performance for layer pruning at reduced computational cost in distinction to competing methods due to the concurrent training and pruning.

Neurocomputing
University of California, Irvine (US), Irvine University (US)
University of Southern California, National and Kapodistrian University of Athens, University of California, Irvine
Openalex Percentile: Top 100%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.