Effective Fine-Tuning with Eigenvector Centrality Based Pruning
Shaif Chowdhury, Soham Biren Katlariwala, and Devleena Kashyap

TL;DR
This paper introduces a graph theory-based pruning method using eigenvector centrality to improve neural network fine-tuning, resulting in higher accuracy and reduced complexity across multiple models and datasets.
Contribution
It proposes a novel eigenvector centrality-based pruning technique that enhances fine-tuning performance by focusing on the most influential neurons.
Findings
Achieves higher classification accuracy than baseline models.
Reduces model complexity significantly.
Demonstrates effectiveness across various neural network architectures.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Mental Health via Writing
