Effective Fine-Tuning with Eigenvector Centrality Based Pruning

• URL: http://arxiv.org/abs/2512.12543v1
• Date: Sun, 14 Dec 2025 04:27:50 GMT
• Title: Effective Fine-Tuning with Eigenvector Centrality Based Pruning
• Authors: Shaif Chowdhury, Soham Biren Katlariwala, Devleena Kashyap,
• Abstract summary: In social media networks a small number of highly influential users can drive large scale changes in discourse across multiple communities.<n>Small shifts in the behavior of these users are often sufficient to propagate widely throughout the network.<n>We propose a graph theory based method for pruning neural networks that is designed to improve fine tuning performance.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In social media networks a small number of highly influential users can drive large scale changes in discourse across multiple communities. Small shifts in the behavior of these users are often sufficient to propagate widely throughout the network. A similar phenomenon occurs during neural network fine tuning. Conventional fine tuning of convolutional neural networks typically adds a new linear classification layer on top of a large pre trained model. Instead we argue that improved adaptation can be achieved by first pruning the network to retain only the most important neurons and then performing fine tuning. We propose a graph theory based method for pruning neural networks that is designed to improve fine tuning performance. In this method each neuron is represented as a node and edges encode similarity between neurons. Neurons are pruned based on importance scores computed using eigenvector centrality. The resulting pruned network is then fine tuned using only the most central neurons. We evaluate the proposed method on VGGNet EfficientNet and ResNet models using the TF Flowers Caltech one zero one and Oxford Flowers one zero two datasets. The proposed approach achieves higher classification accuracy while significantly reducing model complexity. On the Oxford Flowers one zero two dataset the method achieves forty eight percent classification accuracy compared to thirty percent accuracy obtained by the baseline VGGNet model.

Related papers

• V-EfficientNets: Vector-Valued Efficiently Scaled Convolutional Neural Network Models [0.4143603294943439]
  V-EfficientNets is a novel extension of EfficientNet designed to process arbitrary vector-valued data.<n>The proposed models are evaluated on a medical image classification task, achieving an average accuracy of 99.46%.<n>V-EfficientNets demonstrate remarkable efficiency, significantly reducing parameters while outperforming state-of-the-art models.
  arXiv  Detail & Related papers  (2025-05-08T21:35:35Z)
• EntryPrune: Neural Network Feature Selection using First Impressions [18.19175363343452]
  EntryPrune is a novel supervised feature selection algorithm using a dense neural network with a dynamic sparse input layer.<n>It employs entry-based pruning, a novel approach that compares neurons based on their relative change induced when they have entered the network.
  arXiv  Detail & Related papers  (2024-10-03T09:56:39Z)
• Graph Neural Networks for Learning Equivariant Representations of Neural Networks [55.04145324152541]
  We propose to represent neural networks as computational graphs of parameters. Our approach enables a single model to encode neural computational graphs with diverse architectures. We showcase the effectiveness of our method on a wide range of tasks, including classification and editing of implicit neural representations.
  arXiv  Detail & Related papers  (2024-03-18T18:01:01Z)
• Using Cooperative Game Theory to Prune Neural Networks [7.3959659158152355]
  We show how solution concepts from cooperative game theory can be used to tackle the problem of pruning neural networks. We introduce a method called Game Theory Assisted Pruning (GTAP), which reduces the neural network's size while preserving its predictive accuracy.
  arXiv  Detail & Related papers  (2023-11-17T11:48:10Z)
• An Initialization Schema for Neuronal Networks on Tabular Data [0.9155684383461983]
  We show that a binomial neural network can be used effectively on tabular data. The proposed approach shows a simple but effective approach for initializing the first hidden layer in neural networks. We evaluate our approach on multiple public datasets and showcase the improved performance compared to other neural network-based approaches.
  arXiv  Detail & Related papers  (2023-11-07T13:52:35Z)
• Wide and Deep Neural Networks Achieve Optimality for Classification [23.738242876364865]
  We identify and construct an explicit set of neural network classifiers that achieve optimality. In particular, we provide explicit activation functions that can be used to construct networks that achieve optimality. Our results highlight the benefit of using deep networks for classification tasks, in contrast to regression tasks, where excessive depth is harmful.
  arXiv  Detail & Related papers  (2022-04-29T14:27:42Z)
• Neural Capacitance: A New Perspective of Neural Network Selection via Edge Dynamics [85.31710759801705]
  Current practice requires expensive computational costs in model training for performance prediction. We propose a novel framework for neural network selection by analyzing the governing dynamics over synaptic connections (edges) during training. Our framework is built on the fact that back-propagation during neural network training is equivalent to the dynamical evolution of synaptic connections.
  arXiv  Detail & Related papers  (2022-01-11T20:53:15Z)
• Neural Network Pruning Through Constrained Reinforcement Learning [3.2880869992413246]
  We propose a general methodology for pruning neural networks. Our proposed methodology can prune neural networks to respect pre-defined computational budgets. We prove the effectiveness of our approach via comparison with state-of-the-art methods on standard image classification datasets.
  arXiv  Detail & Related papers  (2021-10-16T11:57:38Z)
• Neural network relief: a pruning algorithm based on neural activity [47.57448823030151]
  We propose a simple importance-score metric that deactivates unimportant connections. We achieve comparable performance for LeNet architectures on MNIST. The algorithm is not designed to minimize FLOPs when considering current hardware and software implementations.
  arXiv  Detail & Related papers  (2021-09-22T15:33:49Z)
• To Boost or not to Boost: On the Limits of Boosted Neural Networks [67.67776094785363]
  Boosting is a method for learning an ensemble of classifiers. While boosting has been shown to be very effective for decision trees, its impact on neural networks has not been extensively studied. We find that a single neural network usually generalizes better than a boosted ensemble of smaller neural networks with the same total number of parameters.
  arXiv  Detail & Related papers  (2021-07-28T19:10:03Z)
• Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio [101.84651388520584]
  This paper presents a new framework named network adjustment, which considers network accuracy as a function of FLOPs. Experiments on standard image classification datasets and a wide range of base networks demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-04-06T15:51:00Z)
• Model Fusion via Optimal Transport [64.13185244219353]
  We present a layer-wise model fusion algorithm for neural networks. We show that this can successfully yield "one-shot" knowledge transfer between neural networks trained on heterogeneous non-i.i.d. data.
  arXiv  Detail & Related papers  (2019-10-12T22:07:15Z)
• Approximation and Non-parametric Estimation of ResNet-type Convolutional Neural Networks [52.972605601174955]
  We show a ResNet-type CNN can attain the minimax optimal error rates in important function classes. We derive approximation and estimation error rates of the aformentioned type of CNNs for the Barron and H"older classes.
  arXiv  Detail & Related papers  (2019-03-24T19:42:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.