Metraipolis › archive › dc_a0e177ecdc22
Conflicting Supervision Moves Commitment, Not Capability: A 12.29σ arrangement effect that is exactly zero under a convention-agnostic score — arXiv:2610.00234
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.00234
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T12:01:39.966Z
- SHA-256 of the archived text
b1b1636eee456c55472eaa9f4db10c2738462f15418a0961706fc22441e2a9d4- Stable URL of this page
https://metraipolis.com/documento/dc_a0e177ecdc22
How to cite
Conflicting Supervision Moves Commitment, Not Capability: A 12.29σ arrangement effect that is exactly zero under a convention-agnostic score — arXiv:2610.00234 — arXiv (en), https://arxiv.org/abs/2610.00234 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a0e177ecdc22 (Metraipolis archive dc_a0e177ecdc22, sha256 b1b1636eee456c55472eaa9f4db10c2738462f15418a0961706fc22441e2a9d4)
BibTeX
@misc{dca0e177ecdc22,
title = {Conflicting Supervision Moves Commitment, Not Capability: A 12.29σ arrangement effect that is exactly zero under a convention-agnostic score — arXiv:2610.00234},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.00234},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a0e177ecdc22; sha256 b1b1636eee456c55472eaa9f4db10c2738462f15418a0961706fc22441e2a9d4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00234. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
"Train a model on the same problems written under two incompatible conventions, both correct, and ask what the ordering of that data writes into the parameters. The learning-rate schedule is not a background condition for that question. It is the averaging operator, and it decides the answer. We prove a bound in which the arrangement and the schedule enter the ordering effect as separate multiplied factors: the arrangement only as a block period, the schedule only as how much weight the endpoint can place on any one moment of the run. A decaying schedule cannot put a large step size and an uncontracted remainder at the same moment; a constant one does exactly that at the last step. That decay moderates ordering effects has been reported in pretraining; the mechanism, the separation, and a controlled measurement of both halves are ours. Ten orderings of one corpus, one budget, everything but the path held fixed, run twice under families differing in lr_scheduler_type and nothing else: at a constant rate the interior spans 0.2221 in allocation, 11.63 contrast floors, monotone in how blocked the arrangement is. Under the single cosine every published arm uses, the same ten arms occupy two distinguishable states where their own resolution would allow about ten. "Order matters" and "order does not matter" are the two ends of one knob. What the path writes is which convention the model commits to, and no exact-match benchmark can see it. Across twelve arms acc_A+acc_B is constant to within 9.7% while the allocation share runs 0.04 to 0.87, so the 12.29-sigma arrangement switch this paper measures is exactly zero under a convention-agnostic metric. That conservation is quoted from the decayed family throughout, the constant-rate one being a noisier place to read it. Marking the convention in the prompt collapses the switch and reaches 87.5% of the union ceiling." Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-02 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2610.00234 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T10:21:27.852Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).