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

Hugging Face Daily Papers Papers

Summary

This paper presents a closed-form upper bound for admissible learning-rate steps in belief-space dynamics, providing a theoretical result for optimization in robotics or control.

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.
Original Article
View Cached Full Text

Cached at: 05/12/26, 02:52 PM

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

Source: https://huggingface.co/papers/2605.06741 Get this paper in your agent:

hf papers read 2605\.06741

Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2605.06741 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2605.06741 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2605.06741 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

Adjustment Speed as a Safety Constraint for Nonstationary Reinforcement Learning

arXiv cs.LG

This paper proposes adjustment speed as a safety constraint for nonstationary reinforcement learning, defining safety in terms of adaptation feasibility and using representation learning with context forecasts to proactively regulate behavior when predicted adaptation demand exceeds the system's achievable capacity.