Stochastic Approximation (SA) is a popular approach for solving fixed-point equations where the information is corrupted by noise. In this paper, we consider an SA involving a contraction mapping with respect to an arbitrary norm, and show its finite-sample error bounds while using different stepsizes. The idea is to construct a smooth Lyapunov function using the generalized Moreau envelope, and show that the iterates of SA have negative drift with respect to that Lyapunov function. Our result is applicable in Reinforcement Learning (RL). In particular, we use it to establish the first-known convergence rate of the V-trace algorithm for off-policy TD-learning. Moreover, we also use it to study TD-learning in the on-policy setting, and recover the existing state-of-the-art results for $Q$-learning. Importantly, our construction results in only a logarithmic dependence of the convergence bound on the size of the state-space.
Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs
University of British Columbia(不列颠哥伦比亚大学);University of Victoria(维多利亚大学);Southern University of Science and Technology(南方科技大学);National Center for Applied Mathematics Shenzhen(深圳国家应用数学中心);Peng Cheng Laboratory(鹏城实验室)
Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
Department of Information System, Arizona State University(亚利桑那州立大学信息系统系);Department of Business Analytics, University of Iowa(爱荷华大学商业分析系);Department of Mathematical Sciences, Rensselaer Polytechnic Institute(伦塞拉尔_polytechnic学院数学科学系)