Sign inGet started
Paper · arXiv

Sequential Functional Structured Tucker Compression for Large Language Model Attentions

Post-training compression of LLM attention is often formulated as independent matrix approximation, ignoring both the shared structure among attention projections and the representation shift introduced by earlier compression. We propose FTC, a sequential structured compression framework that adapts the approximation to the current compressed model while jointly exploiting the native Q/K/V head structure under a fixed storage budget. The output projection is handled separately to account for the changed post-attention representation. FTC requires neither fine-tuning nor gradient-based recovery. Across seven decoder-only LLMs from 6B to 32B parameters, FTC achieves the lowest WikiText-2 pe...

AuthorsJiangfeng Chen, Xinyu Wang, Tianshuo Yan et al.
Primary categorycs.CL
Published30 September 2026
Last updated at source30 September 2026
cs.CLcs.AIstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/9401ee14-e6f8-40a9-a1b6-d4969fd45420" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.