Global attractors and fast-slow reduction for finite-state actor-critic mean dynamics
Vladyslav Prytula (zooplus SE)

TL;DR
This paper analyzes the long-term behavior of finite-state actor-critic algorithms, proving the existence of global attractors and demonstrating how the dynamics can be reduced and approximated under certain conditions.
Contribution
It introduces a rigorous mathematical framework for understanding actor-critic mean dynamics, including attractor existence, Lipschitz properties, and fast-slow reduction techniques.
Findings
Existence of a compact global attractor for the autonomous semiflow.
Lipschitz continuity of the invariant-law map under exponential-mixing.
Convergence of the exact flow to the reduced flow as the parameter tends to zero.
Abstract
When a learning algorithm reshapes the data distribution it trains on, the long-run behavior depends on the joint evolution of the policy, the value estimate, and the data distribution. We study finite-state actor-critic mean dynamics on the enlarged phase space , where is the actor parameter, is an auxiliary critic state, and is a state-law variable (the distribution over states induced by the current policy). The state-law coordinate follows the exact controlled-Markov equation . Under a softmax actor with box confinement (a smooth proxy for parameter clipping), a uniformly coercive linear critic equation, and a Lipschitz generator family , we prove that for each the resulting autonomous semiflow possesses a compact global attractor. Under a uniform exponential-mixing assumption,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
