cs.AISep 23, 2026
SaveConflicting Supervision Moves Commitment, Not Capability: A 12.29σ arrangement effect that is exactly zero under a convention-agnostic score
Organizations: University of Macau
Abstract
"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."
Figures & tables
Figure 1: The paper as a map: one instrument, one wall, and the three terms that get past it. Read left to right. Every box carries a measured verdict rather than a description , which is the property that decides whether a map of this kind is worth printing: change the experiments and this picture changes, because two of its boxes would say the opposite of what they say and the wall’s three exits would be a different three. The instrument (Definition 2 ) is what makes the rest expressible, since the quantity every term here moves is invisible to the score a benchmark reports. The three exits are not alternatives to one another: the schedule decides whether an ordering survives to the endpoint at all, the stopping phase is the one term that survives either schedule, and the key is a second channel rather than more bandwidth on this one. Magnitudes are in contrast floors and are the body’s, not recomputed here.
Figure 2: The space of data paths, and its image under each of the two schedules. (a) A data path is a monotone lattice path: at each optimiser step the trainer consumes a row from or from . There are of them: the size of the space sampled, not a quantity anything here transmits. shuf hugs the diagonal, a ladder rung is a coarser staircase, blocked is the corner. (b) and (c) Its image, in the read-out’s own coordinates (Definition 2 ), every arm of the synthetic conflict, on the three seeds the two families share. The two panels differ in one field of the trainer configuration and in nothing else : same corpus, same paths, same budget, same seeds, same step. In both, the arms lie in a narrow capability band and spread along it, so capability is the band’s width and allocation is its length. Under the single cosine every published arm uses, the nine ladder arms fall in one cell of the resolution of Definition 3 and blocked in another: two states, with eight empty cells between them where the range would support about ten, the eight interior arms spanning of share, contrast floors, below anything this design can resolve. Under a constant rate those same eight span , floors, and leaves them for the corner. The difference between the panels is Proposition 1 : the endpoint is the schedule-weighted average of what the path visited, so a schedule that decays to zero has averaged the ordering away by the time anyone scores it. Axes are square and identical across the two panels, so both bands are true strips and the pictures can be compared by eye. Source: constlr_ladder_table .
Figure 3: The division ladder under the single cosine, with the measured allocation at every rung (synthetic conflict, Qwen2.5-7B, three seeds; § 4.3 ). From one optimiser step to a quarter of the epoch, arrangement does not move the allocation: the whole interior of the ladder sits at the averaging limit. That flatness is the schedule’s and not the path’s : the identical ladder at a constant rate spans contrast floors in the same interior. Under this schedule the only escapes are at the top, stopping the alternation mid-swing (§ 5 ), and off the ladder entirely, via a query-time key (§ 5.1 ). Source: constlr_ladder_table .
Figure 4: The instrument: one corpus that disagrees with itself. The two training halves are disjoint in problems and no single row disagrees with itself: the disagreement is a property of the corpus. The evaluation is the opposite, one held-out set scored twice against mutually exclusive conventions, so a sample can be credited to at most one. That is what makes the sum a probability of solving and the ratio a policy. Drawn for nat ; cf2 is the same construction at rows per half.
Figure 5: The one thing that reads wrongly in prose. The read-out of Figure 4 as a change of coordinates: capability is constant along the dashed anti-diagonals, allocation along the dotted rays. A movement along a ray therefore changes capability at fixed allocation and a movement along a diagonal does the reverse, and an undecomposed accuracy cannot tell the two apart although their meanings are opposite.
| cf2 (flagship) | nat | status | |
| what the two conventions are | |||
| construction | boxed answer vs. that | numeral vs. spelled out | — |
| is either wrong? | yes, by construction | neither | claim is about nat |
| rows per condition | — | ||
| learning rate | nat ran colder | ||
| how strong an instrument each is | |||
Table 1: Two corpora, and which one carries which claim. The philosophical claim of this paper is a claim about nat , and nat is the weaker instrument ; we print the pair rather than leave it to be assembled from four sections. What travels between them is every qualitative statement the paper defends: capability conserved, allocation moved, interior flat, mirror antisymmetric at fixed . What does not travel is size, and the direction is against us, so the headline figures in the abstract are cf2 figures and a reader rebuilding this on a both-correct conflict should expect two thirds the capability, and, once the step size is matched (§ 7 , branch NI-1 ), about seven eighths the install. The last block is the arms nat does not have; they are not claimed for it. § 7 gives the full accounting, including the one asymmetry the construction itself creates and the budget gate that measures how much of the size gap is the step size. Source: review_statistics , nat_replication .
| build | control | conflict | conflict | verdict |
|---|---|---|---|---|
| v1 algebra pool, epoch | ( ) | positive control fails | ||
| v2 pooled skills, epochs | ( ) | control inert, switch fires | ||
| v3 the learning budget, lr | ( ) | control inert, switch fires |
Table 2: The instrument, across its three builds. is the arrangement contrast on the last-seen convention, signed : with the sources in the published order, so the switch is negative. Elsewhere the same quantity is quoted as a span between two arms and is therefore positive; here and in § 4.3 are the same measurement at eight and at three seeds, not two results with different signs. The control is the same construction with both halves under one convention, so it must stay inert; the paragraph below reads v1, where it did not. v1 and v2 are three-seed builds; v3 and its control carry eight. Sources: the conflict_switch , conflict_switch2 and conflict_switch2b3lr3e5 verdicts.
| arm | capability | share of | ||
|---|---|---|---|---|
| only | ||||
| only | ||||
| shuf | ||||
| purerand | ||||
| – | – | – | – | |
| ( blocked ) |
Table 3: The conservation decomposition (synthetic conflict, Qwen2.5-7B, three seeds). Capability is flat across every arrangement; only the allocation moves. Source: the cf2b3lr3e5 / ctl2b3lr3e5 result families ( epochs, lr , ), named because a second conflict family at a different budget also sits in the result base, and the two must not be pooled.
Figure 6: Conflict makes the policy stochastic, not the model weak. Per-problem commitment at samples on the synthetic conflict, three seeds, problems each. Bars within an arm run to . The committed arms are bimodal (the model either answers a problem the same way every time or cannot answer it) while the mixed arms move that mass into the middle without changing the unsolved fraction (grey, leftmost bar in each group). Same corpus, same volume, same budget; only the data path differs. Source cf2b3lr3e5 per-problem arrays.
| transition | count | frac | transition | count | frac |
|---|---|---|---|---|---|
| (re-labelled) | (newly solved) | ||||
| (never solved) | (lost) | ||||
| (stable) | (newly solved) | ||||
| (stable) | (lost) | ||||
| (re-labelled) | ties, either side |
Table 4: Per-problem transitions from shuf to blocked (synthetic conflict, three seeds problems). A problem’s state is the convention receiving more of its samples ( , , tie) or unsolved ( ). The solved set is nearly fixed while nearly half of it changes label, more often toward the convention trained last. The tie row carries the transitions tie and the tie , which is why the prose’s newly-solved and lost counts ( and ) exceed what the four rows sum to ( and ). Source cf2b3lr3e5 per-problem arrays.
Figure 7: Capability and allocation move on separate clocks, which the range alone hides. The blocked construction’s second stage: a model trained to completion on and then trained on , checkpointed every four optimiser steps over that stage’s first , three seeds averaged. It is not a ladder rung, and its allocation ends at heading toward blocked ’s rather than at the rung’s ; (top) allocation , (bottom) capability with a band of its floor around the endpoint. The shaded column is the first four steps. Capability spends of its total excursion there, while allocation spends of its, so the capability dip precedes the commitment shift rather than accompanying it. The verdict file’s audit fields record that both evaluations use the same questions with disjoint golds.
Figure 8: The averaging wall, measured. Same corpus, volume, budget and seeds; only the data path differs (Definition 1 ). (a) Allocation is flat from to and across shuf and purerand : to over a change in block length and a change of batch composition. is the first rung off that floor at and blocked sits at . (b) Capability over the identical arms spans , inside the contrast floor: the path relocates commitment without changing what can be solved. Bars are the seed standard deviation, three seeds per point ( shuf and blocked carry eight). Source cf2b3lr3e5 .
| arm | cosine | constant | difference | floors |
|---|---|---|---|---|
| shuf (mixed within batch) | ||||
Table 5: The same ladder under two learning-rate schedules. Ten arms, one corpus, one budget, the identical data path files, and the same three seeds : the intersection, computed rather than assumed, because the published shuf and blocked arms carry eight and a mixed comparison would print most of the eight-against-three difference as a schedule effect. The two families differ in lr_scheduler_type and in nothing else, which we checked against the training arguments and the corpus checksum rather than assuming, and both run to the same step ( on the ladder, at the corner). Under a cosine the interior spans , which is contrast floors and below anything this design can resolve. Under a constant rate the same interior spans , which is floors, with an intraclass correlation of whose bootstrap interval lies entirely above zero. The corner does not move : blocked reads and , one contrast floor apart, against the floors the rung below it moves. Source: constlr_ladder_table , constant_lr_verdict .
| (rr11) | (rr21) | |||
|---|---|---|---|---|
| share | capability | share | capability | |
| mean-field prediction | — | — | ||
| shuf (measured) | ||||
| blocked | ||||
| only (guard: floor) | ||||
Table 6: The share tracks the mixture weights; the blocked arm does not (natural-conflict ratio corpora, rows, three seeds; read-out rules frozen in the job script the scheduler executed: T1). The form was excluded by its own learnability guard and redesigned at ; the redesign is labelled, not laundered.
| allocation share of | ||||
|---|---|---|---|---|
| intervention | mean-field prediction | measured | miss | moves the share? |
| mixture ratio | yes, as predicted | |||
| block length | no change predicted | — | no ( – ) | |
| batch purity, fixed blocks | no change predicted | — | no ( of the span) | |
| palindromic reordering | no change predicted | — | no (and worse) | |
Table 7: The one lever the averaging limit leaves free. Proposition 1 ’s mean field is weighted by source proportions , so changing the mixture ratio must move the allocation and changing the path must not. Both halves are measured here on the same corpus family. Tolerance was frozen with the prediction; both misses fall on the side of the pretrained prior, which the family measures independently. (T1.)
| check | registered bar | measured | |
| S3 order effect of a palindrome | to machine precision | passes | |
| S1 median | over draws (IQR – ); of draws below the bar | fails | |
| S2 log–log slopes in differ | by | both slopes to four figures across | fails |
| the penalty across a refinement of the step, which is what “no order to improve” means | |||
| blocked | |||
Table 8: The construction splitting theory recommends, and what it did. Registered in the linear model, where every arm is computable exactly. S3 is an implementation guard, not a claim: a palindromic schedule is its own reverse, so its order effect must vanish, and it does. S1 and S2 are the claim and both fail: S1 by a factor of seven against its own bar, and S2 degenerately , since refining the step by moves either penalty in the fifth decimal. Source splitting_verdict .
Figure 9: Two ways of leaving the averaging wall, one designed and one accidental. (a) The palindromic schedule splitting theory recommends, against the blocked one it was built to beat, in the linear model where the joint arm is available in closed form. It is roughly four times worse , and refining the step by moves either penalty in the fifth decimal: there is no order to improve because the penalty is not a discretisation error. (b) The one intervention that does move the contrast is leaving the lazy regime. Raising the learning rate grows monotonically, , through a change of sign; the highest rate also costs capability, against , so it is the system leaving the regime the averaging argument is tight in.
| axis swept | on the path? | share, one end to the other | contrast floors |
|---|---|---|---|
| stopping phase, shuf against blocked | yes | ||
| model scale, 3B to 14B | no | ||
| mixture ratio, 1:1 to 2:1 | no | ||
| cosine restart, byte-identical path | no | ||
| block length, to | yes | ||
| batch purity at fixed block structure | yes |
Table 9: Every axis this project has swept, on one scale, sorted by how far it moves the allocation. All six are measured on the allocation share of a mixed arm at one model and one budget, so the column is commensurable; the learning-rate sweep is reported on the contrast rather than on the share and is deliberately absent rather than forced onto this axis. The stopping phase is the largest term measured anywhere in the project, which is why it gets a section. The block-length ladder ranks fifth of six, and all three non-path axes move the allocation further than the whole ladder does. Source: axes .
Figure 10: The stopping phase is a position on a cycle, and the mirror moves it to the other side. (a) The reading of Proposition 3 , labelled post hoc: a driven system oscillates about the mean-field point with amplitude growing in , and an endpoint measures where the path stopped. It makes one frozen prediction. (b) The measurement (read-out M1): at the shift is antisymmetric, against , with capability moving . At both constructions sit at the floor and the mirror manufactures nothing, as it must.
Figure 11: What the key opens, and why what it leaves is a different obstruction. (a) The unkeyed model sits at exactly half the additive ceiling, which is what a coin flip between two mutually exclusive golds scores; the key recovers of the gap and leaves . (b) That residue is coverage , and this panel is the whole of the evidence. Marked - only , trained on nothing but the spelled convention, answers in numerals at because numerals are the pretrained default and are therefore written; marked - only asked for a word scores , because there is nothing to select. (c) And the residue grows on a family that writes four times less of the minority convention, floors against a bar of two frozen before the run (V1). It is a necessary-condition test, which V2 or V3 would have refuted and which V1 cannot establish. Sources unlock_verdict , q3unlock_verdict .
| read-out | quantity | unkeyed | keyed | verdict |
| C | arrangement switch | ( floors) | ( floors) | C1 : it collapses |
| L | mean accuracy | L4 : partial unlock | ||
| against ceiling | of the gap | |||
| against L1 target | — | short by floors | ||
| the residue, and why it is coverage rather than difficulty | ||||
| marked - only on the numeral evaluation | the key selects | |||
Table 10: What the key opens, and what it cannot. The read-out was frozen in the job script before the runs (C on the switch, L on the level), and the analyzer recovers the three constants it was frozen against from the result base. The residue has a mechanism rather than an excuse: a marked - only model, trained on nothing but the spelled convention, answers in numerals when the key asks for numerals, but a marked - only model asked for a word cannot produce one it never saw. The key selects among conventions already written.
Figure 12: Three results asked to travel, and the answers are not uniform. (a) Every quantity whose threshold was frozen before the second family ran, divided by that threshold, so the bar sits at for all of them and the arrow says which side had to be cleared. Hollow is Qwen2.5-7B, filled is Qwen3-8B-Base, and the line between them is the travel. The guards pass well: the conflict installs better on the new family, so nothing below is an instrument at its floor. The key collapses the switch to of its bar on one family and on the other, and the residue grows as the coverage reading requires. The ladder’s span misses and so does the published row at , which is a fault in the registration rather than in the second family. Rows are ordered by what they decide, not by outcome, and the post-hoc statistic is ruled off. (b) The mirror is the one registration with no scalar bar: its rule is a shape, so it is drawn as one. Sources q3unlock_verdict , q3ladder_verdict , unlock_verdict , rate_verdict .
| quantity | Qwen2.5-7B | Qwen3-8B-Base | read-out | |
| guards | minority convention written, | — | ||
| on the synthetic conflict | G1 passes | |||
| switch present, on that corpus | fl | fl | G2 passes | |
| the key | unkeyed | ( fl) | ( fl) | |
| keyed | ( fl) | ( fl) | K1 collapses | |
| marked mean against its ceiling | L4 partial |
Table 11: The key, and the ladder, asked to travel. Both were registered before their runs with the branches and thresholds frozen, and both gates were read first. The key replicates and its residue moves as the coverage reading requires. The ladder’s registered branch is W2 , and the row below it is why that verdict is reported together with the threshold it was read against: the published Qwen2.5 ladder does not meet the same bar, which was checkable before the run and was not checked. Sources: q3unlock_verdict , q3ladder_verdict .
| registered claim | the rule, frozen first | what came back | verdict |
|---|---|---|---|
| v1 batch composition carries the switch | purerand near blocked purity; near shuf order | purerand against shuf , blocked : purity is of the span | dead |
| v2 optimiser memory cancels contested directions | a response turning on at , or at | flat through both onsets, ; only rises | dead |
| Strang a palindromic schedule beats a blocked one | S1 median ; S2 slopes differ by | S1 ; S2 both slopes ; S3 passes | dead |
| T1 allocation tracks the mixture weights | share within of mean-field and | and : misses and , both toward the pretrained prior | held |
| Ladder every block length lands at the interleaved allocation | within noise of shuf ’s own share | – against shuf ’s | held |
| M1 the mirror relocates antisymmetrically at fixed | ending on moves the same magnitude to the other side | against , capability moves | held |
Table 12: The ledger: every claim this paper registered, and what came back. Read the verdict column as a distribution rather than a score: three mechanisms died, four predictions held, one control was void and one instrument build inverted. The three deaths were derivable in advance from Proposition 1 , which is why they are kept rather than deleted. Rules are quoted from the artefact that froze them; Appendix D gives the commit and the interval for each.
| share | |||||
| rung | control (one cosine) | treatment (two) | (crit ) | guard | |
| primary | fl | ||||
| fl | SC-3 | passes | |||
| secondary | fl | ||||
| fl | SC-2 | passes | |||
| for scale: the entire block-length ladder, through , moves the share | |||||
Table 13: The schedule control: identical path, one cosine against two. The treatment consumes the control’s own stream in the same order and differs only in that the cosine restarts and the optimiser state resets at the midpoint, which is blocked ’s structure. The guard that voided the single-cosine control is read first and passes on both rungs. was fixed as primary before either arm ran, because its control dispersion is four times smaller. Its movement is contrast floors at . moves further and does not clear its own noise: its treatment seeds span , wider than the effect, and the registration recorded in advance that at this dispersion its silence is not evidence of absence. That is why the mechanical branch label SC-2 is reported with that sentence beside it rather than as “no effect”. Both rungs move the same way, which the registration fixed in advance as the signature of the schedule rather than of a mid-run stopping phase. Source schedctl_verdict .
| inference time (CCH) | training time (this paper) |
|---|---|
| bounded state , budget | the parameters, reached only through the update path |
| the stream: bindings distractors, kernel | the data path; conflict between sources |
| compressive channel (state mixing) | the averaging limit: only the path’s time-average is written (§ 4.3 ) |
| horizon wall: a fixed window; deferral, not escape | the stopping phase: recency as the one non-average term (§ 5 ) |
| verbatim index channel, cost | a query-time key in the data; selection moves from path to query (§ 5.1 ) |
| write-time code separability (Assumption 1) | the key selects only among conventions already written: vs (§ 5.1 ) |
Table 14: The CCH family: the same objects at inference time and training time. Left column: Chen et al. [2] . Right column: this paper and, for the premise rows, the companion recipe-level paper [ 5 ] .
Appendix figures & tables11 assets
Supplementary material from the paper’s appendix.
Appendix
| the mechanism, in-model (random non-commuting pairs, lazy regime) | |||
|---|---|---|---|
| sign reversal of | across the budget sweep | of draws | |
| sign reversal of | across the budget sweep | ||
| the same, at | step size is not the cause | / | |
| median rotation at the crossing | sum / difference | / | |
| the one-shot proxy, asked to predict where (Spearman) | |||
| in-model, from Magnus | against the measured crossing budget | ||
Table 15: The mechanism survives every test; the one-shot proxy for where it fires survives none. Upper panel: budget-dependent sign reversal is generic in the lazy regime, so the stopping term of Proposition 3 is not an artefact of our corpora. Lower panel: the leading Magnus/commutator score, the quantity a practitioner would compute once at initialisation to predict the crossing: is asked to rank three different things in three different places and fails all three, twice with the wrong sign . Reported together because they are one settled negative about a single object, not three separate disappointments.
Figure 13: One object, confirmed as a mechanism and failed as a predictor. The same two halves as Table 15 , drawn, because both halves are claims about a distribution. (a) Over random non-commuting pairs in the lazy regime, reverses sign in of draws and in , and the rate stays above chance across a sweep of the step size, so the reversal is something the finite-budget theory produces rather than a property of our corpora. The dotted series is the fraction of budgets the sweep can still represent, which falls above and is why the series falls with it; it is drawn rather than left out. (b) Every ranking the one-shot commutator score is asked for, on one axis. It is uncorrelated with the in-model crossing budget over pairs and inverted against the measured order effect at both budgets. Sources asym_budget_verdict , commutator_verdict .
| learning rate | per-seed | ||
|---|---|---|---|
Table 16: The switch grows with the learning rate, monotonically, and the arm that is supposed to be inert does not move with it. Three learning rates at three epochs on the natural conflict, three seeds each; is the mean allocation contrast and the mean single-convention accuracy, which is what a capacity explanation would have to move and does not. Raising the rate is the one intervention that takes the system further from the lazy regime the theory is derived in, and grows with it: which is the direction the suppression argument predicts.
Figure 14: The commutator proxy fails twice, and the two failures are different. (a) The score a practitioner would compute once at ranks the pairs backwards , at both budgets (Spearman at one epoch, at three). A weak predictor scatters about zero; this one is consistently inverted, which is stronger than uninformative. The dashed line is the contrast floor. (b) The deeper failure: four of six pairs change the sign of their order effect between budgets, so there is no fixed ordering for any once-computed quantity to predict. Source commutator_verdict .
| pair | ( ep) | ( ep) | sign flips? | ||
| algebra–calculus | |||||
| algebra–geometry | yes | ||||
| algebra–combinatorics | yes | ||||
| calculus–geometry | yes | ||||
| calculus–combinatorics | yes | ||||
| geometry–combinatorics |
Table 17: The six pairs the proxy is asked to rank, and the ranking it produces. The commutator norm is evaluated once at on Qwen2.5-7B activations at layer fraction ; is the leading Magnus budget built from it; is the measured order effect, three seeds, contrast floor . Two things are fatal to a static predictor and both are visible by eye: the commutator ranks with the wrong sign at both budgets, and four of six pairs change that sign between budgets, so the quantity being ranked is not a property of the pair alone. Source commutator_verdict .
| build | arm | against the shifted gold | against the unshifted gold |
|---|---|---|---|
| v1 (algebra pool, epoch) | conflict arms | – | |
| the convention lost to the pretrained prior; measured at the instrument’s floor | |||
| the read-out that followed, unchanged in rule | |||
| v1 | control | ( ) — the arm that should have been inert moved | |
| v1 | conflict | ( ) — the arm that should have moved did not | |
Table 18: Why v1 read at the floor: the treatment was never installed. Every conflict arm is scored twice, against the shifted golds the convention defines and against the unshifted ones the pretrained model already produces. Had the conflicting convention been learned, the first column would carry the mass. It does not, so in v1 was a difference between two arms neither of which had received the treatment, and the control’s was the only variance in the experiment. Source the conflict_switch family, three seeds, rows per condition at one epoch.
Figure 15: An instrument reporting a null because its treatment was absent. (a) v1’s conflict arms scored against both golds. The convention the arms were trained on is worth ; the unshifted convention the base already writes is worth – . Had the treatment installed, the first bar would carry the mass. (b) What the read-out rule then returned, in units of the seed standard error, and what the same rule returned after the redesign. In v1 the arm registered to stay inert moved and the arm registered to move returned : the control is the only thing in the experiment with variance to report. The v3 pair is the three-seed read-out, matched to v1’s three seeds rather than the eight-seed pair Table 12 prints. Nothing about the rule changed between them. Sources conflict_switch_verdict , conflict_switch2b3lr3e5_verdict .
| resolution | ||||||
|---|---|---|---|---|---|---|
| Qwen2.5-7B, clusters | ||||||
| (bits) | ||||||
| (bits) | ||||||
| Qwen3-8B-Base, clusters | ||||||
| (bits) |
Table 19: The headline pair, swept over the resolution constant it is defined at. counts the endpoint states the ten arms occupy under single linkage; is the logarithm of the range in units of the resolution and therefore gains exactly one bit per halving, which does not. Two clusters is what both families give from upward , and the second family gives it from upward. Below the first family resolves a third state, so the paper’s constant sits at the lower edge of the interval where the two families agree rather than in its middle, rather than presenting bit as resolution-free. The interval is wide above the choice and the between-cluster gap exceeds the largest within-cluster gap by on the first family and on the second, which is why the count is stable there. Source: rate_sensitivity .
Figure 16: The count, and the two reasons it is a count rather than a rate. (a) The ten arm endpoints of the cosine family on the share axis, with the window that decides whether two of them are one state drawn at the size it actually is. Nine arms fall inside a span whose largest internal gap is ; the tenth sits away, times that gap. The separation is not a knife-edge and does not need the constant to be exactly two. (b) The constant swept. The number of resolvable states is flat from to , while , which is of a volume ratio rather than a count, falls at every step of the sweep. Sources rate_verdict , rate_sensitivity .
| claim | outcome | artefact carrying the threshold | registered | result (verdict file, mtime) | gap |
|---|---|---|---|---|---|
| instrument, the positive control | confirmed | slurm_natconflict.sbatch | 65acb7a 08-01 12:52 | natconflict 08-03 08:23 | d 19h |
| v1 batch composition | confirmed | slurm_batchcomp.sbatch , decision rule | 2e5f5a9 08-02 12:42 | batchcomp 08-02 15:32 | h 50m |
| v2 and the ladder | no branch fired | slurm_pathspec.sbatch and PLAN.md : predicts | cd53c09 08-02 16:02 | pathspec 08-03 02:33 | h 30m |
| M1 the mirror | M1 confirmed | slurm_dpd_mirror.sbatch : an asymmetry falsifies the limit-cycle picture | a85c247 08-03 15:32 | dpd_mirror 08-06 07:44 | d 16h |
| C , L the key | C1 , L4 confirmed | slurm_disambig.sbatch , C on the switch and L on the level | 4830e37 08-04 06:46 | disambig 08-04 10:49 | h 03m |
| T1 the mixture ratio | T1 confirmed | slurm_ratio2.sbatch , tolerance frozen with the prediction | ff94a95 08-05 06:22 | ratio2 08-05 16:20 | h 58m |
Table 20: Seventeen registrations, what each returned, and the interval each one bought. Seven confirmed at their primary branch, two decided at another, two came back partial, three void on a guard, and three returned no branch at all. Fifteen were frozen from about an hour to nearly three days ahead of the result they decided. Two are not, and both are stated rather than averaged away: the palindromic check is a linear-model computation of a few seconds whose thresholds and whose answer entered the repository in the same commit, so it can assert an ordering it cannot demonstrate; and the amplitude-onset registration was withdrawn before any training because the rungs it named cannot be built at this budget, which is a fact about the ladder rather than about either family. The second-family replications carry positive intervals and are nonetheless printed here together with their answers rather than announced in an earlier version, which is the weaker of the two guarantees a registration can offer. The last two rows’ intervals are measured against a file timestamp on the shared volume rather than against a commit, which is weaker again and is why those cells say no commit instead of a hash. Of the two only NI is still recomputable from this tree: CM ’s registration gained an outcome section after its verdict, and writing that section overwrote the timestamp its interval was measured from. NI ’s was left byte-frozen for that reason and its outcome is recorded here and in its verdict file instead.
Figure 17: Seventeen registrations, and the interval each one bought. Table 20 in one axis: the distance between the commit that froze a threshold and the file that answered it. Fifteen run from about an hour to nearly three days ahead of their result. The two that are not intervals are drawn on the same axis rather than dropped from the count: the palindromic check put its thresholds and its answer in one commit, so it can assert an ordering it cannot demonstrate, and the amplitude-onset registration was withdrawn before any training because the rungs it named cannot be built at this budget. Source tab_registry , whose gap column is computed from the commit and the verdict file’s mtime.
More in this topic
Learning Rate Scheduling
Learning rate scheduling studies how to vary optimizer step sizes during training to improve stability, convergence, efficiency, and generalization.
See all 59 papers