Self-evolving language models have recently emerged as a promising path toward superintelligence, with the advantage of reducing the cost of human supervision. While considerable progress has been made in verifiable domains, self-evolution in unverifiable domains remains substantially less explored. We propose Judge co-adaptation from Zero data (J-Zero), a unified Challenger–-Solver–-Judge co-evolution framework that supports self-improvement across both domains. The Challenger and Solver co-evolve through an adversarial interaction: the Challenger generates increasingly difficult tasks, while the Solver learns to produce higher-quality responses to them. In parallel, the Judge co-adapts using preference pairs whose ordering is known in advance from how each response was produced, i.e., the Solver's answer over the Challenger's, and its decomposed-and-recombined answer over its one-shot answer, rather than from the Judge's own scores. J-Zero outperforms the baselines by an average of 4.2 points on verifiable and 8.0 points on unverifiable domains, and continues to improve through at least ten iterations, whereas the baselines degrade after two.
We evaluate J-Zero on Qwen3-4B-Base and Qwen3-8B-Base against the base model and two representative zero-data self-play frameworks, R-Zero and G-Zero, across 11 verifiable and 3 unverifiable benchmarks. J-Zero attains the best score on every benchmark group at both scales.
Verifiable domain. J-Zero improves the average performance in verifiable domains by 9.47 and 7.88 points over the corresponding base models (Qwen3-4B-Base and Qwen3-8B-Base, respectively), while outperforming R-Zero by 4.74 and 3.56 points, respectively. Notably, J-Zero surpasses R-Zero even though R-Zero is specifically designed for self-evolution in verifiable domains.
| Benchmark | Qwen3-4B-Base | Qwen3-8B-Base | ||||||
|---|---|---|---|---|---|---|---|---|
| Base Model | R-Zero | G-Zero | J-Zero (ours) | Base Model | R-Zero | G-Zero | J-Zero (ours) | |
| Mathematical Reasoning | ||||||||
| GSM8K | 86.96 | 92.34 | 90.22 | 92.04 | 91.66 | 93.86 | 93.33 | 92.95 |
| MATH500 | 75.60 | 77.80 | 74.80 | 79.80 | 72.20 | 79.40 | 76.40 | 83.40 |
| Minerva | 45.22 | 52.57 | 47.06 | 54.04 | 48.90 | 57.35 | 48.53 | 61.76 |
| OlympiadBench | 41.39 | 44.36 | 41.10 | 47.18 | 40.95 | 44.96 | 44.21 | 53.12 |
| AMC23 | 45.39 | 52.50 | 47.81 | 53.36 | 44.92 | 56.56 | 49.77 | 60.62 |
| AIME24 | 8.96 | 11.04 | 11.15 | 16.15 | 10.52 | 13.96 | 12.71 | 19.58 |
| AIME25 | 6.67 | 7.92 | 7.50 | 15.83 | 8.96 | 12.29 | 10.83 | 15.94 |
| Average | 44.31 | 48.36 | 45.66 | 51.20 | 45.44 | 51.20 | 47.97 | 55.34 |
| General Reasoning | ||||||||
| MMLU-Pro | 51.70 | 55.55 | 54.14 | 58.60 | 58.97 | 60.92 | 59.44 | 63.80 |
| SuperGPQA | 26.53 | 28.63 | 27.56 | 29.35 | 30.45 | 31.87 | 31.24 | 33.22 |
| BBH | 50.88 | 64.35 | 58.90 | 70.85 | 66.21 | 71.31 | 66.15 | 78.38 |
| Average | 43.04 | 49.51 | 46.87 | 52.93 | 51.88 | 54.70 | 52.28 | 58.47 |
| Instruction Following | ||||||||
| Prompt Strict | 40.11 | 42.33 | 40.85 | 50.65 | 46.40 | 50.46 | 51.57 | 49.72 |
| Instruction Strict | 51.08 | 54.20 | 52.64 | 60.91 | 58.15 | 61.63 | 63.19 | 62.71 |
| Prompt Loose | 43.99 | 48.43 | 47.32 | 57.86 | 51.76 | 57.12 | 54.90 | 61.92 |
| Instruction Loose | 54.32 | 59.23 | 58.03 | 66.55 | 62.47 | 67.03 | 66.19 | 73.02 |
| Average | 47.38 | 51.05 | 49.71 | 58.99 | 54.70 | 59.06 | 58.96 | 61.84 |
| Overall Avg. | 44.91 | 49.64 | 47.41 | 54.38 | 50.67 | 54.99 | 53.07 | 58.55 |
Results across verifiable domains. The Overall score is the mean of the three domain averages. Best results are in bold.
Unverifiable domain. Baselines achieve much smaller gains in the unverifiable domain compared to the verifiable one, and this is where the gap to J-Zero is widest. R-Zero relies on a majority-vote reward that does not extend to open-ended tasks, so its unverifiable average improves by only 3.08 and 2.31 points, roughly half of what it gains on the verifiable side. G-Zero achieves even smaller gains of 1.31 and 2.08 points, which leaves it behind R-Zero and barely above the base model, since G-Zero does not employ the Judge at all. J-Zero improves the average performance in unverifiable domains by 11.23 and 10.18 points, respectively, with the largest gains observed on AlpacaEval 2.0 (6.22 → 28.56 and 12.93 → 33.53), a broad general instruction-following benchmark that covers diverse open-ended tasks while also including tasks in math and factual knowledge.
| Benchmark | Qwen3-4B-Base | Qwen3-8B-Base | ||||||
|---|---|---|---|---|---|---|---|---|
| Base Model | R-Zero | G-Zero | J-Zero (ours) | Base Model | R-Zero | G-Zero | J-Zero (ours) | |
| AlpacaEval | 6.22 | 11.38 | 9.20 | 28.56 | 12.93 | 18.37 | 18.39 | 33.53 |
| ArenaHard (H.P.) | 2.50 | 2.50 | 3.00 | 4.80 | 4.00 | 5.70 | 4.40 | 6.90 |
| ArenaHard (C.W.) | 0.90 | 1.50 | 1.40 | 2.20 | 1.70 | 2.20 | 2.20 | 3.90 |
| EQBench C.W. | 20.83 | 24.59 | 21.26 | 30.36 | 23.92 | 24.30 | 24.25 | 31.31 |
| Overall Avg. | 9.58 | 12.66 | 10.89 | 20.81 | 13.23 | 15.54 | 15.31 | 23.41 |
Results across unverifiable domains. The Overall score is the mean of the three benchmark scores, where the two Arena-Hard subsets are first averaged. Best results are in bold. H.P. and C.W. denote Hard Prompt and Creative Writing, respectively.
Subtask-amplification pairs matters more once the Solver matures. Both components, role-asymmetry and subtask-amplification pairs, contribute to the gains over the fixed-Judge baseline, with subtask amplification providing the larger improvement. Removing subtask-amplification pairs leads to a larger performance drop (\(-1.64\)) than removing role-asymmetry pairs (\(-0.97\)). This is consistent with the design of the two pair types. Role-asymmetry pairs teach the Judge to distinguish responses below the Solver's current capability, whereas subtask-amplification pairs expose it to responses beyond the Solver's one-shot frontier, which is critical for continued improvement. Nevertheless, combining the two sources performs best because they are most reliable at different stages of training (see Section 5.1 of the paper for details).
| Method | Verifiable | Unverifiable | Overall |
|---|---|---|---|
| J-Zero | 54.38 | 21.65 | 38.01 |
| ⊢ ❄️ Frozen Judge | 52.72 | 16.67 | 34.69 |
| ⊢ w/o subtask-amplification | 53.20 | 19.73 | 36.46 |
| ⊢ w/o role-asymmetry | 53.68 | 20.48 | 37.08 |
Ablation results. We disable one component at a time.
Existing LLM self-play methods plateau after only a few iterations: R-Zero and G-Zero peak at iteration 2 and decline thereafter. J-Zero instead improves monotonically through iteration 10 in both domains. The frozen-Judge variant follows J-Zero closely for the first three iterations and then plateaus. The divergence point is informative: it is where the Solver reaches the fixed Judge's own evaluation ceiling, after which the Judge's rewards no longer separate good responses from bad. A co-evolving Judge keeps its evaluation standard above the Solver's current level, so the reward signal stays discriminative as the Solver improves.
@article{chu2026jzero,
title = {J-Zero: Unified Challenger--Solver--Judge Co-Evolution from Zero Data},
author = {Chu, Gyouk and Jeon, Myeongho and Yang, Eunho},
journal = {arXiv preprint arXiv:2608.26582},
year = {2026}
}