paper-with-me

Papers

A Convex-optimization-based Layer-wise Post-training Pruner for Large Language Models

2024-08-07 · Pengxiang Zhao, Hanyu Hu, Ping Li, Yi Zheng, Zhefeng Wang, Xiaoming Yuan

Pruning is a critical strategy for compressing trained large language models (LLMs), aiming at substantial memory conservation and computational acceleration without compromising performance. However, existing pruning methods often necessitate inefficient retraining for billion-scale LLMs or rely on heuristic methods such as the optimal brain surgeon framework, which degrade performance. In this paper, we introduce FISTAPruner, the first post-training pruner based on convex optimization models and algorithms. Specifically, we propose a convex optimization model incorporating $\ell_1$ norm to induce sparsity and utilize the FISTA solver for optimization. FISTAPruner incorporates an intra-layer cumulative error correction mechanism and supports parallel pruning. We comprehensively evaluate FISTAPruner on models such as OPT, LLaMA, LLaMA-2, and LLaMA-3 with 125M to 70B parameters under unstructured and 2:4 semi-structured sparsity, demonstrating superior performance over existing state-of-the-art methods across various language benchmarks.

📄 PDF Abstract BibTeX arXiv:2408.03728

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Pruning 설명 없음
LLaMA LLaMA is a collection of foundation language models ranging from 7B to 65B parameters. It is based on the transformer architecture with various improvements that were…
OPT OPT is a suite of decoder-only pre-trained transformers ranging from 125M to 175B parameters. The model uses an AdamW optimizer and weight decay of 0.1. It follows a linear…

Similar Papers 제목 키워드 기반

Q-Rater: Non-Convex Optimization for Post-Training Uniform Quantization

2021-05-05 · Byeongwook Kim, Dongsoo Lee, Yeonju Ro, Yongkweon Jeon 외

Various post-training uniform quantization methods have usually been studied based on convex optimization. As a result, most previous ones rely on the quantization error minimization and/or quadratic approximations. Such…

Quantization

Convex Nonparanormal Regression

2020-04-21 · Yonatan Woodbridge, Gal Elidan, Ami Wiesel

Quantifying uncertainty in predictions or, more generally, estimating the posterior conditional distribution, is a core challenge in machine learning and statistics. We introduce Convex Nonparanormal Regression (CNR), a …

regression

QuantEase: Optimization-based Quantization for Language Models

2023-09-05 · Kayhan Behdin, Ayan Acharya, Aman Gupta, Qingquan Song 외

With the rising popularity of Large Language Models (LLMs), there has been an increasing interest in compression techniques that enable their efficient deployment. This study focuses on the Post-Training Quantization (PT…

GPUQuantization

Convex Regularization Behind Neural Reconstruction

2020-12-09 · ICLR 2021 1 · Arda Sahiner, Morteza Mardani, Batu Ozturkler, Mert Pilanci 외

Neural networks have shown tremendous potential for reconstructing high-resolution images in inverse problems. The non-convex and opaque nature of neural networks, however, hinders their utility in sensitive applications…

Denoising

Piecewise convexity of artificial neural networks

2016-07-17 · Blaine Rister, Daniel L. Rubin

Although artificial neural networks have shown great promise in applications including computer vision and speech recognition, there remains considerable practical and theoretical difficulty in optimizing their parameter…

global-optimizationspeech-recognitionSpeech Recognition