paper-with-me

Papers

S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training

2024-09-13 · Yuezhou Hu, Jun Zhu, Jianfei Chen

Training deep neural networks (DNNs) is costly. Fortunately, Nvidia Ampere and Hopper GPUs can accelerate matrix multiplications twice as fast as a dense equivalent by implementing 2:4 sparsity. However, previous STE-based 2:4 pre-training methods (e.g. STE with hard-thresholding, SR-STE) suffer from optimization difficulties because of discontinuous pruning function. In this study, we comprehensively analyse the bottleneck of traditional N:M sparse training and recognize three drawbacks with discontinuity: incorrect descending direction, inability to predict the amount of descent and sparse mask oscillation. In light of this, we propose S-STE, a simple yet powerful 2:4 training method that contains two parts: to continuously project weights to be 2:4 sparse, and to rescale sparse weights with a per-tensor fixed scaling factor. Besides, we adopt minimum-variance unbiased estimation for activation gradient and FP8 quantization for whole process. Results show that our method surpasses previous 2:4 pre-training recipes and is comparable even with full parameter models. Our toolkit is available at https://github.com/huyz2023/2by4-pretrain.

📄 PDF Abstract BibTeX arXiv:2409.09099

Code (2)

huyz2023/2by4-pretrain 공식 구현 pytorch
thu-ml/2by4-pretrain-acc-examples 공식 구현 pytorch

Tasks

Quantization

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations

2021-02-14 · ICLR 2021 1 · Rishabh Tiwari, Udbhav Bamba, Arnav Chavan, Deepak K. Gupta

Structured pruning methods are among the effective strategies for extracting small resource-efficient convolutional neural networks from their dense counterparts with minimal loss in accuracy. However, most existing meth…

Winning the Lottery with Continuous Sparsification

2019-12-10 · NeurIPS 2020 12 · Pedro Savarese, Hugo Silva, Michael Maire

The search for efficient, sparse deep neural network models is most prominently performed by pruning: training a dense, overparameterized network and removing parameters, usually via following a manually-crafted heuristi…

Network PruningTicket SearchTransfer Learning

Topology-Aware Revival for Efficient Sparse Training

2026-02-04 · Meiling Jin, Fei Wang, Xiaoyun Yuan, Chen Qian 외 arxiv

Static sparse training is a promising route to efficient learning by committing to a fixed mask pattern, yet the constrained structure reduces robustness. Early pruning decisions can lock the network into a brittle struc…

Reinforcement Learning

Sparse Flows: Pruning Continuous-depth Models

2021-06-24 · NeurIPS 2021 12 · Lucas Liebenwein, Ramin Hasani, Alexander Amini, Daniela Rus

Continuous deep learning architectures enable learning of flexible probabilistic models for predictive modeling as neural ordinary differential equations (ODEs), and for generative modeling as continuous normalizing flow…

Magnitude Attention-based Dynamic Pruning

2023-06-08 · Jihye Back, Namhyuk Ahn, Jangho Kim

Existing pruning methods utilize the importance of each weight based on specified criteria only when searching for a sparse structure but do not utilize it during training. In this work, we propose a novel approach - \te…

Efficient Exploration