Skip to content

Prelimit Coupling and Steady-State Convergence of Constant-Step-Size Nonsmooth Contractive Stochastic Approximation

Aug 2026 · Operational Research · 1 citation

TL;DR

A prelimit coupling framework for analyzing nonsmooth stochastic approximation procedures is developed, which establishes Wasserstein convergence to a unique stationary distribution, characterize the limiting steady-state distribution as the step size vanishes, and shows that nonsmoothness can create a bias of order of the square root of the step size.

Abstract

Nonsmooth Learning Algorithms Behave Differently from Smooth Ones Many learning algorithms, including Q-learning, update their estimates through noisy recursive rules. When these updates use a constant step size and involve nonsmooth operators, their long-run behavior can be difficult to characterize: the iterates do not converge to a single point but instead settle into a stationary distribution, and classical tools for smooth dynamics may fail. In “Prelimit Coupling and Steady-State Convergence of Constant-Step-Size Nonsmooth Contractive SA,” Yixuan Zhang, Dongyan (Lucy) Huo, Yudong Chen, and Qiaomin Xie develop a prelimit coupling framework for analyzing such nonsmooth stochastic approximation procedures. They establish Wasserstein convergence to a unique stationary distribution, characterize the limiting steady-state distribution as the step size vanishes, and show that nonsmoothness can create a bias of order of the square root of the step size, unlike the bias linear in the step size that is typical of smooth dynamics. The results also justify Richardson–Romberg extrapolation as a tool for bias reduction, with applications to Q-learning.

View source

Similar papers

#machine learning Preprint Sep 2026

Steady-State Convergence of Stochastic Approximation

For constant-stepsize stochastic approximation (SA), the iterates converge in distribution to a stationary law that depends on the stepsize $\alpha.$ Steady-state convergence (SSC) concerns the limit of the scaled stationary distribution as $\alpha \downarrow 0.$ Existing SSC theory requires i.i.d. or additive noise an...

Yi-Xuan Zhang, Qiao-Min Xie · 1 citation
#machine learning Preprint Oct 2026

Moment-Accurate Gaussian Mixtures for Constant-Step Stochastic Approximation

Local Gaussian models of constant-step learning predict output variability and expected losses, but weak convergence alone does not justify these moment predictions. We establish moment-accurate Gaussian mixtures by matching stationary energy with local Ornstein--Uhlenbeck limits, ruling out quadratic tail mass invisib...

Xiao-Lin Li, Wei-Biao Wu · 0 citations
#machine learning Preprint Sep 2026

Learning to Solve Stochastic Controls with Unknown Drifts and Running Rewards: Theory, Algorithms and Convergence

This work takes the exploratory, reinforcement learning (RL) framework of Wang, Zariphopoulou, and Zhou with relaxed controls and entropy regularization with the objective to develop theoretically grounded, efficient and scalable RL algorithms to learn both the optimal value functions and optimal feedback control polic...

Jing-Sheng Ma, Gao-Zhan Wang, Jian-Feng Zhang et al. · 0 citations
Preprint Aug 2026

Stochastic Gradient Tracking over Time-Varying Networks: One-Step Lyapunov Analysis

A time-varying quadratic norm is constructed that turns this window contraction into an exact one-step Lyapunov identity, leading to coupled one-step recursions for the centroid and disagreement errors, without unrolling the dynamics over communication windows.

Sulaiman A. Alghunaim · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.