Online balancing of vectors with small coordinates
arXiv:2608.12490
2026
Architecture
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper gives a constructive online discrepancy principle: signs can be selected sequentially so that every coordinate of every prefix sum remains bounded with exponentially small failure probability when each arriving vector has sufficiently small coordinates. The transferable asset is a bounded-state controller for additive neural memories whose updates have sign symmetry. A practical adaptation is a signed fast-weight or recurrent state in which each incoming update chooses a sign by comparing a compact smooth potential before and after the two possible updates; experiments can test whether this prevents state saturation and improves long-context stability. The guarantee applies only when updates are norm-bounded and coordinate-wise diffuse, so the implementation must explicitly normalize updates.
Ideas from this paper
Unverified
2026
Replace an unrestricted additive recurrent or fast-weight memory with a sign-selectable update: for each incoming update vector, choose between adding and subtracting it so that a smooth compact potential of the memory state is minimized. This is appropriate when the memory representation has sign symmetry, such as signed random features or a learned linear sketch; it is not a drop-in replacement for ordinary gradient updates where the sign carries semantic information.
Useful5/10
Difficulty5/10
Novelty9/10