The asymptotic behavior of the stochastic gradient algorithm with a biased gradient estimator is analyzed. Relying on arguments based on the dynamic system theory (chain-recurrence) and the differential geometry (Yomdin theorem and Lojasiewicz inequality), tight bounds on the asymptotic bias of the iterates generated by such an algorithm are derived. The obtained results hold under mild conditions and cover a broad class of high-dimensional nonlinear algorithms. Using these results, the asymptotic properties of the policy-gradient (reinforcement) learning and adaptive population Monte Carlo sampling are studied. Relying on the same results, the asymptotic behavior of the recursive maximum split-likelihood estimation in hidden Markov models is analyzed, too.
Non-asymptotic convergence analysis of the stochastic gradient Hamiltonian Monte Carlo algorithm with discontinuous stochastic gradient with applications to training of ReLU neural networks
School of Mathematics, Renmin University of China, Beijing, China(中国人民大学数学学院);Division of Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, 637371 Singapore(南洋理工大学数学科学学院);Financial Technology Thrust, Society Hub, The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China(香港科技大学(广州)金融科技中心)
Asymptotic Analysis of Conditioned Stochastic Gradient Descent
École Polytechnique(巴黎综合理工学院);Institut Polytechnique de Paris(巴黎理工学院);ENSAI(法国国立统计与信息分析学院);École Nationale de la Statistique et de l’Analyse de l’Information(法国国立统计与信息分析学院)
Asymptotic Expansion and Bounds for the Bias of Empirical Tail Value-at-Risk
Saint Petersburg State University(圣彼得堡国立大学);Emperor Alexander I Saint Petersburg State Transport University(亚历山大一世圣彼得堡国立交通大学);Purdue University(普渡大学);RISC Foundation(RISC基金会);Western University(韦仕敦大学)