Local Ai
A Closed-Form Upper Bound for Admissible Learning-Rate Steps in Belief-Space Dynamics
arXiv:2605.06741v1 Announce Type: new Abstract: Learning-rate steps are usually treated as hyperparameters. This paper isolates a local beliefspace calculation: when an update is modeled as a projecte
arXiv:2605.06741v1 Announce Type: new Abstract: Learning-rate steps are usually treated as hyperparameters. This paper isolates a local beliefspace calculation: when an update is modeled as a projected forward step on the probability simplex, admissibility means contractivity in the natural KL/Bregman geometry. Under this model, the upper bound of an admissible step is not a tuning slogan but a formula.
Source: arXiv cs.LG | 2026-05-11