Buchumschlag

Fast Nonlinear Two-Time-Scale Stochastic Approximation: Achieving $O(1/k)$ Finite-Sample Complexity

Fuente: arXiv

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Doan, Thinh T.
Format:	Preprint
Veröffentlicht:	2024
Schlagworte:	Optimization and Control Machine Learning
Online-Zugang:	Acceder al recurso
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Ähnliche Einträge

Fast Two-Time-Scale Stochastic Gradient Method with Applications in Reinforcement Learning
von: Zeng, Sihan, et al.
Veröffentlicht: (2024)

A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning
von: Zeng, Sihan, et al.
Veröffentlicht: (2021)

$O(1/k)$ Finite-Time Bound for Non-Linear Two-Time-Scale Stochastic Approximation
von: Chandak, Siddharth
Veröffentlicht: (2025)

Finite-Time Decoupled Convergence in Nonlinear Two-Time-Scale Stochastic Approximation
von: Han, Yuze, et al.
Veröffentlicht: (2024)

Finite-Time Complexity of Online Primal-Dual Natural Actor-Critic Algorithm for Constrained Markov Decision Processes
von: Zeng, Sihan, et al.
Veröffentlicht: (2021)

Accelerated Multi-Time-Scale Stochastic Approximation: Optimal Complexity and Applications in Reinforcement Learning and Multi-Agent Games
von: Zeng, Sihan, et al.
Veröffentlicht: (2024)

Convergence Rate in Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence
von: Chen, Zixi, et al.
Veröffentlicht: (2025)

Finite-Time Analysis of Projected Two-Time-Scale Stochastic Approximation
von: Bai, Yitao, et al.
Veröffentlicht: (2026)

Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise
von: Haque, Shaan Ul, et al.
Veröffentlicht: (2023)

Achieving Tighter Finite-Time Rates for Heterogeneous Federated Stochastic Approximation under Markovian Sampling
von: Zhu, Feng, et al.
Veröffentlicht: (2025)

Finite-Time Bounds for Two-Time-Scale Stochastic Approximation with Arbitrary Norm Contractions and Markovian Noise
von: Chandak, Siddharth, et al.
Veröffentlicht: (2025)

Resilient Two-Time-Scale Local Stochastic Gradient Descent for Byzantine Federated Learning
von: Dutta, Amit, et al.
Veröffentlicht: (2024)

Natural Policy Gradient and Actor Critic Methods for Constrained Multi-Task Reinforcement Learning
von: Zeng, Sihan, et al.
Veröffentlicht: (2024)

Decoupled Functional Central Limit Theorems for Two-Time-Scale Stochastic Approximation
von: Han, Yuze, et al.
Veröffentlicht: (2024)

SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity
von: Chu, Tianshu, et al.
Veröffentlicht: (2024)

Achieving ${O}(ε^{-1.5})$ Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization
von: Yang, Yifan, et al.
Veröffentlicht: (2023)

Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling
von: Adibi, Arman, et al.
Veröffentlicht: (2024)

Asymptotic and Finite Sample Analysis of Nonexpansive Stochastic Approximations with Markovian Noise
von: Blaser, Ethan, et al.
Veröffentlicht: (2024)

Heavy-Tailed and Long-Range Dependent Noise in Stochastic Approximation: A Finite-Time Analysis
von: Chandak, Siddharth, et al.
Veröffentlicht: (2026)

Stochastic Nonlinear Control via Finite-dimensional Spectral Dynamic Embedding
von: Ren, Zhaolin, et al.
Veröffentlicht: (2023)

Central Limit Theorem for Two-Time-Scale Approximate Distributionally Robust RL
von: Wang, Shengbo, et al.
Veröffentlicht: (2026)

Sample Complexity of Stochastic Optimization with Integer Variables
von: Cheng, Hongyu, et al.
Veröffentlicht: (2026)

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
von: Jiang, Jiashuo, et al.
Veröffentlicht: (2024)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
von: Livni, Roi
Veröffentlicht: (2024)

The Sample Complexity of Parameter-Free Stochastic Convex Optimization
von: Lawrence, Jared, et al.
Veröffentlicht: (2025)

The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsize
von: Huo, Dongyan, et al.
Veröffentlicht: (2024)

Finite-Time Analysis of Stochastic Nonconvex Nonsmooth Optimization on the Riemannian Manifolds
von: Sahinoglu, Emre, et al.
Veröffentlicht: (2025)

Achieving $ε^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions
von: Hamza, Ishaq, et al.
Veröffentlicht: (2026)

Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications
von: Hu, Jie, et al.
Veröffentlicht: (2024)

Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
von: Tyurin, Alexander, et al.
Veröffentlicht: (2024)

Estimation Sample Complexity of a Class of Nonlinear Continuous-time Systems
von: Kuang, Simon, et al.
Veröffentlicht: (2023)

Two-Timescale Linear Stochastic Approximation: Constant Stepsizes Go a Long Way
von: Kwon, Jeongyeol, et al.
Veröffentlicht: (2024)

A Simple Finite-Time Analysis of TD Learning with Linear Function Approximation
von: Mitra, Aritra
Veröffentlicht: (2024)

Tame Riemannian Stochastic Approximation
von: Aspman, Johannes, et al.
Veröffentlicht: (2023)

Exponential Concentration in Stochastic Approximation
von: Law, Kody, et al.
Veröffentlicht: (2022)

Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method
von: Liang, Jiaming
Veröffentlicht: (2024)

Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation
von: Levin, Ilya, et al.
Veröffentlicht: (2026)

Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
von: Guo, Luyao, et al.
Veröffentlicht: (2023)

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
von: Lee, Wei-Cheng, et al.
Veröffentlicht: (2025)

A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
von: Berahas, Albert S., et al.
Veröffentlicht: (2023)