New AI Math Proof Makes Training AI Faster and Cheaper

A new analysis shows that, for a broad class of gradient-based learning rules, scalar zero-sum games form a complete test family for convergence in unconstrained network zero-sum games. If a learning rule converges on every scalar game of magnitude a whenever η ≤ f(a), then the same guarantee holds on an arbitrary network zero-sum game with stacked game operator G whenever η ≤ f(||G||₂).

Finite-time rate guarantees also transfer mode by mode: the network response is bounded by the largest response of its scalar canonical games, and under compatible linear initialization conventions the worst-case finite-time network response is exactly the largest scalar canonical rate. Thus, understanding learning dynamics on scalar games is sufficient to characterize universal convergence and worst-case rates over the corresponding class of network games.

The result follows from the classical planar decomposition of real skew-symmetric game operators. The article discusses implications for simplifying convergence analysis, time-average guarantees, low-dimensional geometric arguments, accelerated-method design, and worst-case numerical testing.