$\hat{I}¼$-MoE: Test-Time Pruning as Micro-Grained Mixture-of-Experts

Abstract

To tackle the huge computational demand of large foundation models, activation-aware compression techniques without retraining have been introduced. However, since these rely on calibration data, domain shift may arise for unknown downstream tasks. With a computationally efficient calibration, activation-aware pruning can be executed for every prompt adaptively, yet achieving reduced complexity at inference. We formulate it as a mixture of micro-experts, called $\hat{I}¼$-MoE. Several experiments demonstrate that $\hat{I}¼$-MoE can dynamically adapt to task/prompt-dependent structured sparsity on the fly.

10 pages, 4 figures