{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:58:13Z","timestamp":1754488693315,"version":"3.40.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["2127696"],"award-info":[{"award-number":["2127696"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007899","name":"University of Arizona","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007899","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10915-025-02864-7","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T20:55:48Z","timestamp":1743713748000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Single-Loop Projection-Free and Projected Gradient-Based Algorithms for Nonconvex-Concave Saddle Point Problems with Bilevel Structure"],"prefix":"10.1007","volume":"103","author":[{"given":"Mohammad Mahdi","family":"Ahmadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3229-3499","authenticated-orcid":false,"given":"Erfan","family":"Yazdandoost Hamedani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"2864_CR1","unstructured":"Abolfazli, N., Jiang, R., Mokhtari, A., Hamedani, E.Y.: An inexact conditional gradient method for constrained bilevel optimization. arXiv preprint arXiv:2306.02429 (2023)"},{"key":"2864_CR2","doi-asserted-by":"publisher","first-page":"6332","DOI":"10.1109\/TSP.2023.3234462","volume":"70","author":"Z Akhtar","year":"2022","unstructured":"Akhtar, Z., Bedi, A.S., Thomdapu, S.T., Rajawat, K.: Projection-free stochastic bi-level optimization. IEEE Trans. Signal Process. 70, 6332\u20136347 (2022)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"2864_CR3","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/0362-546X(94)00186-L","volume":"24","author":"P Bernhard","year":"1995","unstructured":"Bernhard, P., Rapaport, A.: On a theorem of danskin with an application to a theorem of von neumann-sion. Nonlinear Anal.: Theory Methods Appl. 24(8), 1163\u20131181 (1995)","journal-title":"Nonlinear Anal.: Theory Methods Appl."},{"key":"2864_CR4","unstructured":"Boroun, M., Yazdandoost\u00a0Hamedani, E., Jalilzadeh, A.: Projection-free methods for solving nonconvex-concave saddle point problems. Adv. Neural Inf. Process. Syst. 36 (2024)"},{"issue":"1","key":"2864_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J Bracken","year":"1973","unstructured":"Bracken, J., McGill, J.T.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21(1), 37\u201344 (1973)","journal-title":"Oper. Res."},{"key":"2864_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007379606734","volume":"28","author":"R Caruana","year":"1997","unstructured":"Caruana, R.: Multitask learning. Mach. Learn. 28, 41\u201375 (1997)","journal-title":"Mach. Learn."},{"issue":"1\u20132","key":"2864_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"2864_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"2864_CR9","unstructured":"Chen, C., Chen, X., Ma, C., Liu, Z., Liu, X.: Gradient-based bi-level optimization for deep learning: A survey. arXiv preprint arXiv:2207.11719 (2022)"},{"key":"2864_CR10","first-page":"10799","volume":"33","author":"C Chen","year":"2020","unstructured":"Chen, C., Luo, L., Zhang, W., Yu, Y.: Efficient projection-free algorithms for saddle point problems. Adv. Neural. Inf. Process. Syst. 33, 10799\u201310808 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2864_CR11","unstructured":"Chen, T., Sun, Y., Xiao, Q., Yin, W.: A single-timescale method for stochastic bilevel optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 2466\u20132488. PMLR (2022)"},{"key":"2864_CR12","unstructured":"Domke, J.: Generic methods for optimization-based modeling. In: Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, pp. 318\u2013326 (2012)"},{"key":"2864_CR13","unstructured":"Franceschi, L., Frasconi, P., Salzo, S., Grazzi, R., Pontil, M.: Bilevel programming for hyperparameter optimization and meta-learning. In: International Conference on Machine Learning, pp. 1568\u20131577. PMLR (2018)"},{"issue":"1\u20132","key":"2864_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"2864_CR15","unstructured":"Ghadimi, S., Wang, M.: Approximation methods for bilevel programming. arXiv preprint arXiv:1802.02246 (2018)"},{"key":"2864_CR16","unstructured":"Gidel, G., Jebara, T., Lacoste-Julien, S.: Frank-wolfe algorithms for saddle point problems. In: Artificial Intelligence and Statistics, pp. 362\u2013371. PMLR (2017)"},{"key":"2864_CR17","unstructured":"Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014)"},{"key":"2864_CR18","unstructured":"Gould, S., Fernando, B., Cherian, A., Anderson, P., Cruz, R.S., Guo, E.: On differentiating parameterized argmin and argmax problems with application to bi-level optimization. arXiv preprint arXiv:1607.05447 (2016)"},{"key":"2864_CR19","unstructured":"Grazzi, R., Franceschi, L., Pontil, M., Salzo, S.: On the iteration complexity of hypergradient computation. In: International Conference on Machine Learning, pp. 3748\u20133758. PMLR (2020)"},{"key":"2864_CR20","unstructured":"Gu, A., Lu, S., Ram, P., Weng, L.: Nonconvex min-max bilevel optimization for task robust meta learning. In: International Conference on Machine Learning (2021)"},{"key":"2864_CR21","unstructured":"Gu, A., Lu, S., Ram, P., Weng, T.W.: Min-max multi-objective bilevel optimization with applications in robust machine learning. In: The Eleventh International Conference on Learning Representations (2022)"},{"issue":"2","key":"2864_CR22","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/18M1213488","volume":"31","author":"EY Hamedani","year":"2021","unstructured":"Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm with line search for general convex-concave saddle point problems. SIAM J. Optim. 31(2), 1299\u20131329 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2864_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1137\/20M1387341","volume":"33","author":"M Hong","year":"2023","unstructured":"Hong, M., Wai, H.T., Wang, Z., Yang, Z.: A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor-critic. SIAM J. Optim. 33(1), 147\u2013180 (2023)","journal-title":"SIAM J. Optim."},{"key":"2864_CR24","first-page":"29552","volume":"35","author":"Q Hu","year":"2022","unstructured":"Hu, Q., Zhong, Y., Yang, T.: Multi-block min-max bilevel optimization with applications in multi-task deep auc maximization. Adv. Neural. Inf. Process. Syst. 35, 29552\u201329565 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2864_CR25","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp. 427\u2013435 (2013)"},{"key":"2864_CR26","unstructured":"Ji, K., Yang, J., Liang, Y.: Provably faster algorithms for bilevel optimization and applications to meta-learning (2020)"},{"key":"2864_CR27","first-page":"30271","volume":"34","author":"P Khanduri","year":"2021","unstructured":"Khanduri, P., Zeng, S., Hong, M., Wai, H.T., Wang, Z., Yang, Z.: A near-optimal algorithm for stochastic bilevel optimization via double-momentum. Adv. Neural. Inf. Process. Syst. 34, 30271\u201330283 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2864_CR28","unstructured":"Kolmogorov, V., Pock, T.: One-sided frank-wolfe algorithms for saddle problems. In: International Conference on Machine Learning, pp. 5665\u20135675. PMLR (2021)"},{"key":"2864_CR29","unstructured":"Kwon, J., Kwon, D., Wright, S., Nowak, R.: A fully first-order method for stochastic bilevel optimization. arXiv preprint arXiv:2301.10945 (2023)"},{"key":"2864_CR30","unstructured":"Lan, G.: The complexity of large-scale convex programming under a linear optimization oracle. arXiv preprint arXiv:1309.5550 (2013)"},{"key":"2864_CR31","unstructured":"Lan, G., Pokutta, S., Zhou, Y., Zink, D.: Conditional accelerated lazy stochastic gradient descent. In: International Conference on Machine Learning, pp. 1965\u20131974. PMLR (2017)"},{"key":"2864_CR32","doi-asserted-by":"crossref","unstructured":"Li, J., Gu, B., Huang, H.: A fully single loop algorithm for bilevel optimization without hessian inverse. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a036, pp. 7426\u20137434 (2022)","DOI":"10.1609\/aaai.v36i7.20706"},{"key":"2864_CR33","unstructured":"Lin, T., Jin, C., Jordan, M.: On gradient descent ascent for nonconvex-concave minimax problems. In: International Conference on Machine Learning, pp. 6083\u20136093. PMLR (2020)"},{"key":"2864_CR34","unstructured":"Maclaurin, D., Duvenaud, D., Adams, R.: Gradient-based hyperparameter optimization through reversible learning. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 2113\u20132122 (2015)"},{"key":"2864_CR35","unstructured":"Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. arXiv preprint arXiv:1706.06083 (2017)"},{"key":"2864_CR36","unstructured":"Michel, P., Ruder, S., Yogatama, D.: Balancing average and worst-case accuracy in multitask learning. arXiv preprint arXiv:2110.05838 (2021)"},{"key":"2864_CR37","unstructured":"Namkoong, H., Duchi, J.C.: Stochastic gradient methods for distributionally robust optimization with f-divergences. Adv. Neural Inf. Process. Syst. 29 (2016)"},{"issue":"1","key":"2864_CR38","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: 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 J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2864_CR39","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1137\/20M1337600","volume":"31","author":"DM Ostrovskii","year":"2021","unstructured":"Ostrovskii, D.M., Lowy, A., Razaviyayn, M.: Efficient search of first-order nash equilibria in nonconvex-concave smooth min-max problems. SIAM J. Optim. 31(4), 2508\u20132538 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2864_CR40","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E., Jr.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imag. Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imag. Sci."},{"key":"2864_CR41","unstructured":"Shaban, A., Cheng, C.A., Hatch, N., Boots, B.: Truncated back-propagation for bilevel optimization. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 1723\u20131732. PMLR (2019)"},{"issue":"10","key":"2864_CR42","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1080\/01630563.2018.1477799","volume":"39","author":"Y Shehu","year":"2018","unstructured":"Shehu, Y.: Convergence rate analysis of inertial krasnoselskii-mann type iteration with applications. Numer. Funct. Anal. Optim. 39(10), 1077\u20131091 (2018)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"2864_CR43","unstructured":"Shu, J., Xie, Q., Yi, L., Zhao, Q., Zhou, S., Xu, Z., Meng, D.: Meta-weight-net: Learning an explicit mapping for sample weighting. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"2864_CR44","unstructured":"Sinha, A., Namkoong, H., Duchi, J.: Certifying some distributional robustness with principled adversarial training. In: International Conference on Learning Representations (2018)"},{"key":"2864_CR45","doi-asserted-by":"crossref","unstructured":"Xu, Z., Zhang, H., Xu, Y., Lan, G.: A unified single-loop alternating gradient projection algorithm for nonconvex\u2013concave and convex\u2013nonconcave minimax problems. Mathematical Programming pp. 1\u201372 (2023)","DOI":"10.1007\/s10107-022-01919-z"},{"key":"2864_CR46","unstructured":"Yang, H., Luo, L., Li, C.J., Jordan, M., Fazel, M.: Accelerating inexact hypergradient descent for bilevel optimization. In: OPT 2023: Optimization for Machine Learning (2023)"},{"key":"2864_CR47","first-page":"7377","volume":"33","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Xiao, P., Sun, R., Luo, Z.: A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems. Adv. Neural. Inf. Process. Syst. 33, 7377\u20137389 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2864_CR48","unstructured":"Zhang, Y., Zhang, G., Khanduri, P., Hong, M., Chang, S., Liu, S.: Revisiting and advancing fast adversarial training through the lens of bi-level optimization. In: International Conference on Machine Learning, pp. 26693\u201326712. PMLR (2022)"},{"key":"2864_CR49","doi-asserted-by":"crossref","unstructured":"Zhao, R.: A primal-dual smoothing framework for max-structured non-convex optimization. Mathematics of operations research (2023)","DOI":"10.1287\/moor.2023.1387"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02864-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02864-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02864-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T19:10:49Z","timestamp":1745694649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02864-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,1]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["2864"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02864-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,4,1]]},"assertion":[{"value":"10 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"52"}}