Sign inGet started
Paper · arXiv

Rank Measures of Fine-Tuning Updates Need a Noise Baseline

Studies of what fine-tuning does to a language model often summarise the weight update $ΔW$ by its rank. We compare the rank measures used for this against the same measures on a random matrix of the same shape, and against two harder references: the pretrained weights, and matched fine-tunes without alignment content. Measures that count directions put our fine-tuning updates only a little below noise; stable rank, computed from the same singular values, puts them far below. Both are right: an update has a few strong directions on top of a long tail. The pattern holds for thirteen released pairs up to 8B parameters, and it is not a mark of alignment: with training held fixed, instruction...

AuthorsMuhammad Usman Altaf
Primary categorycs.LG
Published15 October 2026
Last updated at source15 October 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/9c957d71-4e9f-4752-95d2-dcdefd2e71d0" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 6 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

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