Contact
Algeria - National academic platform
...
Prepare your scientific stay

Host laboratory · Invitation letter · Application guidance

Learn more

AI & Research · arXiv Machine Learning · publications

Freeze the Decoder, Heal the Encoder: Parameter-Efficient Adaptation for SVD-Based KV-Cache Compression

Source excerpt

This page presents AI and research content to help researchers, students and AI tools read, cite and verify the information.

arXiv:2610.10552v1 Announce Type: new Abstract: Comparing parameter-efficient fine-tuning recipes under a single, shared learning rate is a common but flawed practice: when the arms being compared have very different trainable-parameter counts, a shared rate can simultaneously depress the larger arms' means and inflate their variance, manufacturing a large, seemingly multi-seed-significant advantage for the smallest arm that is not a real effect. We document this confound in a concrete setting: post-hoc SVD-based KV-cache compression, where an already-pretrained model is converted to a low-rank (multi-head-latent-attention-style) cache by factorizing its key/value weights into a down-projection ("encoder") and an up-projection ("decoder"), after which a short fine-tune ("healing") recovers the accuracy lost to truncation. Under a shared learning rate, freezing the decoder and healing only the encoder looks like a clear win over healing the decoder or both factors; once every arm is given its own tuned learning rate, that apparent advantage disappears, and encoder-only healing instead reaches parity with the alternatives, at a real, measured saving of 3x fewer trainable parameters and 3x less optimizer-state memory. We verify this parity with per-arm learning-rate tuning and three seeds per configuration on a vision-language model (Qwen2.5-VL-3B-Instruct), at the one compression ratio this protocol covers, and replicate it on a text-only testbed across two backbones. Encoder-only healing is therefore a lower-memory drop-in recipe for retrofitting low-rank KV-cache compression at training time, and the shared-learning-rate pitfall we document and correct is a cautionary result for comparing any fine-tuning recipes whose arms differ in trainable-parameter count.

Your DzCademia workshop

Check a publication method or promise

A video or journal-finding tool can shortlist titles, not guarantee acceptance. Check identity, scope, author instructions and possible fees at official sources. Do not choose solely on speed promises or one indicator.

A practical exercise

Compare two journals against your research question: fit, article types, instructions and verified terms. Keep unknowns as questions rather than assumptions.

Record reference points
Topic
Freeze the Decoder, Heal the Encoder: Parameter-Efficient Adaptation for SVD-Based KV-Cache Compression
Source website
arxiv.org
Publication date at source
2026-10-09
Collection date on DzCademia
2026-10-09
My preparation plan

An indicative personal list, separate from official documents or requirements. Checkmarks stay on this device; no account needed.

0 / 5 steps checked

Read the source

DzCademia advice and exercises are separate from the source summary and requirements. This structured aid uses automated assistance and is neither scientific validation nor a selection promise. Source consulted on 2026-10-28.

intelligence artificielle projet recherche
View the original source

Official or original source: arXiv Machine Learning. Always check the details against the primary source.

Back to AI & Research
369
Listed events
1419974
Total visits
2680
Visits today