Nonasymptotic CLT and Error Bounds for Linear Two-Time-Scale Stochastic Approximation

arXiv:2502.09884 · cs.LG, cs.AI · Submitted 2025-02-14 · Read on arXiv

cs.LG, cs.AI

Submitted: 2025-02-14

Updated: 2026-09-01

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Reinforcement Learning — 7× in this paper · explained in 4 episodes
• Actor — 3× in this paper · explained in 3 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Adaptation — 1× in this paper · explained in 1 episode
• Additivity — 1× in this paper · explained in 1 episode
• Decoupling — 1× in this paper · explained in 2 episodes
• EMMA — 1× in this paper · explained in 2 episodes
• Fisher Information — 1× in this paper · explained in 3 episodes
• Non-asymptotic Analysis — 1× in this paper · explained in 2 episodes
• Phase Transitions — 1× in this paper · explained in 2 episodes
• Reward Function — 1× in this paper · explained in 2 episodes
• Sample Complexity — 1× in this paper · explained in 15 episodes

Sources

• Accelerated Multi-Time-Scale Stochastic Approximation: Optimal Complexity and Applications in Reinforcement Learning and Multi-Agent Games

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks