Stochastic Recursive Inclusions with Non-Additive Iterate-Dependent Markov Noise
Not on the map. Why?
Abstract (arXiv)
In this paper we study the asymptotic behavior of stochastic approximation schemes with set-valued drift function and non-additive iterate-dependent Markov noise. We show that a linearly interpolated trajectory of such a recursion is an asymptotic pseudotrajectory for the flow of a limiting differential inclusion obtained by averaging the set-valued drift function of the recursion w.r.t. the stationary distributions of the Markov noise. The limit set theorem in [1] is then used to characterize the limit sets of the recursion in terms of the dynamics of the limiting differential inclusion. We then state two variants of the Markov noise assumption under which the analysis of the recursion is similar to the one presented in this paper. Scenarios where our recursion naturally appears are presented as applications. These include controlled stochastic approximation, subgradient descent, approximate drift problem and analysis of discontinuous dynamics all in the presence of non-additive iterate-dependent Markov noise.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Jul 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
3 papers.
- 2021Full Gradient DQN Reinforcement Learning: A Provably Convergent Schemecited by 8
- 2023n-Step Temporal Difference Learning with Optimal ncited by 2
- 2026Full-Gradient Successor Feature Representationscited by 0
- 2026Full-Gradient Successor Feature Representations1 Apr 2026
- 2023n-Step Temporal Difference Learning with Optimal n13 Mar 2023
- 2021Full Gradient DQN Reinforcement Learning: A Provably Convergent Scheme10 Mar 2021