paper-with-me

Papers

Using Topological Framework for the Design of Activation Function and Model Pruning in Deep Neural Networks

2021-09-03 · Yogesh Kochar, Sunil Kumar Vengalil, Neelam Sinha

Success of deep neural networks in diverse tasks across domains of computer vision, speech recognition and natural language processing, has necessitated understanding the dynamics of training process and also working of trained models. Two independent contributions of this paper are 1) Novel activation function for faster training convergence 2) Systematic pruning of filters of models trained irrespective of activation function. We analyze the topological transformation of the space of training samples as it gets transformed by each successive layer during training, by changing the activation function. The impact of changing activation function on the convergence during training is reported for the task of binary classification. A novel activation function aimed at faster convergence for classification tasks is proposed. Here, Betti numbers are used to quantify topological complexity of data. Results of experiments on popular synthetic binary classification datasets with large Betti numbers(>150) using MLPs are reported. Results show that the proposed activation function results in faster convergence requiring fewer epochs by a factor of 1.5 to 2, since Betti numbers reduce faster across layers with the proposed activation function. The proposed methodology was verified on benchmark image datasets: fashion MNIST, CIFAR-10 and cat-vs-dog images, using CNNs. Based on empirical results, we propose a novel method for pruning a trained model. The trained model was pruned by eliminating filters that transform data to a topological space with large Betti numbers. All filters with Betti numbers greater than 300 were removed from each layer without significant reduction in accuracy. This resulted in faster prediction time and reduced memory size of the model.

📄 PDF Abstract BibTeX arXiv:2109.01572

Code (0)

등록된 구현이 없습니다.

Tasks

Binary Classificationspeech-recognitionSpeech Recognition

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Alternating Gradient Flow Utility: A Unified Metric for Structural Pruning and Dynamic Routing in Deep Networks

2026-03-12 · Tianhao Qian, Zhuoxuan Li, Jinde Cao, Xinli Shi 외 arxiv

Efficient deep learning traditionally relies on static heuristics like weight magnitude or activation awareness (e.g., Wanda, RIA). While successful in unstructured settings, we observe a critical limitation when applyin…

Lightweight Graph Convolutional Networks with Topologically Consistent Magnitude Pruning

2022-03-25 · Hichem Sahbi

Graph convolution networks (GCNs) are currently mainstream in learning with irregular data. These models rely on message passing and attention mechanisms that capture context and node-to-node relationships. With multi-he…

Integral Pruning on Activations and Weights for Efficient Neural Networks

2019-05-01 · ICLR 2019 5 · Qing Yang, Wei Wen, Zuoguan Wang, Yiran Chen 외

With the rapidly scaling up of deep neural networks (DNNs), extensive research studies on network model compression such as weight pruning have been performed for efficient deployment. This work aims to advance the compr…

Model Compression

U-CAN: Utility-Aware Contrastive Attenuation for Efficient Unlearning in Generative Recommendation

2026-02-26 · Zezheng Wu, Rui Wang, Xinghe Cheng, Yang Shao 외 arxiv

Generative Recommendation (GenRec) typically leverages Large Language Models (LLMs) to redefine personalization as an instruction-driven sequence generation task. However, fine-tuning on user logs inadvertently encodes s…

Computational Efficiency

Miniaturized Graph Convolutional Networks with Topologically Consistent Pruning

2023-06-30 · Hichem Sahbi

Magnitude pruning is one of the mainstream methods in lightweight architecture design whose goal is to extract subnetworks with the largest weight connections. This method is known to be successful, but under very high p…

Action RecognitionSkeleton Based Action Recognition