English
Related papers

Related papers: TSENOR: Highly-Efficient Algorithm for Finding Tra…

200 papers

Unstructured pruning reduces the memory footprint in deep neural networks (DNNs). Recently, researchers proposed different types of structural pruning intending to reduce also the computation complexity. In this work, we first suggest a new…

Artificial Intelligence · Computer Science 2021-10-22 Itay Hubara , Brian Chmiel , Moshe Island , Ron Banner , Seffi Naor , Daniel Soudry

Sparsity has become one of the promising methods to compress and accelerate Deep Neural Networks (DNNs). Among different categories of sparsity, structured sparsity has gained more attention due to its efficient execution on modern…

Machine Learning · Computer Science 2022-09-19 Sheng-Chun Kao , Amir Yazdanbakhsh , Suvinay Subramanian , Shivani Agrawal , Utku Evci , Tushar Krishna

Deep learning demonstrates effectiveness across a wide range of tasks. However, the dense and over-parameterized nature of these models results in significant resource consumption during deployment. In response to this issue, weight…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-05 Cong Ma , Du Wu , Zhelang Deng , Jiang Chen , Xiaowen Huang , Jintao Meng , Wenxi Zhu , Bingqiang Wang , Amelie Chi Zhou , Peng Chen , Minwen Deng , Yanjie Wei , Shengzhong Feng , Yi Pan

N:M sparsity pruning is a powerful technique for compressing deep neural networks, utilizing NVIDIA's Sparse Tensor Core technology. This method benefits from hardware support for sparse indexing, enabling the adoption of fine-grained…

Machine Learning · Computer Science 2024-07-31 Seungmin Yu , Xiaodie Yi , Hayun Lee , Dongkun Shin

The resource requirements of neural networks can be significantly reduced through pruning - the removal of seemingly less important parameters. However, for LLMs, full retraining to recover pruning-induced performance degradation is often…

Machine Learning · Computer Science 2026-02-03 Max Zimmer , Christophe Roux , Moritz Wagner , Deborah Hendrych , Sebastian Pokutta

To date, 2:4 sparsity has stood as the only sparse pattern that can be accelerated using sparse tensor cores on GPUs. In practice, 2:4 sparsity often possesses low actual speedups ($\leq 1.3$) and requires fixed sparse ratios, meaning that…

Machine Learning · Computer Science 2025-06-04 Kang Zhao , Tao Yuan , Han Bao , Zhenfeng Su , Chang Gao , Zhaofeng Sun , Zichen Liang , Liping Jing , Jianfei Chen

Traditional pruning methods are known to be challenging to work in Large Language Models (LLMs) for Generative AI because of their unaffordable training process and large computational demands. For the first time, we introduce the…

Machine Learning · Computer Science 2024-03-25 Yun Li , Lin Niu , Xipeng Zhang , Kai Liu , Jianchen Zhu , Zhanhui Kang

In deep learning, fine-grained N:M sparsity reduces the data footprint and bandwidth of a General Matrix multiply (GEMM) up to x2, and doubles throughput by skipping computation of zero values. So far, it was mainly only used to prune…

Machine Learning · Computer Science 2024-06-11 Brian Chmiel , Itay Hubara , Ron Banner , Daniel Soudry

The Transformer has been an indispensable staple in deep learning. However, for real-life applications, it is very challenging to deploy efficient Transformers due to immense parameters and operations of models. To relieve this burden,…

Hardware Architecture · Computer Science 2022-11-01 Chao Fang , Aojun Zhou , Zhongfeng Wang

Network pruning can reduce the computation cost of deep neural network (DNN) models. However, sparse models often produce randomly-distributed weights to maintain accuracy, leading to irregular computations. Consequently, unstructured…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-19 Cong Guo , Fengchen Xue , Jingwen Leng , Yuxian Qiu , Yue Guan , Weihao Cui , Quan Chen , Minyi Guo

In the era of large language models (LLMs), N:M sparsity has emerged as a structured compression technique critical for accelerating inference. While prior work has primarily focused on weight sparsity, it often suffers from significant…

Machine Learning · Computer Science 2025-08-05 Tai An , Ruwu Cai , Yanzhe Zhang , Yang Liu , Hao Chen , Pengcheng Xie , Sheng Chang , Yiwu Yao , Gongyi Wang

N:M structured pruning is essential for large language models (LLMs) because it can remove less important network weights and reduce the memory and computation requirements. Existing pruning methods mainly focus on designing metrics to…

Computation and Language · Computer Science 2025-03-17 Chi Xu , Gefei Zhang , Yantong Zhu , Luca Benini , Guosheng Hu , Yawei Li , Zhihong Zhang

Image restoration tasks have witnessed great performance improvement in recent years by developing large deep models. Despite the outstanding performance, the heavy computation demanded by the deep models has restricted the application of…

Computer Vision and Pattern Recognition · Computer Science 2024-10-10 Junghun Oh , Heewon Kim , Seungjun Nah , Cheeun Hong , Jonghyun Choi , Kyoung Mu Lee

It is widely acknowledged that large and sparse models have higher accuracy than small and dense models under the same model size constraints. This motivates us to train a large model and then remove its redundant neurons or weights by…

Computer Vision and Pattern Recognition · Computer Science 2024-01-12 Jianwei Li , Weizhi Gao , Qi Lei , Dongkuan Xu

The rapid scaling of large language models~(LLMs) has made inference efficiency a primary bottleneck in the practical deployment. To address this, semi-structured sparsity offers a promising solution by strategically retaining $N$ elements…

Machine Learning · Computer Science 2026-05-14 Yan Sun , Qixin Zhang , Zhiyuan Yu , Xikun Zhang , Li Shen , Dacheng Tao

Network pruning can reduce the high computation cost of deep neural network (DNN) models. However, to maintain their accuracies, sparse models often carry randomly-distributed weights, leading to irregular computations. Consequently, sparse…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-01 Cong Guo , Bo Yang Hsueh , Jingwen Leng , Yuxian Qiu , Yue Guan , Zehuan Wang , Xiaoying Jia , Xipeng Li , Minyi Guo , Yuhao Zhu

$N{:}M$ sparsity is an emerging model compression method supported by more and more accelerators to speed up sparse matrix multiplication in deep neural networks. Most existing $N{:}M$ sparsity methods compress neural networks with a…

Computer Vision and Pattern Recognition · Computer Science 2024-09-17 Ning-Chi Huang , Chi-Chih Chang , Wei-Cheng Lin , Endri Taka , Diana Marculescu , Kai-Chiang Wu

Convolutional neural networks (CNNs) are reported to be overparametrized. The search for optimal (minimal) and sufficient architecture is an NP-hard problem as the hyperparameter space for possible network configurations is vast. Here, we…

Computer Vision and Pattern Recognition · Computer Science 2024-04-09 Tin Barisin , Illia Horenko

Model pruning seeks to induce sparsity in a deep neural network's various connection matrices, thereby reducing the number of nonzero-valued parameters in the model. Recent reports (Han et al., 2015; Narang et al., 2017) prune deep networks…

Machine Learning · Statistics 2017-11-15 Michael Zhu , Suyog Gupta

Recurrent Neural Networks (RNN) are widely used to solve a variety of problems and as the quantity of data and the amount of available compute have increased, so have model sizes. The number of parameters in recent state-of-the-art networks…

Machine Learning · Computer Science 2017-11-08 Sharan Narang , Erich Elsen , Gregory Diamos , Shubho Sengupta
‹ Prev 1 2 3 10 Next ›