{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:08:51Z","timestamp":1783397331328,"version":"3.54.6"},"reference-count":55,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"crossref","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002674","name":"Russian Academy of Sciences","doi-asserted-by":"publisher","award":["70-2021-00142"],"award-info":[{"award-number":["70-2021-00142"]}],"id":[{"id":"10.13039\/501100002674","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2025,9,3]]},"DOI":"10.1080\/10556788.2025.2463986","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:33:24Z","timestamp":1743244404000},"page":"1249-1266","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["Distributed saddle point problems: lower bounds, near-optimal and robust algorithms"],"prefix":"10.1080","volume":"40","author":[{"given":"Aleksandr","family":"Beznosikov","sequence":"first","affiliation":[{"name":"Laboratory of Federated Learning Problems, Ivannikov Institute for System Programming of the RAS","place":["Moscow, Russia"]},{"name":"BRAIn Lab, Moscow Institute of Physics and Technology","place":["Moscow, Russia"]},{"name":"Center for Applied Artificial Intelligence, The Russian Presidential Academy of National Economy and Public Administration","place":["Moscow, Russia"]},{"name":"Artificial Intelligence Centre, Innopolis University","place":["Innopolis, Russia"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valentin","family":"Samokhin","sequence":"additional","affiliation":[{"name":"AGI Med Lab, Artificial Intelligence Research Institute","place":["Moscow, Russia"]},{"name":"Department of Data Analysis in Neuroscience, Institute for Information Transmission Problems of the RAS","place":["Moscow, Russia"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Centre, Innopolis University","place":["Innopolis, Russia"]},{"name":"Artificial Intelligence Center, Ivannikov Institute for System Programming of the RAS","place":["Moscow, Russia"]},{"name":"Laboratory of Mathematical Methods of Optimization, Moscow Institute of Physics and Technology","place":["Moscow, Russia"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"e_1_3_4_2_1","unstructured":"S. Abadeh P. Esfahani and D. Kuhn Distributionally robust logistic regression in Advances in Neural Information Processing Systems (NeurIPS)) C. Cortes N. Lawrence D. Lee M. Sugiyama and R. Garnett eds. Curran Associates Inc. 2015 pp. 1576\u20131584."},{"key":"e_1_3_4_3_1","unstructured":"Y. Arjevani and O. Shamir Communication complexity of distributed convex learning and optimization preprint (2015). Available at arXiv:1506.01900."},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414476"},{"key":"e_1_3_4_5_1","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"Ben-Tal A.","year":"2019","unstructured":"A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, Society for Industrial and Applied Mathematics, USA, 2019."},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"e_1_3_4_8_1","unstructured":"T. Chavdarova G. Gidel F. Fleuret and S. Lacoste-Julien Reducing Noise in Gan Training with Variance Reduced Extragradient preprint (2019). Available at arXiv:1904.08598."},{"key":"e_1_3_4_9_1","unstructured":"C. Daskalakis A. Ilyas V. Syrgkanis and H. Zeng Training Gans with Optimism preprint (2017). Available at arXiv:1711.00141."},{"key":"e_1_3_4_10_1","unstructured":"Y. Deng and M. Mahdavi Local stochastic gradient descent ascent: Convergence analysis and communication efficiency in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics A. Banerjee and F. Fukumizu eds. PMLR 2021 Vol. 130 pp. 1387\u20131395."},{"key":"e_1_3_4_11_1","unstructured":"J. Diakonikolas C. Daskalakis and M. Jordan Efficient methods for structured nonconvex-nonconcave min-max optimization in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics A. Banerjee and F. Fukumizu eds. PMLR 2021 Vol. 130 pp. 2746\u20132754."},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/09076934X"},{"key":"e_1_3_4_13_1","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"Facchinei F.","year":"2007","unstructured":"F. Facchinei and J. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer Series in Operations Research and Financial Engineering, Springer New York, 2007."},{"key":"e_1_3_4_14_1","unstructured":"D.J. Foster A. Sekhari O. Shamir N. Srebro K. Sridharan and B. Woodworth The complexity of making the gradient small in stochastic convex optimization in Proceedings of the Thirty-Second Conference on Learning Theory A. Beygelzimer and D. Hsu eds. PMLR 2019 Vol. 99 pp. 1319\u20131345."},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_4_16_1","unstructured":"G. Gidel H. Berard G. Vignoud P. Vincent and S. Lacoste-Julien A Variational Inequality Perspective on Generative Adversarial Networks preprint (2018). Available at arXiv:1802.10551."},{"key":"e_1_3_4_17_1","unstructured":"I. Goodfellow Nips 2016 Tutorial: Generative Adversarial Networks preprint (2016). Available at arXiv:1701.00160."},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422622"},{"key":"e_1_3_4_19_1","unstructured":"C. Hou K.K. Thekumparampil G. Fanti and S. Oh Efficient Algorithms for Federated Saddle Point Optimization preprint (2021). Available at arXiv:2102.06333."},{"key":"e_1_3_4_20_1","unstructured":"Y.-G. Hsieh F. Iutzeler J. Malick and P. Mertikopoulos On the convergence of single-call stochastic extra-gradient methods in Advances in Neural Information Processing Systems H. Wallach H. Larochelle A. Beygelzimer F. d\u2019Alch\u00e9-Buc E. Fox and R. Garnett eds. Curran Associates Inc. Vol. 32 2019."},{"key":"e_1_3_4_21_1","unstructured":"Y. Jin and A. Sidford Efficiently solving MDPs with stochastic mirror descent in Proceedings of the 37th International Conference on Machine Learning volume 119 of Proceedings of Machine Learning Research H. D. III and A. Singh eds. PMLR 2020 pp. 4890\u20134900."},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/10-SSY011"},{"key":"e_1_3_4_23_1","unstructured":"P. Kairouz H.B. McMahan B. Avent A. Bellet M. Bennis A.N. Bhagoji K. Bonawitz Z. Charles G. Cormode R. Cummings R.G.L. D'Oliveira H. Eichner S. El Rouayheb D. Evans J. Gardner Z. Garrett A. Gasc\u00f3n B. Ghazi P.B. Gibbons M. Gruteser Z. Harchaoui C. He L. He Z. Huo B. Hutchinson J. Hsu M. Jaggi T. Javidi G. Joshi M. Khodak J. Konecn\u00fd A. Korolova F. Koushanfar S. Koyejo T. Lepoint Y. Liu P. Mittal M. Mohri R. Nock A. \u00d6zg\u00fcr R. Pagh M. Raykova H. Qi D. Ramage R. Raskar D. Song W. Song S.U. Stich Z. Sun A.T. Suresh F. Tram\u00e8r P. Vepakomma J. Wang L. Xiong Z. Xu Q. Yang F.X. Yu H. Yu and S. Zhao Advances and Open Problems in Federated Learning preprint (2019). Available at arXiv:1912.04977."},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"e_1_3_4_25_1","unstructured":"D.P. Kingma and J. Ba Adam: A Method for Stochastic Optimization preprint (2014). Available at arXiv:1412.6980."},{"key":"e_1_3_4_26_1","unstructured":"J. Kone\u010dny` H.B. McMahan F.X. Yu P. Richt\u00e1rik A.T. Suresh and D. Bacon Federated Learning: Strategies for Improving Communication Efficiency preprint (2016). Available at arXiv:1610.05492."},{"key":"e_1_3_4_27_1","first-page":"747","article-title":"The extragradient method for finding saddle points and other problems","volume":"12","author":"Korpelevich G.M.","year":"1976","unstructured":"G.M. Korpelevich, The extragradient method for finding saddle points and other problems, Matecon 12 (1976), pp. 747\u2013756.","journal-title":"Matecon"},{"key":"e_1_3_4_28_1","unstructured":"A. Krizhevsky V. Nair and G. Hinton Cifar-10 (Canadian Institute for Advanced Research)."},{"key":"e_1_3_4_29_1","unstructured":"T. Liang and J. Stokes Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks in Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics volume 89 of Proceedings of Machine Learning Research K. Chaudhuri and M. Sugiyama eds. PMLR 2019 pp. 907\u2013915."},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2011.10.005"},{"key":"e_1_3_4_31_1","unstructured":"M. Liu W. Zhang Y. Mroueh X. Cui J. Ross T. Yang and P. Das A Decentralized Parallel Algorithm for Training Generative Adversarial Nets preprint (2019). Available at arXiv:1910.12999."},{"key":"e_1_3_4_32_1","unstructured":"W. Liu A. Mokhtari A. Ozdaglar S. Pattathil Z. Shen and N. Zheng A Decentralized Proximal Point-Type Method for Saddle Point Problems preprint (2019). Available at arXiv:1910.14380."},{"key":"e_1_3_4_33_1","unstructured":"A. Madry A. Makelov L. Schmidt D. Tsipras and A. Vladu Towards deep learning models resistant to adversarial attacks in International Conference on Learning Representations (ICLR) 2018."},{"key":"e_1_3_4_34_1","unstructured":"R. McDonald K. Hall and G. Mann Distributed training strategies for the structured perceptron in Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics 2010 pp. 456\u2013464."},{"key":"e_1_3_4_35_1","unstructured":"R. McDonald K. Hall and G. Mann Distributed training strategies for the structured perceptron in Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics Association for Computational Linguistics Los Angeles CA 2010 pp. 456\u2013464."},{"key":"e_1_3_4_36_1","unstructured":"B. McMahan E. Moore D. Ramage S. Hampson and B.A. y Arcas Communication-efficient learning of deep networks from decentralized data in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics A. Singh and J. Zhu eds. PMLR 2017 Vol. 54 pp. 1273\u20131282."},{"key":"e_1_3_4_37_1","unstructured":"P. Mertikopoulos B. Lecouat H. Zenati C.-S. Foo V. Chandrasekhar and G. Piliouras Optimistic Mirror Descent in Saddle-Point Problems: Going the Extra (Gradient) Mile preprint (2018). Available at arXiv:1807.02629."},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-62-02933-2"},{"key":"e_1_3_4_39_1","unstructured":"M. Mirza and S. Osindero Conditional Generative Adversarial Nets preprint (2014). Available at arXiv:1411.1784."},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304470"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"e_1_3_4_43_1","unstructured":"A.S. Nemirovskij and D.B. Yudin Problem Complexity and Method Efficiency in Optimization 1983."},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0034-z"},{"key":"e_1_3_4_45_1","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov Y.","year":"2014","unstructured":"Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, Vol. 87, Springer Science & Business Media, 2014."},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01420-0"},{"key":"e_1_3_4_47_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1754414"},{"key":"e_1_3_4_48_1","unstructured":"A. Radford L. Metz and S. Chintala Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks preprint (2015). Available at arXiv:1511.06434."},{"key":"e_1_3_4_49_1","unstructured":"A. Rogozin A. Beznosikov D. Dvinskikh D. Kovalev P. Dvurechensky and A. Gasnikov Decentralized Distributed Optimization for Saddle Point Problems preprint (2021). Available at arXiv:2102.07758."},{"key":"e_1_3_4_50_1","unstructured":"K. Scaman F. Bach S. Bubeck Y.T. Lee and L. Massouli\u00e9 Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks preprint (2017). Available at arXiv:1702.08704."},{"key":"e_1_3_4_51_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"e_1_3_4_52_1","unstructured":"Z. Song L. Shi S. Pu and M. Yan Optimal Gradient Tracking for Decentralized Optimization preprint (2021). Available at arXiv:2110.05282."},{"key":"e_1_3_4_53_1","unstructured":"S.U. Stich Local SGD Converges Fast and Communicates Little preprint (2018). Available at arXiv:1805.09767."},{"key":"e_1_3_4_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012998338806"},{"key":"e_1_3_4_55_1","unstructured":"H. Ye L. Luo Z. Zhou and T. Zhang Multi-Consensus Decentralized Accelerated Gradient Descent preprint (2020). Available at arXiv:2005.00797."},{"key":"e_1_3_4_56_1","unstructured":"J. Zhang M. Hong and S. Zhang On Lower Iteration Complexity Bounds for the Saddle Point Problems preprint (2019). Available at arXiv:1912.07481."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2025.2463986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T16:06:10Z","timestamp":1761840370000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2025.2463986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,28]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9,3]]}},"alternative-id":["10.1080\/10556788.2025.2463986"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2025.2463986","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,28]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}