Decision field p(y=1) over a × b at one binary cue slice (−1 or +1) · label: same sign, a·b > 0
no run yet
No model yet. After a run, the field shades a finite grid: each cell is coloured by one forward pass of the selected checkpoint at the cell centre, with the cue fixed at the chosen slice (−1 or +1).
reliance band: no run
Reliance band: the cells of the supported grid (a finite set) where the predicted class changes when the cue goes from −1 to +1. No such cells does not mean the cue has no effect on the probability, and a band of any size is not a complete causal explanation.
Arrows: nearest example · Enter: dissect · F: flip cue · [ ]: step · Space: replay · Home/End: first/last checkpoint
Field and points as a table
Specimen
select a point
Three numbers, not a picture. Shading marks the gap |v| < 0.2, where no examples are generated. A dashed ring (or *) marks the example’s stored value before you moved it.
Contributions as a table
Runs over training
step —
solid: IID accuracy · dashed: reversed-cue accuracy · dotted: band cells / supported grid cells (class disagreement between cue −1 and +1)
The next run that would tell these apart
400 × 120 vs 800 × 60 matches how many times examples are seen, not optimizer steps or CPU time.