paper-with-me

홈 › Papers

Learning Activation Functions for Sparse Neural Networks

2023-05-18 · Mohammad Loni, Aditya Mohan, Mehdi Asadi, Marius Lindauer

Sparse Neural Networks (SNNs) can potentially demonstrate similar performance to their dense counterparts while saving significant energy and memory at inference. However, the accuracy drop incurred by SNNs, especially at high pruning ratios, can be an issue in critical deployment conditions. While recent works mitigate this issue through sophisticated pruning techniques, we shift our focus to an overlooked factor: hyperparameters and activation functions. Our analyses have shown that the accuracy drop can additionally be attributed to (i) Using ReLU as the default choice for activation functions unanimously, and (ii) Fine-tuning SNNs with the same hyperparameters as dense counterparts. Thus, we focus on learning a novel way to tune activation functions for sparse networks and combining these with a separate hyperparameter optimization (HPO) regime for sparse networks. By conducting experiments on popular DNN models (LeNet-5, VGG-16, ResNet-18, and EfficientNet-B0) trained on MNIST, CIFAR-10, and ImageNet-16 datasets, we show that the novel combination of these two approaches, dubbed Sparse Activation Function Search, short: SAFS, results in up to 15.53%, 8.88%, and 6.33% absolute improvement in the accuracy for LeNet-5, VGG-16, and ResNet-18 over the default training protocols, especially at high pruning ratios. Our code can be found at https://github.com/automl/SAFS

📄 PDF Abstract BibTeX arXiv:2305.10964

Code (1)

automl/safs 공식 구현 pytorch

Tasks

AutoMLHyperparameter Optimization

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Efficient Reinforcement Learning by Reducing Forgetting with Elephant Activation Functions

2025-09-23 · Qingfeng Lan, Gautham Vasan, A. Rupam Mahmood arxiv

Catastrophic forgetting has remained a significant challenge for efficient reinforcement learning for decades (Ring 1994, Rivest and Precup 2003). While recent works have proposed effective methods to mitigate this issue…

Reinforcement Learning

ReLU$^2$ Wins: Discovering Efficient Activation Functions for Sparse LLMs

2024-02-06 · Zhengyan Zhang, Yixin Song, Guanghui Yu, Xu Han 외

Sparse computation offers a compelling solution for the inference of Large Language Models (LLMs) in low-resource scenarios by dynamically skipping the computation of inactive neurons. While traditional approaches focus …

Elephant Neural Networks: Born to Be a Continual Learner

2023-10-02 · Qingfeng Lan, A. Rupam Mahmood

Catastrophic forgetting remains a significant challenge to continual learning for decades. While recent works have proposed effective methods to mitigate this problem, they mainly focus on the algorithmic side. Meanwhile…

class-incremental learningClass Incremental LearningContinual LearningIncremental Learning+1

Sparsely Activated Networks: A new method for decomposing and compressing data

2019-10-30 · Paschalis Bizopoulos

Recent literature on unsupervised learning focused on designing structural priors with the aim of learning meaningful features, but without considering the description length of the representations. In this thesis, first…

Sparsely Activated Networks

2019-07-12 · Paschalis Bizopoulos, Dimitrios Koutsouris

Previous literature on unsupervised learning focused on designing structural priors with the aim of learning meaningful features. However, this was done without considering the description length of the learned represent…

Model Selection