Omega-S: A Functional Resilience Index for LLM Fine-Tuning
Abstract
Omega-S is a lightweight, data-free regularization penalty for low-rank fine-tuning that improves retention of original model capabilities by penalizing variance in weight-matrix node degrees.
Fine-tuning a large language model on new data degrades what it previously learned. We present Omega-S, a drop-in penalty computed from the weight matrix alone: it needs no previous-task data, no Fisher matrix and no stored copy of the old weights. It is three lines in an existing training loop and adds under 4% to the cost of a step. Retention. On Llama-3-8B with LoRA, fine-tuned from code to prose and measured by HumanEval over ten seeds, Omega-S retains more of the original capability than no regularisation on 9 of 10 seeds (0.173 -> 0.238 absolute pass@1; sign test one-sided p=0.011, Wilcoxon p=0.006), as a retention ratio, 62.9% -> 84.1%. It also beats tuned weight decay on 10 of 10 seeds (p=0.002) and tuned EWC on 8 of 10 (p=0.014), every arm re-measured in the same session. Mechanism, measured rather than asserted. Omega-S is topological by construction, its objective built from Tr(A^3), but we measured which of its four factors actually moves and three do not: their elasticity with respect to the weights is at or below 1e-4, against 9e-3 for the degree-variance term. As implemented, the composite reduces to a penalty on the variance of node degrees, which means row magnitude in square modules and directional alignment in non-square ones. We report this because a method whose name promises one thing and whose gradient does another should say so. We also enumerate the open design choices, including a contrast-preserving construction that does what it was designed to do and makes retention worse on all ten seeds. Repeating an identical configuration, same seed and same hardware, gives a standard deviation of 0.104 in retention ratio. We have not found this quantified for low-rank fine-tuning of language models, and it bounds every seed-paired comparison in this literature, ours included. Code, per-seed results and the full record of negative results are available.
Community
Fine-tuning degrades what a model already knew. Omega-S is a drop-in penalty computed from the weight matrix alone: no previous-task data, no Fisher matrix, no stored copy of the old weights, three lines in the training loop, under 4% added cost per step.
On Llama-3-8B with LoRA, code to prose, HumanEval over ten seeds: 84.1% retention against 62.9% unregularised, ahead on 9 of 10 seeds, 10 of 10 against tuned weight decay, 8 of 10 against tuned EWC.
The mechanism section reports what we measured rather than what the name promises. Three of the four factors in the index are numerically inert at this scale; as implemented it reduces to a penalty on the variance of node degrees. The repository ships the per-seed data, the script to check that on your own model.
Does the retention benefit hold when the fine-tuning data sits close to the base distribution? Code->prose is a clean domain shift, so forgetting is easy to measure — the distributions barely overlap. But most real fine-tuning is on data that overlaps heavily with what the model already knows: chat formatting, tool-call syntax, domain Q&A. That's where forgetting is subtler, and that's where I'd want to see Omega-S actually track it before I trust it.
Same question for the method itself — does this work with full fine-tuning or only LoRA? If the index only holds up under parameter-efficient training, that changes how I'd use it. Either way, I'm not adding a penalty to my loop on the strength of a cross-domain result alone. Show me the close-domain numbers first.
Both are the right questions, and I have measured answers to one of them and an honest "not tested" to the other.
Where the result does hold: Llama-3-8B, LoRA, code then prose, ten seeds. 84.1% retention against 62.9% for no regularizer, winning 9/10 seeds against none, 10/10 against weight decay and 8/10 against EWC, at under 4% added cost per step. That is the claim, and it is bounded by exactly the two things you are asking about.
Full fine-tuning: I ran it, and Omega-S does nothing there. A 0.3B model, full FT, one task pair: no regularizer gives a +5.01% code-loss increase, Omega gives +4.99% applied at every step. I swept the strength across four targets in case the schedule was starving it, and it never helps at any point. I re-ran with the published orientation of the M term in case that was the issue. Run-to-run noise on that harness is about 0.3 points, so the entire sweep sits inside or barely above it. L2-SP on the same runs roughly halves the forgetting without costing anything in prose loss. So the effect looks LoRA-specific, and I would not extrapolate the paper past that. One seed and one model size, so treat it as a boundary marker rather than a law.
That second point deserves more than a footnote, so here it is up front: L2-SP is not in the paper's baselines and it should have been. I ran it as a seventh arm on the published setup with the same ten seeds. It comes out at least on par with Omega-S: 6-3 with one tie in paired wins, sign test p=0.25, Wilcoxon p=0.049, so the two tests disagree and I am not claiming a separation in either direction. Per-seed data is in results/controls_20260808.json in the repo. The one axis where they do differ: Omega-S finishes task A with slightly more capability than no regularizer at all (0.3049 vs 0.2848, 7/10 seeds) while L2-SP is flat there. Neither contrast is significant alone, but the contrast between them is what you would expect from a method that restricts displacement versus one that constrains the shape of the solution without anchoring to any reference point. That, rather than raw retention, is the honest differentiator, and it is also why Omega-S needs no task boundary and no stored copy of the previous weights.
Close-to-base-distribution data: not tested. The measured mechanism is degree-variance reduction on the weight graph, which has no dependence on how far the fine-tuning data sits from the base distribution, so the naive prediction is that it behaves the same. But that is a prediction from a mechanism, not a measurement, and the paper reports that three of the four factors in the index are inert in this construction, so I am not going to lean on it. Chat formatting and tool-call syntax are the right test.
So I think your stopping rule is correct. One task pair, one architecture, LoRA only, and a baseline that belongs in the table and was published separately rather than in the paper. If you do run it on a close-domain pair, I would like to see the numbers whichever way they land, and a negative is genuinely more useful to me than a confirmation. The license carries an evaluation exception, so measuring costs you nothing there.
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- Super-Tuning: From Activation-Aware Pruning to Sparse Fine-Tuning (2026)
- Fora: From Weight-Space to Function-Space Protection in Capability-Preserving Fine-Tuning (2026)
- Predicting Mergeability of Parameter-Efficient Fine-Tuning Updates (2026)
- VarRate: Training-Free Variable-Rate KV Cache Compression for Long-Context LLMs (2026)
- Learning Only What Valid Adapters Can Express: Subspace-Constrained Adaptation Against Fine-Tuning Poisoning (2026)
- One QK Channel, Many Sources: Guarding Low-Precision Attention Collapse (2026)
- Skin-Deep: A Geometric Diagnostic for Alignment Fragility in Large Language Model Representations (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Get this paper in your agent:
hf papers read 2608.03887 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper