Saved in:
Bibliographic Details
Main Authors: Bazarbachi, Omar, Sun, Zijun, Shen, Yanning
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2508.09471
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909735693844480
author Bazarbachi, Omar
Sun, Zijun
Shen, Yanning
author_facet Bazarbachi, Omar
Sun, Zijun
Shen, Yanning
contents As Large Language Models (LLMs) become more widely adopted and scale up in size, the computational and memory challenges involved in deploying these massive foundation models have grown increasingly severe. This underscores the urgent need to develop more efficient model variants. Faced with this challenge, the present work introduces EGGS-PTP: an Expander-Graph Guided Structured Post-training Pruning method. The proposed approach leverages graph theory to guide the design of N:M structured pruning, effectively reducing model size and computational demands. By incorporating concepts from expander graphs, EGGS-PTP ensures information flow within the pruned network, preserving essential model functionality. Extensive numerical experiments demonstrate that EGGS-PTP not only achieves significant acceleration and memory savings due to structured sparsity but also outperforms existing structured pruning techniques in terms of accuracy across various LLMs.
format Preprint
id arxiv_https___arxiv_org_abs_2508_09471
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle EGGS-PTP: An Expander-Graph Guided Structured Post-training Pruning Method for Large Language Models
Bazarbachi, Omar
Sun, Zijun
Shen, Yanning
Machine Learning
As Large Language Models (LLMs) become more widely adopted and scale up in size, the computational and memory challenges involved in deploying these massive foundation models have grown increasingly severe. This underscores the urgent need to develop more efficient model variants. Faced with this challenge, the present work introduces EGGS-PTP: an Expander-Graph Guided Structured Post-training Pruning method. The proposed approach leverages graph theory to guide the design of N:M structured pruning, effectively reducing model size and computational demands. By incorporating concepts from expander graphs, EGGS-PTP ensures information flow within the pruned network, preserving essential model functionality. Extensive numerical experiments demonstrate that EGGS-PTP not only achieves significant acceleration and memory savings due to structured sparsity but also outperforms existing structured pruning techniques in terms of accuracy across various LLMs.
title EGGS-PTP: An Expander-Graph Guided Structured Post-training Pruning Method for Large Language Models
topic Machine Learning
url https://arxiv.org/abs/2508.09471