arXiv Machine Learning

SliMOO: Interpretable Multi-Objective Evolutionary Search for LLM Depth Pruning

arXiv Computation and Language
Aug 31

Pruning Laws for Large Language Models

arXiv:2504.04342v2 Announce Type: replace Abstract: Scaling up model parameters and training data consistently improves the performance of large language models (LLMs), but at the cost of rapidly gro...

By Ayan Sengupta, Siddhant Chaudhary, Tanmoy Chakraborty
arXiv Computation and Language
2d ago

Modality-Aware Expert Pruning for MoE-Based Multimodal Large Language Models

The paper introduces Modality-Aware Expert Pruning (MAEP), a training‑free method that decomposes expert importance by modality in a single forward pass for Mixture‑of‑Experts multimodal large language models. MAEP uses a Delta‑H Output metric to measure the impact of removing an expert and leverages low‑attention vision tokens as a stable pruning signal, while preserving text‑side importance. Experiments on three MoE‑based MLLMs show that MAEP reduces the BF16 expert weight footprint by about 27 GB (≈47% of total memory), enabling a 58 GB model to fit on a single 40 GB GPU and outperforming modality‑agnostic baselines on most multimodal benchmarks.

By Donggeun Kim
arXiv AI
Sep 17

Higher-order pruning of experts in mixture-of-experts language models

The paper introduces HOPE, a second‑order pruning method for Mixture‑of‑Experts language models that accounts for cooperative interactions between experts. Unlike first‑order methods such as REAP, HOPE derives an objective that provably bounds pruning error and is shown to outperform baselines across three large MoE models, multiple calibration sets, and diverse benchmarks, especially at high pruning rates and on agentic tasks. The results demonstrate that preserving expert interactions allows aggressive compression with minimal performance loss on complex workloads.

By Alex M. Tseng, Prannay Kaul, Luca Zancato, Wei Xia, Stefano Soatto
arXiv Machine Learning
Oct 15

Your Transformer Is Secretly Elastic

The paper presents a retraining‑free technique that transforms pre‑trained transformers into elastic models capable of adapting to any computational budget on the fly. By jointly ranking every MLP neuron and attention head on a common scale and applying soft pruning across multiple sparsity targets, the method achieves smooth performance degradation up to 60% sparsity while outperforming one‑shot baselines. Experiments on 27 vision and text transformer encoders show significant parameter reductions with minimal accuracy loss and notable throughput and latency gains on GPUs, all produced in minutes.

By Walter Simoncini, Dheeraj Varghese, Gertjan J. Burghouts, Cees G. M. Snoek