Sign inGet started
Paper · arXiv

A Closed-Form Upper Bound for Admissible Learning-Rate Steps in Belief-Space Dynamics

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.

AuthorsZixi Li, Youzhen Li
Primary categorycs.LG
Published7 May 2026
Last updated at source7 May 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f0f07c05-1cc1-47b2-a450-bbfeb324d855" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.