A new paper says it knows why this happens. It also offers a fix. Then its own table shows the fix removes about a quarter of the damage.
Scroll. By slide 7 you will see exactly where the damage goes.
A big model first learns from a huge pile of text. Then a company trains it again on one small job, like answering support tickets or solving math.
After that second round, the model is often worse at things it used to do well. The paper calls this Pervasive Capability Degradation. We will say forgetting.
Top bar: before the second round. Bottom bar: after.
But a model has no shelf where old facts sit. So what exactly gets erased?
It knows far more ideas than it has room for. To make them fit, it stores each idea as a direction, like a spoke on a wheel.
Ideas that rarely show up together can share space. So the spokes sit almost at right angles, and barely disturb each other.
The paper borrows a name for this packing: superposition.

In the original training, ideas show up one at a time. In a narrow job, the same few ideas show up together, every time.
The paper's theory says the model then merges them into one spoke. That saves room. Watch it happen.
Theory, borrowed from toy models. Not measured directly in this paper.Now there are fewer spokes, and they are no longer at right angles. Ask about idea A, and idea B lights up a little too.
The paper calls this a ghost signal. It is faint, but it keeps travelling through the layers that follow.
At the end, the model turns its inner state into one next word. Picture that state as a dot on a map. Each word owns a patch of the map.
Whichever patch holds the dot is the word the model says. A leak nudges the dot. Nudge it across a border and the answer changes.
Simplified map. The paper uses a weighted version of the same idea, called a Laguerre-Voronoi diagram.
Or drag the dot yourself.


The authors trained a model (Mistral-7B) on a task whose answers are the words yes and no. Then they tested it on ordinary text from the original training mix.
With plain training, the end-of-text mark newly lost to "yes" or "no" in 10,457 comparisons.
Source: Table I1 and text, arXiv 2611.05003. Bar length is scaled to the largest bar.
That is how many newly flipped comparisons the fix removes, compared with plain training. It was measured on one 7B model (Qwen2.5-7B) after training on three different jobs.
Source: Table 5, arXiv 2611.05003. Cuts vs plain training: 24.4%, 33.4%, 29.4%. The paper's own headline compares against the average of six methods: 25.7%, 35.4%, 29.9%. I recomputed all of them.
On the RTE job, 5.700 million new flips drop to 4.309 million. That leaves about 76 in every 100.
The abstract talks about "fully resolving" the problem. Table 5 does not show that.
Context: the base model, before any training, already has 18.569 million flipped comparisons. Packing ideas tightly always leaks a bit.
24 squares removed by the fix. 76 remain. Each square stands for 1 in 100 of plain training's new flips on RTE.
Memory barely moves: 3,458 GiB against 3,430 GiB on the 72B model. Compute holds steady at about 1.27 times.
Time is less tidy. The smallest model needs 21.1 GPU hours against 10.2, which is 2.07 times.
Source: Table 4, arXiv 2611.05003. The "plain" run here already includes the extra anchor data, so the true add-on cost is measured against a baseline that has paid for it. The fix also needs a one-time pass over the base model first.
If you tune a model for one job, test it on jobs you did not train for. Then look at which words it now says too often. After a yes and no job, this model reached for yes and no everywhere.
Whether this particular fix is the best one will take other labs a few months to settle. The leak itself you can check this afternoon.