← Search

Jeff Pool

7 accepted papers

2024

MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models

NeurIPS 2024spotlight

Large Language Models (LLMs) are distinguished by their massive parameter counts, which typically result in significant redundancy. This work introduces MaskLLM, a learnable pruning method that establishes Semi-structured (or ``N:M'') Sparsity in LLMs, aimed at reducing computational overhead during…

2018

Efficient Sparse-Winograd Convolutional Neural Networks

ICLR 2018poster

Convolutional Neural Networks (CNNs) are computationally intensive, which limits their application on mobile devices. Their energy is dominated by the number of multiplies needed to perform the convolutions. Winograd’s minimal filtering algorithm (Lavin, 2015) and network pruning (Han et al., 2015)…

2018

Sparse Persistent RNNs: Squeezing Large Recurrent Networks On-Chip

ICLR 2018poster

Recurrent Neural Networks (RNNs) are powerful tools for solving sequence-based problems, but their efficacy and execution time are dependent on the size of the network. Following recent work in simplifying these networks with model pruning and a novel mapping of work onto GPUs, we design an efficie…

Cited by 39SourcePDFScholar
2017

DSD: Dense-Sparse-Dense Training for Deep Neural Networks

ICLR 2017poster

Modern deep neural networks have a large number of parameters, making them very hard to train. We propose DSD, a dense-sparse-dense training flow, for regularizing deep neural networks and achieving better optimization performance. In the first D (Dense) step, we train a dense network to learn conne…

Cited by 265SourcecodeScholar
2015

Learning both Weights and Connections for Efficient Neural Network

NeurIPS 2015poster

Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems. Also, conventional networks fix the architecture before training starts; as a result, training cannot improve the architecture. To address these limitations, we describe a me…

Cited by 8960SourcePDFScholar