{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T16:01:02Z","timestamp":1783440062716,"version":"3.54.6"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Science and Technology Innovation 2030","award":["2021ZD0201405"],"award-info":[{"award-number":["2021ZD0201405"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10994-022-06239-z","type":"journal-article","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T11:10:48Z","timestamp":1669201848000},"page":"1819-1838","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Local AdaGrad-type algorithm for stochastic convex-concave optimization"],"prefix":"10.1007","volume":"113","author":[{"given":"Luofeng","family":"Liao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5659-3464","authenticated-orcid":false,"given":"Li","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Duan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mladen","family":"Kolar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"key":"6239_CR1","unstructured":"Antonakopoulos, K., Belmega, V., & Mertikopoulos, P. (2021). Adaptive extra-gradient methods for min-max optimization and games. In International conference on learning representations."},{"key":"6239_CR2","unstructured":"Arjovsky, M. & Bottou, L. (2017). Towards principled methods for training generative adversarial networks. arXiv preprint arXiv:1701.04862."},{"key":"6239_CR3","unstructured":"Arjovsky, M., Chintala, S., & Bottou, L. (2017). Wasserstein generative adversarial networks. In D.\u00a0Precup & Y.\u00a0W. Teh, (Eds.) Proceedings of the 34th international conference on machine learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, volume\u00a070 of Proceedings of Machine Learning Research, (pp. 214\u2013223). PMLR."},{"key":"6239_CR4","unstructured":"Azizian, W., Mitliagkas, I., Lacoste-Julien, S., & Gidel, G. (2020). A tight and unified analysis of gradient-based methods for a whole spectrum of differentiable games. In International conference on artificial intelligence and statistics, (pp. 2863\u20132873). PMLR."},{"key":"6239_CR5","unstructured":"Babanezhad, R. & Lacoste-Julien, S. (2020). Geometry-aware universal mirror-prox. arXiv preprint arXiv:2011.11203."},{"key":"6239_CR6","unstructured":"Bach, F. & Levy, K. Y. (2019). A universal algorithm for variational inequalities adaptive to smoothness and noise. In Conference on learning theory, (pp. 164\u2013194). PMLR."},{"key":"6239_CR7","unstructured":"Beznosikov, A., Samokhin, V., & Gasnikov, A. (2021). Distributed saddle-point problems: Lower bounds, optimal algorithms and federated gans. arXiv preprint arXiv:2010.13112."},{"key":"6239_CR8","unstructured":"Brock, A., Donahue, J., & Simonyan, K. (2019). Large scale gan training for high fidelity natural image synthesis. In International conference on learning representations."},{"issue":"1","key":"6239_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2010","unstructured":"Chambolle, A., & Pock, T. (2010). A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision, 40(1), 120\u2013145.","journal-title":"Journal of Mathematical Imaging and Vision"},{"key":"6239_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03886-5","volume-title":"Superconcentration and Related Topics","author":"S Chatterjee","year":"2014","unstructured":"Chatterjee, S. (2014). Superconcentration and Related Topics. Springer International Publishing."},{"key":"6239_CR11","unstructured":"Chen, T., Guo, Z., Sun, Y., & Yin, W. (2021). Cada: Communication-adaptive distributed adam. In International Conference on Artificial Intelligence and Statistics, (pp. 613\u2013621). PMLR."},{"key":"6239_CR12","unstructured":"Chen, X., Liu, S., Sun, R., & Hong, M. (2019). On the convergence of a class of adam-type algorithms for non-convex optimization. In International conference on learning representations."},{"key":"6239_CR13","unstructured":"Chen, C., Shen, L., Zou, F., & Liu, W. (2021). Towards practical adam: Non-convexity, convergence theory, and mini-batch acceleration. arXiv preprint arXiv:2101.05471."},{"key":"6239_CR14","unstructured":"Chen, X., Yang, S., Shen, L., & Pang, X. (2020). A distributed training algorithm of generative adversarial networks with quantized gradients. arXiv preprint arXiv:2010.13359."},{"key":"6239_CR15","unstructured":"Chen, Z., Yuan, Z., Yi, J., Zhou, B., Chen, E., & Yang, T. (2019). Universal stagewise learning for non-convex problems with convergence on averaged solutions. In International conference on learning representations."},{"issue":"4","key":"6239_CR16","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., & Ouyang, Y. (2014). Optimal primal-dual methods for a class of saddle point problems. SIAM Journal on Optimization, 24(4), 1779\u20131814.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"6239_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10107-017-1161-4","volume":"165","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Lan, G., & Ouyang, Y. (2017). Accelerated schemes for a class of variational inequalities. Mathematical Programming, 165(1), 113\u2013149.","journal-title":"Mathematical Programming"},{"issue":"5","key":"6239_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3470890","volume":"12","author":"C Chen","year":"2021","unstructured":"Chen, C., Shen, L., Huang, H., & Liu, W. (2021). Quantized adam with error feedback. ACM Transactions on Intelligent Systems and Technology (TIST), 12(5), 1\u201326.","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"6239_CR19","unstructured":"Daskalakis, C., Ilyas, A., Syrgkanis, V., & Zeng, H. (2018). Training GANs with optimism. In International conference on learning representations."},{"issue":"3","key":"6239_CR20","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., & Ye, Y. (2010). Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations Research, 58(3), 595\u2013612.","journal-title":"Operations Research"},{"key":"6239_CR21","unstructured":"Deng, Y., & Mahdavi, M. (Apr 2021). Local stochastic gradient descent ascent: Convergence analysis and communication efficiency. In Proceedings of The 24th international conference on artificial intelligence and statistics, volume 130 of proceedings of machine learning research, (pp. 1387\u20131395). PMLR, 13\u201315."},{"key":"6239_CR22","doi-asserted-by":"crossref","unstructured":"Deng, J., Dong, W., Socher, R., Li, L. -J., Li, K., & Fei-Fei, L. (2009). Imagenet: A large-scale hierarchical image database. In 2009 IEEE conference on computer vision and pattern recognition, (pp. 248\u2013255). Ieee.","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"6239_CR23","unstructured":"Deng, Y., Kamani, M. M., & Mahdavi, M. (2020). Distributionally robust federated averaging. In Advances in neural information processing systems, (vol\u00a033, pp. 15111\u201315122). Curran Associates, Inc., ."},{"key":"6239_CR24","unstructured":"Duchi, J., Hazan, E., & Singer, Y. (2011). Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12(7)."},{"key":"6239_CR25","unstructured":"Ene, A., & Nguyen, H. L. (2020). Adaptive and universal single-gradient algorithms for variational inequalities. arXiv preprint arXiv:2010.07799."},{"key":"6239_CR26","unstructured":"Gidel, G., Berard, H., Vignoud, G., Vincent, P., & Lacoste-Julien, S. (2019). A variational inequality perspective on generative adversarial networks. In International conference on learning representations."},{"key":"6239_CR27","unstructured":"Gidel, G., Hemmat, R. A., Pezeshki, M., Le\u00a0Priol, R., Huang, G., Lacoste-Julien, S., & Mitliagkas, I. (2019). Negative momentum for improved game dynamics. In The 22nd international conference on artificial intelligence and statistics, (pp. 1802\u20131811). PMLR."},{"key":"6239_CR28","unstructured":"Goodfellow, I. J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A. C., & Bengio, Y. (2014). Generative adversarial nets. In NIPS."},{"key":"6239_CR29","unstructured":"Guo, Z., Liu, M., Yuan, Z., Shen, L., Liu, W., & Yang, T. (2020). Communication-efficient distributed stochastic auc maximization with deep neural networks. In International conference on machine learning, (pp. 3864\u20133874). PMLR."},{"key":"6239_CR30","unstructured":"Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., & Hochreiter, S. (2017). Gans trained by a two time-scale update rule converge to a local nash equilibrium. In NIPS."},{"key":"6239_CR31","unstructured":"Hou, C., Thekumparampil, K. K., Fanti, G., & Oh, S. (2021). Efficient algorithms for federated saddle point optimization."},{"issue":"9","key":"6239_CR32","doi-asserted-by":"publisher","first-page":"149","DOI":"10.7551\/mitpress\/8996.003.0008","volume":"30","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A., et al. (2011). First order methods for nonsmooth convex large-scale optimization, ii: utilizing problems structure. Optimization for Machine Learning, 30(9), 149\u2013183.","journal-title":"Optimization for Machine Learning"},{"issue":"1","key":"6239_CR33","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/10-SSY011","volume":"1","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A., & Tauvel, C. (2011). Solving variational inequalities with stochastic mirror-prox algorithm. Stochastic Systems, 1(1), 17\u201358.","journal-title":"Stochastic Systems"},{"key":"6239_CR34","unstructured":"Kingma, D. P. & Adam, J. B. (2017). A method for stochastic optimization. In International conference on learning representations."},{"key":"6239_CR35","unstructured":"Korpelevich, G. M. (1976). The extragradient method for finding saddle points and other problems. Matecon."},{"key":"6239_CR36","unstructured":"Li, X., Huang, K., Yang, W., Wang, S., & Zhang, Z. (2020). On the convergence of fedavg on non-iid data. In International conference on learning representations."},{"key":"6239_CR37","unstructured":"Lin, T., Jin, C., & Jordan, M. I. (2020). Near-optimal algorithms for minimax optimization. In Conference on learning theory, (pp. 2738\u20132779). PMLR."},{"key":"6239_CR38","unstructured":"Lin, T., Stich, S. U., Patel, K. K., & Jaggi, M. (2020). Don\u2019t use large mini-batches, use local sgd. In International conference on learning representations."},{"key":"6239_CR39","unstructured":"Liu, M., Mroueh, Y., Ross, J., Zhang, W., Cui, X., Das, P., & Yang, T. (2020). Towards better understanding of adaptive gradient algorithms in generative adversarial nets. In International conference on learning representations."},{"key":"6239_CR40","unstructured":"Liu, M., Zhang, W., Mroueh, Y., Cui, X., Ross, J., Yang, T., & Das, P. (2020). A decentralized parallel algorithm for training generative adversarial nets. (vol\u00a033)."},{"key":"6239_CR41","doi-asserted-by":"crossref","unstructured":"McMahan, H. B., Avent, B., Bellet, A., Bennis, M., Bhagoji, A. N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R. and D\u2019Oliveira, R. G. (2021). Advances and open problems in federated learning. Foundations and Trends\u00ae in Machine Learning, 14(1).","DOI":"10.1561\/2200000083"},{"key":"6239_CR42","unstructured":"Mertikopoulos, P., Lecouat, B., Zenati, H., Foo, C. -S., Chandrasekhar, V., & Piliouras, G. (2019). Optimistic mirror descent in saddle-point problems: Going the extra(-gradient) mile. In International conference on learning representations."},{"key":"6239_CR43","doi-asserted-by":"crossref","unstructured":"Mertikopoulos, P., Papadimitriou, C., & Piliouras, G. (2018). Cycles in adversarial regularized learning. In Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms, (pp. 2703\u20132717). SIAM.","DOI":"10.1137\/1.9781611975031.172"},{"key":"6239_CR44","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1137\/100801652","volume":"21","author":"RDC Monteiro","year":"2011","unstructured":"Monteiro, R. D. C., & Svaiter, B. F. (2011). Complexity of variants of tseng\u2019s modified f-b splitting and korpelevich\u2019s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM Journal on Optimization, 21, 1688\u20131720.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"6239_CR45","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A. (2004). Prox-method with rate of convergence o (1\/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM Journal on Optimization, 15(1), 229\u2013251.","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"6239_CR46","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009). Robust stochastic approximation approach to stochastic programming. SIAM Journal on Optimization, 19(4), 1574\u20131609.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"6239_CR47","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"Jv Neumann","year":"1928","unstructured":"Neumann, Jv. (1928). Zur theorie der gesellschaftsspiele. Mathematische Annalen, 100(1), 295\u2013320.","journal-title":"Mathematische Annalen"},{"key":"6239_CR48","unstructured":"Reddi, S. J., Charles, Z., Zaheer, M., Garrett, Z., Rush, K., Kone\u010dn\u00fd, J., Kumar, S., & McMahan, H. B. (2021). Adaptive federated optimization. In International conference on learning representations."},{"key":"6239_CR49","unstructured":"Reddi, S. J., Kale, S., & Kumar, S. (2018). On the convergence of adam and beyond. In International conference on learning representations."},{"key":"6239_CR50","unstructured":"Rogozin, A., Beznosikov, A., Dvinskikh, D., Kovalev, D., Dvurechensky, P., & Gasnikov, A. (2021). Decentralized distributed optimization for saddle point problems."},{"issue":"1\u20132","key":"6239_CR51","doi-asserted-by":"publisher","first-page":"703","DOI":"10.14778\/1920841.1920931","volume":"3","author":"A Smola","year":"2010","unstructured":"Smola, A., & Narayanamurthy, S. (2010). An architecture for parallel topic models. Proceedings of the VLDB Endowment, 3(1\u20132), 703\u2013710.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"6239_CR52","unstructured":"Stich, S. U. (2019). Local SGD converges fast and communicates little. In International conference on learning representations."},{"key":"6239_CR53","unstructured":"Wang, J., Zhang, T., Liu, S., Chen, P. -Y., Xu, J., Fardad, M., & Li, B. (2019). Towards a unified min-max framework for adversarial exploration and robustness. arXiv preprint arXiv:1906.03563."},{"key":"6239_CR54","unstructured":"Xie, C., Koyejo, O., Gupta, I., & Lin, H. (2019). Local adaalter: Communication-efficient stochastic gradient descent with adaptive learning rates. arXiv preprint arXiv:1911.09030."},{"key":"6239_CR55","unstructured":"Yan, Y., & Xu, Y. (2020). Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs. arXiv preprint arXiv:2012.14943."},{"key":"6239_CR56","unstructured":"Yu, H., Jin, R., & Yang, S. (Jun 2019). On the linear speed-up analysis of communication efficient momentum SGD for distributed non-convex optimization. In Proceedings of the 36th international conference on machine learning, volume\u00a097 of proceedings of machine learning research, (pp. 7184\u20137193). PMLR, 09\u201315."},{"key":"6239_CR57","unstructured":"Zhang, J., Xiao, P., Sun, R., & Luo, Z. (2020). A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems. In Advances in neural information processing systems, (vol 33, pp. 7377\u20137389). Curran Associates, Inc., ."},{"key":"6239_CR58","doi-asserted-by":"crossref","unstructured":"Zhao, R. (2021). Accelerated stochastic algorithms for convex-concave saddle-point problems. arXiv preprint arXiv:1903.01687.","DOI":"10.1287\/moor.2021.1175"},{"key":"6239_CR59","doi-asserted-by":"crossref","unstructured":"Zou, F., Shen, L., Jie, Z., Zhang, W., & Liu, W. (2019). A sufficient condition for convergences of adam and rmsprop. In Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, (pp. 11127\u201311135).","DOI":"10.1109\/CVPR.2019.01138"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06239-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06239-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06239-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T17:12:18Z","timestamp":1711645938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06239-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,23]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["6239"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06239-z","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,23]]},"assertion":[{"value":"20 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not Applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not Applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}