Sign inGet started
Paper · arXiv

Local and Global Stability in Performative Reinforcement Learning

In performative reinforcement learning the deployed policy shapes the environment that generates the learner's future data, and the natural solution concept is a performatively stable policy that is optimal in the environment it induces. Existing convergence guarantees rely on Lipschitz sensitivity assumptions on the environment map $π\mapsto (P_π, r_π)$, which are hard to verify and fail in settings such as multi-agent best-response dynamics. We instead study stability for mixtures of policies, and show that the resulting picture is fundamentally different from performative prediction, where randomization removes the need for any sensitivity assumption. We distinguish local mixed stabili...

AuthorsDebmalya Mandal
Primary categorycs.LG
Published6 September 2026
Last updated at source6 September 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/d695b9a3-65c9-44e7-bdac-83ecd925db02" 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.