Stable but Wrong: When Learning Stabilizes Away from the Truth
Authors: Zhipeng Zhang
Organizations: China Mobile Research Institute, Beijing 100053, China · China Mobile GBA (Greater Bay Area) Innovation Institute, Guangzhou 510656, China
Stable training is often treated as evidence that learning is succeeding, but stability characterizes optimization behavior rather than correctness relative to an external objective. We study what happens when the signal being optimized remains persistently biased. We define Stable but Wrong (SBW) as a learning state in which the learning process remains stable under a task-appropriate operational criterion while the learned outcome remains systematically displaced from an independently defined objective. A minimal strongly convex model shows that a persistent bias in the update direction can shift the unique convergence point away from the true optimum. Controlled experiments in reinforcement learning, supervised learning, and continual fine-tuning of a large language model reveal a recurring separation between apparently normal optimization and correctness under static and feedback-coupled biases. Recovery-stage clean-data access and exploration interventions further show that subsequent trajectories can remain modifiable, although the interventions differ in protocol and do not imply a shared mechanism. The results expose a basic limit of optimization stability as a reliability signal in persistent and feedback-coupled learning systems.
Figures & tables
Figure 1: Stable but Wrong under acquisition bias in supervised learning. Controlled PadChest example in which sample selection creates perfect Cardiomegaly–AP and Normal–PA label–acquisition-domain collinearity. Images and AP/PA metadata are drawn from real clinical data; the perfect collinearity is experimentally constructed and does not represent the original PadChest distribution. Left, training-data construction; middle, training dynamics; right, counterfactual evaluation in which disease labels are retained while acquisition domains are exchanged.
Figure 2: Stable but Wrong in a controlled synthetic autonomous-discovery system. The Synthetic Discovery System does not use real A-Lab data or an experimental platform. The figure compares the learned belief of a Bayesian-optimization surrogate model with the known oracle landscape: after the belief stabilizes, the region identified as optimal remains displaced from the true global optimum.
Figure 3: Learning dynamics and correctness under persistent bias across learning paradigms. (a,b) Static and dynamic bias for PPO on Hopper-v4 (Bias Exposure =750 k steps). Red, true return; blue, a policy-update-magnitude proxy; shading, s.d. over five seeds. The update proxy indicates that policy updates continue without explicit divergence; it is not a proof of strict convergence. (c,d) Structural and prediction-dependent label bias for ResNet-18 on CIFAR-10 (epochs 30–79). Blue, training loss; red, clean target-class accuracy; shading, s.d. over five seeds. (e,f) Static and dynamic bias during continual fine-tuning of Qwen2.5-7B-Instruct on GSM8K. Blue, windowed training loss; red, Target final-answer accuracy; shading, s.d. over five seeds.
Figure 4: A recovery-stage clean-rollout protocol is associated with higher realized recovery. Within each Exposure/seed pair, Standard Recovery and clean-rollout Recovery start from the same corresponding bias-end checkpoint. Clean-rollout Recovery introduces a fresh clean-environment rollout every five PPO rollouts. The nominal Recovery training clock and PPO update loop are matched, but the clean-rollout condition requires additional clean-environment data collection. The vertical axis shows Recovery Score.
Figure 5: Exploration mitigates sampled-support contraction. Results from 20 paired random seeds in the Controlled Synthetic Autonomous Discovery System. Red circles show the exploitation-only baseline and blue squares the exploration intervention; solid lines show generation-wise means and shading denotes ±1 sample s.d. PR is an operational measure of effective sampled-support size in a fixed low-dimensional projection and does not directly measure future information accessibility. At generation 30, final PR was 8.61±6.31 under the intervention and 7.25±6.88 under the baseline. PR increased in 17 of 20 paired seeds; the mean paired difference was 1.36 (95% paired-bootstrap CI, 0.55 – 2.20 ; two-sided Wilcoxon signed-rank test, p=0.00315 ).
Figure 6: Offline replay comparison on the public CAMEO benchmark. The horizontal axis shows replay step and the vertical axis shows cumulative benchmark-target discoveries. Gray, fixed reference replay order; blue, exploration-protected replay. Both trajectories share the candidate pool and first 20 samples. Benchmark targets are used only for hindsight evaluation and do not participate in selection. The reference replay order does not represent the original experimental timeline.
Appendix figures & tables13 assets
Supplementary material from the paper’s appendix.
Appendix
Exposure length
Rclean
Rbefore
Relative decrease
Rafter
0.25M
3193±224
2046±230
35.9%
2958±548
0.50M
3193±224
1990±295
37.7%
2538±564
0.75M
3193±224
2250±698
29.6%
2677±427
1.00M
3193±224
1862±459
41.7%
2375±563
Appendix
Table 1: SBW-related evidence under static bias (reward shift c=−1.0 ) on Hopper-v4. Values are mean ± s.d. over five seeds.
Environment
p
Exposure 0.25M
Exposure 0.50M
Exposure 1.00M
Hopper
0.3
2868 ( 8.9% )
3191 ( −1.3% )
2496 ( 20.7% )
Hopper
0.5
1493 ( 52.6% )
1388 ( 55.9% )
494 ( 84.3% )
Hopper
0.7
336 ( 89.3% )
151 ( 95.2% )
49 ( 98.4% )
Walker
0.3
2417 ( −5.5% )
2489 ( −8.6% )
2623 ( −14.5% )
Walker
0.5
2053 ( 10.4% )
1593 ( 30.4% )
1290 ( 43.7% )
Walker
0.7
1148 ( 49.9% )
319 ( 86.1% )
44 ( 98.1% )
Appendix
Table 2: Corrupt-end performance relative to the clean reference under dynamic bias (advantage sign flip). Values are means over five seeds; parentheses show the relative decrease.
Condition
0.25M
0.50M
0.75M
1.00M
Spearman ρ
Hopper Static ( c=−1 )
0.879±0.671
0.491±0.488
−0.231±1.220
0.514±0.608
−0.28
Hopper Dyn. p=0.3
−3.70±10.7
0.087±1.52
3.22±6.77
0.045±1.09
−0.02
Hopper Dyn. p=0.5
0.764±0.308
0.881±0.158
0.856±0.091
0.824±0.225
+0.15
Hopper Dyn. p=0.7
0.917±0.110
0.702±0.290
0.369±0.347
0.103±0.101
−0.82∗∗∗
Walker Dyn. p=0.3
−0.27±3.02
−1.34±7.69
−1.61±2.57
1.43±2.55
+0.23
Walker Dyn. p=0.5
115.8±248.8†
2.28±1.28
1.43±1.02
1.41±1.04
−0.60∗∗
Appendix
Table 3: Recovery Score under the Progressive RL protocol. Values are mean ± s.d. over five seeds. Static bias was evaluated on Hopper; dynamic bias was evaluated on Hopper and Walker for p∈{0.3,0.5,0.7} .
Exposure length
Training Loss
Target Accuracy
Non-target Accuracy
Clean
–
67.05±2.35%
76.98±1.26%
Exposure start (0)
0.237±0.034
67.05±2.35%
76.98±1.26%
1000
0.055±0.002
11.30±4.54%
74.53±1.53%
3000
0.011±0.001
6.47±0.99%
68.42±2.31%
5000
0.008±0.001
5.80±1.01%
69.86±1.67%
8000
0.007±0.001
6.38±1.54%
69.62±3.13%
Appendix
Table 4: Core SBW evidence under static bias for Qwen2.5-7B-Instruct. Values are mean ± s.d. over five seeds. Training Loss is a W=100 window mean.
Exposure length
Recovery Score
1000
0.940±0.058
3000
0.940±0.060
5000
0.962±0.054
8000
0.960±0.066
Appendix
Table 5: Recovery Score after static bias for Qwen2.5-7B-Instruct (five seeds; Recovery = 5000 steps of Clean data; mean ± s.d.).
Global step
Training Loss
Target Accuracy
Non-target Accuracy
0 (exposure start)
0.246±0.030
67.05±2.35%
76.98±1.26%
200
0.133±0.001
31.01±6.82%
70.85±3.03%
700
0.065±0.001
19.13±8.15%
74.03±0.92%
1200
0.037±0.002
15.75±5.12%
73.38±1.25%
1700
0.022±0.001
13.43±3.18%
72.23±1.37%
Appendix
Table 6: Core SBW evidence under dynamic bias for Qwen2.5-7B-Instruct (five seeds, aligned checkpoints; mean ± s.d.). Training Loss is a W=100 window mean, as in the static condition.
Group
Training
Validation
Test
Cardiomegaly + AP
143
21
29
Normal + PA
132
27
28
Cardiomegaly + PA
0
0
25
Normal + AP
0
0
28
Total
275
48
110
Appendix
Table 7: Dataset split. The final two groups (Cardiomegaly+PA and Normal+AP) are absent from training and validation and are used to test whether the model relies on projection-view shortcuts.
Group
n
Accuracy
Cardiomegaly + AP (aligned)
29
100.0%
Normal + PA (aligned)
28
96.4%
Cardiomegaly + PA (association broken)
25
40.0%
Normal + AP (association broken)
28
39.3%
Appendix
Table 8: Classification accuracy on association-aligned and association-breaking test samples.
Mechanism
Exposure length
Rpre
Rpost
RT@95%
Structural Patch
10
92.32±5.41
92.65±0.48
1.20±0.45
Structural Patch
20
90.76±5.37
91.74±1.02
1.40±0.55
Structural Patch
30
90.02±6.63
92.31±1.12
1.00±0.00
Structural Patch
50
73.14±12.88
89.08±5.59
1.00±0.00
Label Flip
10
91.92±3.02
91.80±1.42
1.00±0.00
Label Flip
20
93.06±3.84
92.36±1.35
1.00±0.00
Appendix
Table 9: Recovery behavior after three static-bias mechanisms on CIFAR-10 (five seeds; mean ± s.d.). Rpre and Rpost are automobile test accuracies (%).
Exposure length
Rpre (%)
Rpost (%)
RT@95%
10
89.24±7.32
92.25±1.21
1.20±0.45
20
94.10±2.29
91.81±1.69
1.00±0.00
30
92.22±3.02
90.91±1.03
1.00±0.00
50
89.68±7.04
92.19±0.55
1.20±0.45
Appendix
Table 10: Recovery behavior after dynamic bias (prediction-dependent label flip) on CIFAR-10 (five seeds; mean ± s.d.).
Exposure length
Cumulative modified fraction
eRank (pre → post)
Rpre (%)
RT@95%
10
0.361±0.006
36.2→28.0
93.68±2.28
1.00±0.00
20
0.499±0.003
34.0→27.1
90.82±2.11
1.00±0.00
30
0.584±0.008
31.6→25.8
92.66±1.80
1.00±0.00
50
0.698±0.010
29.3→24.7
91.88±1.38
1.00±0.00
Appendix
Table 11: Closed-loop effects and recovery behavior under Self-Induced Data Drift on CIFAR-10 (five seeds; mean ± s.d.).
Exposure length
Rpre
Rpost
RT@95%
10
36.40±22.24
44.84±3.28
2.00±1.22
20
46.40±19.46
47.48±8.77
2.20±1.64
30
38.00±5.10
48.88±3.88
3.40±2.61
50
40.00±8.12
44.76±3.92
2.00±0.71
Appendix
Table 12: Recovery after Static Bias (Structural Patch) on Tiny-ImageNet (five seeds; mean ± s.d.). Rpre and Rpost are validation accuracies (%) for the target class, sports car.
Exposure length
Cumulative modified fraction
eRank (pre → post)
Rpre
Rpost
RT@95%
10
43.32±0.32
162.5±8.3→145.1±9.4
44.40±23.64
46.24±3.81
2.00±0.71
20
60.68±0.40
144.4±9.2→134.1±9.7
58.80±7.69
43.08±5.47
1.00±0.00
30
70.30±0.47
132.0±8.7→129.6±7.9
44.40±16.64
50.12±3.22
1.40±0.55
50
81.11±0.52
116.9±5.7→119.3±5.4
41.60±23.60
46.28±4.38
1.60±0.89
Appendix
Table 13: Closed-loop effects and recovery under Self-Induced Data Drift on Tiny-ImageNet (five seeds; mean ± s.d.). The cumulative modified fraction is the proportion of samples relabeled by the end of Bias Exposure; eRank is the effective representation rank (pre → post); Rpre and Rpost are target-class validation accuracies (%).
Predictive models deployed at scale influence future data, a phenomenon called performativity. And there is always one way to cope: Train the model on new data, deploy it again, and repeat. This process, called retraining or repeated risk minimization, creates a feedback loop between model and data that real-world learning systems can't avoid. Results on performative prediction shed light on this dynamic: If the model's influence on the data is small, retraining reaches a fixed point. What remains open is why fixed points should naturally exist, and what governs retraining when the model's influence is strong. In this work we develop a new perspective on retraining -- the stable signal principle -- that addresses these questions. We start from the assumption that the prediction target has at least some small model-independent component, a stable signal, such as the intrinsic quality of an item. We prove that when a nonzero stable signal exists, repeated risk minimization, suitably regularized, converges geometrically to the direction of this stable signal. This is true even if the model's influence on the target is arbitrarily large relative to the stable signal. Regularization emerges naturally as a force to control performativity, rather than to promote generalization, revealing a new facet of an old concept. We extend the analysis to a broad family of affine retraining operators under arbitrary model-induced feature changes, heterogeneous time-varying effects, and nonlinear responses. The stable signal perspective also applies to data feedback loops in language modeling, providing new explanations for the stability of language model training from model-generated data.
Moritz Hardt
Max Planck Institute for Intelligent Systems, Tübingen, and Tübingen AI Center
Reinforcement learning (RL) of large language models is notoriously sensitive to small differences between training and inference engines, often referred to as the training-inference mismatch (TIM). However, completely eliminating TIM is impractical, as it would come at a major cost to rollout efficiency. In this paper, we show that the instability of RL under TIM is primarily caused by drift: a persistent bias between training and inference engines that accumulates with every training step. We derive an additive "score centering" correction term that stabilizes RL under TIM by canceling drift. When training models from 0.6B to 30B parameters, score centering alone matches or outperforms methods based on importance sampling under quantization, with the gap growing as the mismatch becomes more severe. Because the correction is additive, score centering also composes with importance sampling -- their composition outperforms pure importance-sampling baselines in our staleness experiments.
Outcome-based reinforcement learning can produce models with similar task performance but very different ways of communicating about their mistakes. We study failure disclosure: whether a model admits that an attempted solution failed rather than staying silent or presenting it as successful. Across repeated outcome-only GRPO training runs, failure disclosure varies far more than task accuracy. The pattern extends to a second reasoning task and stabilized PPO, persists at 7B, and also appears in an instruction-conditioned 32B setting. We also find that small floating-point and sampling differences during training can redirect reporting behavior even when the task objective and earlier training history are held fixed. Additional tests show that failure disclosure is not a single decision: Checking the answer, entering a report, and completing the admission can separate, and the weak point depends on the task and response format. Further, experiments with neutral controls show more broadly that behaviors left weakly constrained by training are especially likely to vary across runs, of which failure disclosure is an example. We can reduce variability in failure disclosure by discouraging the model from drifting from its starting policy on failed, well-formed responses. This makes reporting substantially more consistent, though its effect on task performance depends on the setting. Stable task accuracy therefore does not guarantee stable safety-relevant behavior: Researchers should measure these behaviors directly across runs and design training methods that keep them reliable.
Steven Y. Feng, Noah D. Goodman, Michael C. Frank +3