Stochastic Recursive Inclusions in two timescales with non-additive iterate dependent Markov noise
Not on the map. Why?
Abstract (arXiv)
In this paper we study the asymptotic behavior of a stochastic approximation scheme on two timescales with set-valued drift functions and in the presence of non-additive iterate-dependent Markov noise. It is shown that the recursion on each timescale tracks the flow of a differential inclusion obtained by averaging the set-valued drift function in the recursion with respect to a set of measures which take into account both the averaging with respect to the stationary distributions of the Markov noise terms and the interdependence between the two recursions on different timescales. The framework studied in this paper builds on the works of itA. Ramaswamy et al. rm by allowing for the presence of non-additive iterate-dependent Markov noise. As an application, we consider the problem of computing the optimum in a constrained convex optimization problem where the objective function and the constraints are averaged with respect to the stationary distribution of an underlying Markov chain. Further the proposed scheme neither requires the differentiability of the objective function nor the knowledge of the averaging measure.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Nov 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 3; 2025: 0; 2026: 1.
7 papers.
- 2024Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applicationscited by 7
- 2023Online Learning with Adversaries: A Differential-Inclusion Analysiscited by 3
- 2023n-Step Temporal Difference Learning with Optimal ncited by 2
- 2024Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walkscited by 2
- 2021Fully Distributed Actor-Critic Architecture for Multitask Deep Reinforcement Learningcited by 1
- 2024Reinforcement Learning with Quasi-Hyperbolic Discountingcited by 1
- 2026Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimatescited by 0
- 2026Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimates10 May 2026
- 2024Reinforcement Learning with Quasi-Hyperbolic Discounting16 Sep 2024
- 2024Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks18 Jan 2024
- 2024Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications17 Jan 2024
- 2023Online Learning with Adversaries: A Differential-Inclusion Analysis4 Apr 2023
- 2023n-Step Temporal Difference Learning with Optimal n13 Mar 2023
- 2021Fully Distributed Actor-Critic Architecture for Multitask Deep Reinforcement Learning23 Oct 2021