LaMoC improves joint compression by selecting compression statistics that better align local module reconstruction error with the downstream loss, and reformulate joint modular compression as a two-tiered optimization problem that minimizes module reconstruction error while tuning the activation and gradient information blending rate.
Abstract
Modular compression has enabled considerable parameter reduction in LLMs while preserving strong language understanding and downstream task accuracy. However, existing joint modular compression methods primarily rely on activation statistics, leaving loss-sensitivity information and its module-level characterization underexplored. We investigate addressing this gap with LaMoC, a loss-aware modular compression methodology that blends activation and Empirical Fisher statistics through gradient-error alignment. LaMoC improves joint compression by selecting compression statistics that better align local module reconstruction error with the downstream loss. Our contributions are three-fold: (1) We characterize the Empirical Fisher as a module-level loss-aware proxy that can be blended with the activation statistics required for compression. (2) We reformulate joint modular compression as a two-tiered optimization problem that minimizes module reconstruction error while tuning the activation and gradient information blending rate. (3) We implement an empirically driven methodology with statistical validation to solve the resulting compression problem. We evaluate LaMoC across four model families spanning eight models. On the 4-8B models, LaMoC achieves an average 2.5% reduction in perplexity and a 1% relative improvement in task accuracy over state-of-the-art modular compression methods.
This work argues that retraining-free compression should be paired with small post-compression adjustment to recover a substantial portion of the performance lost during compression, and suggests that retraining-free compression should be paired with small post-compression adjustment to recover a substantial portion of...
The results reveal non-trivial interactions among compression methods: composable compression cannot be predicted from standalone techniques, compression rate alone does not reliably predict quality loss or runtime gain, expert pruning is the dominant degradation source, and average quality can hide workload and archit...
A. Benazir, Chen Chen, Rongxiao Qu et al.· 0 citations
Six submissions under the team name ESTS to the unconstrained WMT26 Model Compression Shared Task for English--Simplified Chinese and English--Egyptian Arabic are described, describing how they use task-specific routing mass to rank experts and cross-lingual routing divergence to allocate retained capacity across layer...
Liu O. Martin, Lucas Bandarkar, Nanyun Peng· 0 citations
State-of-the-art log compressors typically rely on a decoupled “parse-then-compress” workflow, where parsing is optimized for semantic accuracy (i.e., event identification) rather than storage efficiency. Through a comprehensive empirical study, we reveal that this architectural decoupling prevents the exploitation of...
Yang Liu, Kai-Ming Zhang, Zhuang-Bin Chen et al.· Proceedings of the ACM on So...· 0 citations
This work investigates lightweight BF16 weight compression schemes tailored for PIM-based LLM inference by focusing on exponent-oriented compression methods that exploit the locality and redundancy present in BF16 exponent fields.
Sabiha Tajdari, Akhil Shekar, Kevin Skadron et al.· 0 citations
LLM compression reduces inference costs and memory requirements, but selecting a method and configuration remains largely empirical because comparable resource reductions can produce different capability losses. We systematically investigate capability scaling-down laws for LLM compression across pruning, quantization,...
Xue-Qi Cheng, Liang Wu, Kelly Wan et al.· 0 citations