When should one stop the most exciting game? Sequential Inference for win-martingales
arXiv:2608.12291
2026
Architecture
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper formulates sequential binary prediction as an optimal-stopping problem for the posterior win probability, balancing terminal decision error against the cost of observing additional information. Its transferable asset is a free-boundary policy: the best halting rule is determined by a value comparison and need not be a fixed confidence threshold or monotone in computation time. This can produce adaptive early exits for neural networks whose stopping behavior responds jointly to calibrated confidence, layer index, and the empirically observed value of later layers.
Ideas from this paper
Unverified
2026
Replace a fixed confidence-threshold early-exit rule with a finite-horizon optimal-stopping policy over the model's evolving posterior confidence. The controller stops when the calibrated expected terminal error is no greater than the cost plus expected value of executing another neural block, permitting time-dependent and nonmonotone stopping regions.
Useful6/10
Difficulty5/10
Novelty5/10