Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruning
Not on the map. Why?
Abstract (arXiv)
Structured pruning is a model compression technique that is used to reduce the computational cost of deploying deep neural networks on resource-constrained devices. Popular methods of pruning rely on opaque heuristics or weight-based criteria that give no indication as to the structural dependencies in the network. To address these limitations we present Artificial Structure Function Search (ASF-S): a novel structured pruning framework. ASF-S utilizes Principle Gradient Importance (PGI): a novel prune-candidate selection criteria that is inspired by structure-function relationships in the brain. By ensuring the pruned structure of the model respects topographical organization of the output layer, we define Artificial Functional Connectivity (AFC) for artificial neural networks. AFC provides evidence to demonstrate that accurate smaller networks can be found using careful prune candidate selection criteria. We present results for PGI as a selection criterion and for ASF-S as a pruning framework against recent benchmarks, demonstrating that our method yields model variants with 70% parameter reduction, that can recover baseline accuracy without re-training the pruned layers.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 39 of its 78 references that are in the map. First posted on arXiv 21 Sep 2026.
Builds on
39 of 78 references.
References · 39
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2013Visualizing and Understanding Convolutional Networkscited by 2,278
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2024Visual Autoregressive Modeling: Scalable Image Generation via Next-Scale Predictioncited by 1,005
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2017Network Dissection: Quantifying Interpretability of Deep Visual Representationscited by 703
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
27 more
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2018Rethinking the Value of Network Pruningcited by 595
- 2020What is the State of Neural Network Pruning?cited by 578
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
- 2023The geometry of hidden representations of large transformer modelscited by 108
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2020Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficientcited by 81
- 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 43
- 2025SlimLLM: Accurate Structured Pruning for Large Language Modelscited by 18
- 2020NPAS: A Compiler-aware Framework of Unified Network Pruning and Architecture Search for Beyond Real-Time Mobile Accelerationcited by 16
- 2024Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Frameworkcited by 10
- 2023Probabilistic Modeling: Proving the Lottery Ticket Hypothesis in Spiking Neural Networkcited by 3
- 2025One Shot vs. Iterative: Rethinking Pruning Strategies for Model Compressioncited by 3
- 2018Diffusion Maps for Textual Network Embeddingcited by 2
- 2022Functional Network: A Novel Framework for Interpretability of Deep Neural Networkscited by 2
- 2024Functional connectomes of neural networkscited by 1
- 2025Structure-Aware Automatic Channel Pruning by Searching with Graph Embeddingcited by 1
Built on by
Not cited yet.