A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems

Erfan Yazdandoost Hamedani () and Afrooz Jalilzadeh ()
Additional contact information
Erfan Yazdandoost Hamedani: The University of Arizona
Afrooz Jalilzadeh: The University of Arizona

Computational Optimization and Applications, 2023, vol. 85, issue 2, No 10, 653-679

Abstract: Abstract In this paper, we propose a variance-reduced primal-dual algorithm with Bregman distance functions for solving convex-concave saddle-point problems with finite-sum structure and nonbilinear coupling function. This type of problem typically arises in machine learning and game theory. Based on some standard assumptions, the algorithm is proved to converge with oracle complexities of $${\mathcal {O}}(\frac{\sqrt{n}}{\epsilon })$$ O ( n ϵ ) and $${\mathcal {O}}(\frac{n}{\sqrt{\epsilon }}+\frac{1}{\epsilon ^{1.5}})$$ O ( n ϵ + 1 ϵ 1.5 ) using constant and non-constant parameters, respectively where n is the number of function components. Compared with existing methods, our framework yields a significant improvement over the number of required primal-dual gradient samples to achieve $$\epsilon $$ ϵ -accuracy of the primal-dual gap. We also present numerical experiments to showcase the superior performance of our method compared with state-of-the-art methods.

Keywords: Primal-dual; Saddle-point; First-order method; Variance reduction (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-023-00472-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:85:y:2023:i:2:d:10.1007_s10589-023-00472-5

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-023-00472-5

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().