English

A variable metric mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize

Optimization and Control 2020-10-05 v1 Machine Learning Numerical Analysis Numerical Analysis

Abstract

Variable metric proximal gradient methods with different metric selections have been widely used in composite optimization. Combining the Barzilai-Borwein (BB) method with a diagonal selection strategy for the metric, the diagonal BB stepsize can keep low per-step computation cost as the scalar BB stepsize and better capture the local geometry of the problem. In this paper, we propose a variable metric mini-batch proximal stochastic recursive gradient algorithm VM-mSRGBB, which updates the metric using a new diagonal BB stepsize. The linear convergence of VM-mSRGBB is established for strongly convex, non-strongly convex and convex functions. Numerical experiments on standard data sets show that VM-mSRGBB is better than or comparable to some variance reduced stochastic gradient methods with best-tuned scalar stepsizes or BB stepsizes. Furthermore, the performance of VM-mSRGBB is superior to some advanced mini-batch proximal stochastic gradient methods.

Keywords

Cite

@article{arxiv.2010.00817,
  title  = {A variable metric mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize},
  author = {Tengteng Yu and Xin-Wei Liu and Yu-Hong Dai and Jie Sun},
  journal= {arXiv preprint arXiv:2010.00817},
  year   = {2020}
}

Comments

13 pages, 3 figures

R2 v1 2026-06-23T18:57:30.271Z