Extending compression-based memorization analysis to the frozen-base setting, this work measures directly, in bits, how much a low-rank adapter writes into a model it never changes, finding that the answer is both smaller than full fine-tuning and less lawful than parameter counting would predict.
Abstract
A LoRA adapter is a few megabytes that almost everyone treats as a skill rather than a record of the data behind it. We put that assumption on a scale. Extending compression-based memorization analysis to the frozen-base setting, we measure directly, in bits, how much a low-rank adapter writes into a model it never changes. The answer is both smaller than full fine-tuning and less lawful than parameter counting would predict. Adapters store a couple of bits per trainable parameter, well short of a full model's budget, but that figure turns less on how many parameters an adapter carries than on where they sit. Move the same parameter budget from attention into the MLP and it holds nearly twice as much; strip the frozen base of its structure and the capacity all but disappears. Applied to realistic fine-tunes of Qwen2.5, the same instrument shows privacy leakage rising with the bits an adapter writes rather than the parameters it nominally has, and it draws a clean line between supervised and reinforcement learning: the secrets that supervised fine-tuning copies down verbatim, an adapter trained on verifiable rewards never records. Measuring what fine-tuning writes, rather than attacking it after the fact, turns a piece of folklore into a quantity one can design against.
The results suggest that bitsandbytes 4-bit quantization can impose an additional cost on applications relying on long, updatable, semantically dense contexts, even when aggregate benchmark accuracy appears largely unaffected.
This work sweeps a 64-shape matrix of LLM primitives that varies how a computation is expressed while holding what it computes fixed, recording per-operation device support and finds that placement is a property of how a computation is expressed, not of what it computes.
This study looks at how confidence patterns shift when cutting data precision to 4 bits using NF4, applied post-training on Phi-3.5-Mini-Instruct, a small-scale language model packing 3.8 billion parameters. Shrinking precision cuts down memory demands while speeding up output creation; however, what remains unclear is...
Gupta Iddhant· Indian Journal of Computer S...· 0 citations
SPECTRA is developed, a training-free, drop-in codec that re-encodes the cache into a coordinate system and concentrates the bit budget on the channels that carry the signal, pushing usable compression past the 2-bit cliff so the same GPU holds longer contexts and larger batches.
Jiamu Zhang, Liang Wu, Kelly Wan et al.· 1 citation
Scale-QLoRA and merge-aware QAT-LoRA are both accuracy-lossless, so they claim no accuracy ordering between them; they differ structurally, in that QAT-LoRA re-derives the code plane through a quantizer while Scale-QLoRA preserves it exactly.
Tung-Ling Li, Jia-Le Huang, Lee-Chi Wang et al.· 1 citation
The main result concerns the plain-load path: attained LDG bandwidth peaks at a small offered per-thread load (K ~ 2) and then declines, by about 35% from K=2 to K=8 at the authors' primary configuration.
S. Manjunath, Rahul Ramachandra· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 23, 2026
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.