{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T04:02:40Z","timestamp":1750737760852,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819665785","type":"print"},{"value":"9789819665792","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-6579-2_27","type":"book-chapter","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T12:06:45Z","timestamp":1750680405000},"page":"399-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proximal Point Method for\u00a0Online Saddle Point Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4014-7405","authenticated-orcid":false,"given":"Qing-xin","family":"Meng","sequence":"first","affiliation":[]},{"given":"Jian-wei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,24]]},"reference":[{"key":"27_CR1","unstructured":"Abernethy, J., Lai, K.A., Levy, K.Y., Wang, J.K.: Faster rates for convex-concave games. In: Bubeck, S., Perchet, V., Rigollet, P. (eds.) Proceedings of the 31st Conference On Learning Theory. Proceedings of Machine Learning Research, vol.\u00a075, pp. 1595\u20131625. PMLR (2018). https:\/\/proceedings.mlr.press\/v75\/abernethy18a.html"},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"Anagnostides, I., Daskalakis, C., Farina, G., Fishelson, M., Golowich, N., Sandholm, T.: Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 736\u2013749. STOC 2022, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3519935.3520031","DOI":"10.1145\/3519935.3520031"},{"key":"27_CR3","unstructured":"Anagnostides, I., Panageas, I., Farina, G., Sandholm, T.: On the convergence of no-regret learning dynamics in time-varying games. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)"},{"key":"27_CR4","doi-asserted-by":"publisher","unstructured":"Awerbuch, B., Kleinberg, R.: Online linear optimization and adaptive routing. J. Comput. Syst. Sci. 74(1), 97\u2013114 (2008). https:\/\/doi.org\/10.1016\/j.jcss.2007.04.016, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000007000621, learning Theory 2004","DOI":"10.1016\/j.jcss.2007.04.016"},{"key":"27_CR5","unstructured":"Campolongo, N., Orabona, F.: Temporal variability in implicit online learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol.\u00a033, pp. 12377\u201312387. Curran Associates, Inc. (2020). https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/9239be5f9dc4058ec647f14fd04b1290-Abstract.html"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Campolongo, N., Orabona, F.: A closer look at temporal variability in dynamic online learning. arXiv e-prints arXiv:2102.07666 (2021). https:\/\/doi.org\/10.48550\/arXiv.2102.07666","DOI":"10.48550\/arXiv.2102.07666"},{"key":"27_CR7","unstructured":"Cardoso, A.R., Abernethy, J., Wang, H., Xu, H.: Competing against Nash equilibria in adversarially changing zero-sum games. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a097, pp. 921\u2013930. PMLR (2019). https:\/\/proceedings.mlr.press\/v97\/cardoso19a.html"},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Cardoso, A.R., Wang, H., Xu, H.: The online saddle point problem and online convex optimization with knapsacks. arXiv e-prints (2018). https:\/\/doi.org\/10.48550\/arXiv.1806.08301","DOI":"10.48550\/arXiv.1806.08301"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Carmon, Y., Jin, Y., Sidford, A., Tian, K.: Coordinate methods for matrix games. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 283\u2013293. IEEE Computer Society, Los Alamitos, CA, USA (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00035","DOI":"10.1109\/FOCS46700.2020.00035"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993). https:\/\/doi.org\/10.1137\/0803026","journal-title":"SIAM J. Optim."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.geb.2014.01.003","volume":"92","author":"C Daskalakis","year":"2015","unstructured":"Daskalakis, C., Deckelbaum, A., Kim, A.: Near-optimal no-regret algorithms for zero-sum games. Games Econom. Behav. 92, 327\u2013348 (2015). https:\/\/doi.org\/10.1016\/j.geb.2014.01.003","journal-title":"Games Econom. Behav."},{"key":"27_CR12","unstructured":"Daskalakis, C.C., Fishelson, M., Golowich, N.: Near-optimal no-regret learning in general games. In: Beygelzimer, A., Dauphin, Y., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems (2021)"},{"key":"27_CR13","unstructured":"Fiez, T., Sim, R., Skoulakis, E.P., Piliouras, G., Ratliff, L.J.: Online learning in periodic zero-sum games. In: Beygelzimer, A., Dauphin, Y., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems (2021)"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.E.: Adaptive game playing using multiplicative weights. Games Econom. Behav. 29(1), 79\u2013103 (1999). https:\/\/doi.org\/10.1006\/game.1999.0738","journal-title":"Games Econom. Behav."},{"issue":"10","key":"27_CR15","doi-asserted-by":"publisher","first-page":"6634","DOI":"10.1109\/TITS.2020.2986158","volume":"22","author":"Z Guo","year":"2021","unstructured":"Guo, Z., Zhang, Y., Lv, J., Liu, Y., Liu, Y.: An online learning collaborative method for traffic forecasting and routing optimization. IEEE Trans. Intell. Transp. Syst. 22(10), 6634\u20136645 (2021). https:\/\/doi.org\/10.1109\/TITS.2020.2986158","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"27_CR16","first-page":"281","volume":"1","author":"M Herbster","year":"2001","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best linear predictor. J. Mach. Learn. Res. 1, 281\u2013309 (2001)","journal-title":"J. Mach. Learn. Res."},{"key":"27_CR17","doi-asserted-by":"publisher","unstructured":"Ho-Nguyen, N., K\u0131l\u0131n\u00e7-Karzan, F.: Exploiting problem structure in optimization under uncertainty via online convex optimization. Math. Program. 177(1), 113\u2013147 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1262-8","DOI":"10.1007\/s10107-018-1262-8"},{"key":"27_CR18","unstructured":"Hsieh, Y.G., Antonakopoulos, K., Mertikopoulos, P.: Adaptive learning in continuous games: optimal regret bounds and convergence to Nash equilibrium. In: Belkin, M., Kpotufe, S. (eds.) Proceedings of Thirty Fourth Conference on Learning Theory. Proceedings of Machine Learning Research, vol.\u00a0134, pp. 2388\u20132422. PMLR (2021). https:\/\/proceedings.mlr.press\/v134\/hsieh21a.html"},{"key":"27_CR19","unstructured":"Jin, Y., Sidford, A., Tian, K.: Sharper rates for separable minimax and finite sum optimization via primal-dual extragradient methods. In: Loh, P.L., Raginsky, M. (eds.) Proceedings of Thirty Fifth Conference on Learning Theory. Proceedings of Machine Learning Research, vol.\u00a0178, pp. 4362\u20134415. PMLR (2022). https:\/\/proceedings.mlr.press\/v178\/jin22b.html"},{"issue":"3","key":"27_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1215\/S0012-7094-41-00838-4","volume":"8","author":"S Kakutani","year":"1941","unstructured":"Kakutani, S.: A generalization of brouwer\u2019s fixed point theorem. Duke Math. J. 8(3), 457\u2013459 (1941). https:\/\/doi.org\/10.1215\/S0012-7094-41-00838-4","journal-title":"Duke Math. J."},{"key":"27_CR21","doi-asserted-by":"publisher","unstructured":"Lykouris, T., Syrgkanis, V., Tardos, E.: Learning and efficiency in games with dynamic population. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 120\u2013129. SODA 2016, Society for Industrial and Applied Mathematics, USA (2016). https:\/\/doi.org\/10.5555\/2884435.2884444","DOI":"10.5555\/2884435.2884444"},{"key":"27_CR22","doi-asserted-by":"publisher","unstructured":"Meng, Q., Liu, J.: Proximal point method for online saddle point problem. arXiv e-prints arXiv:2407.04591 (2024). https:\/\/doi.org\/10.48550\/arXiv.2407.04591, https:\/\/github.com\/qingxin6174\/PPM-for-OSP","DOI":"10.48550\/arXiv.2407.04591"},{"issue":"4","key":"27_CR23","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1287\/moor.2016.0778","volume":"41","author":"P Mertikopoulos","year":"2016","unstructured":"Mertikopoulos, P., Sandholm, W.H.: Learning in games via reinforcement and regularization. Math. Oper. Res. 41(4), 1297\u20131324 (2016). https:\/\/doi.org\/10.1287\/moor.2016.0778","journal-title":"Math. Oper. Res."},{"key":"27_CR24","doi-asserted-by":"publisher","unstructured":"Mertikopoulos, P., Zhou, Z.: Learning in games with continuous action sets and unknown payoff functions. arXiv e-prints arXiv:1608.07310 (2016). https:\/\/doi.org\/10.48550\/arXiv.1608.07310","DOI":"10.48550\/arXiv.1608.07310"},{"key":"27_CR25","doi-asserted-by":"publisher","unstructured":"Rakhlin, A., Sridharan, K.: Optimization, learning, and games with predictable sequences. In: Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2, pp. 3066\u20133074. NIPS 2013, Curran Associates Inc., Red Hook, NY, USA (2013). https:\/\/doi.org\/10.5555\/2999792.2999954","DOI":"10.5555\/2999792.2999954"},{"issue":"5","key":"27_CR26","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14(5), 877\u2013898 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control. Optim."},{"key":"27_CR27","doi-asserted-by":"publisher","unstructured":"Roy, A., Chen, Y., Balasubramanian, K., Mohapatra, P.: Online and bandit algorithms for nonstationary stochastic saddle-point optimization. arXiv e-prints (2019). https:\/\/doi.org\/10.48550\/arXiv.1912.01698","DOI":"10.48550\/arXiv.1912.01698"},{"key":"27_CR28","doi-asserted-by":"publisher","unstructured":"Schapire, R., Cesa-Bianchi, N., Auer, P., Freund, Y.: Gambling in a rigged casino: The adversarial multi-armed bandit problem. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, p.\u00a0322. IEEE Computer Society, Los Alamitos, CA, USA (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492488","DOI":"10.1109\/SFCS.1995.492488"},{"key":"27_CR29","doi-asserted-by":"publisher","unstructured":"Song, C., Liu, J., Liu, H., Jiang, Y., Zhang, T.: Fully implicit online learning. arXiv e-prints (2018). https:\/\/doi.org\/10.48550\/arXiv.1809.09350","DOI":"10.48550\/arXiv.1809.09350"},{"key":"27_CR30","doi-asserted-by":"publisher","unstructured":"Syrgkanis, V., Agarwal, A., Luo, H., Schapire, R.E.: Fast convergence of regularized learning in games. In: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 2, pp. 2989\u20132997. NIPS\u201915, MIT Press, Cambridge, MA, USA (2015). https:\/\/doi.org\/10.5555\/2969442.2969573","DOI":"10.5555\/2969442.2969573"},{"issue":"1","key":"27_CR31","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J von Neumann","year":"1928","unstructured":"von Neumann, J.: Zur theorie der gesellschaftsspiele. Math. Ann. 100(1), 295\u2013320 (1928). https:\/\/doi.org\/10.1007\/BF01448847","journal-title":"Math. Ann."},{"key":"27_CR32","unstructured":"Zhang, L., Lu, S., Zhou, Z.H.: Adaptive online learning in dynamic environments. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol.\u00a031, pp. 1323\u20131333. Curran Associates, Inc. (2018). https:\/\/proceedings.neurips.cc\/paper\/2018\/file\/10a5ab2db37feedfdeaab192ead4ac0e-Paper.pdf"},{"key":"27_CR33","unstructured":"Zhang, M., Zhao, P., Luo, H., Zhou, Z.H.: No-regret learning in time-varying zero-sum games. In: Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., Sabato, S. (eds.) Proceedings of the 39th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a0162, pp. 26772\u201326808. PMLR (2022). https:\/\/proceedings.mlr.press\/v162\/zhang22an.html"},{"key":"27_CR34","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Fawcett, T., Mishra, N. (eds.) Proceedings of the Twentieth International Conference on Machine Learning, pp. 928\u2013935. ICML 2003, AAAI Press (2003)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-6579-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T12:06:52Z","timestamp":1750680412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-6579-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819665785","9789819665792"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-6579-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2024.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}