Spectral Complex Autoencoder Pruning: A Fidelity-Guided Criterion for Extreme Structured Channel Compression
Not on the map. Why?
Abstract (arXiv)
We propose Spectral Complex Autoencoder Pruning (SCAP), a reconstruction-based criterion that measures functional redundancy at the level of individual output channels. For each convolutional layer, we construct a complex interaction field by pairing the full multi-channel input activation as the real part with a single output-channel activation (spatially aligned and broadcast across input channels) as the imaginary part. We transform this complex field to the frequency domain and train a low-capacity autoencoder to reconstruct normalized spectra. Channels whose spectra are reconstructed with high fidelity are interpreted as lying close to a low-dimensional manifold captured by the autoencoder and are therefore more compressible; conversely, channels with low fidelity are retained as they encode information that cannot be compactly represented by the learned manifold. This yields an importance score (optionally fused with the filter L1 norm) that supports simple threshold-based pruning and produces a structurally consistent pruned network. On VGG16 trained on CIFAR-10, at a fixed threshold of 0.6, we obtain 90.11% FLOP reduction and 96.30% parameter reduction with an absolute Top-1 accuracy drop of 1.67% from a 93.44% baseline after fine-tuning, demonstrating that spectral reconstruction fidelity of complex interaction fields is an effective proxy for channel-level redundancy under aggressive compression.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 51 of its 72 references that are in the map. First posted on arXiv 14 Jan 2026.
Builds on
51 of 72 references.
References · 51
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2014FitNets: Hints for Thin Deep Netscited by 1,619
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
38 more
- 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
- 2016Deep Variational Information Bottleneckcited by 915
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2020What is the State of Neural Network Pruning?cited by 578
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018Insights on representational similarity in neural networks with canonical correlationcited by 318
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 298
- 2015Unitary Evolution Recurrent Neural Networkscited by 291
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
- 2017Deep Complex Networkscited by 215
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 199
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2018NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applicationscited by 146
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2013Fast Training of Convolutional Networks through FFTscited by 89
- 2015Spectral Representations for Convolutional Neural Networkscited by 79
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2021Fire Together Wire Together: A Dynamic Pruning Approach with Self-Supervised Mask Predictioncited by 24
- 2019COP: Customized Deep Model Compression via Regularized Correlation-Based Filter-Level Pruningcited by 14
- 2023Differentiable Transportation Pruningcited by 10
- 2024An Effective Information Theoretic Framework for Channel Pruningcited by 7
50 most cited of 51 All 51 (JSON)
Built on by
Not cited yet.