{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T07:11:15Z","timestamp":1772867475339,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61921006"],"award-info":[{"award-number":["61921006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61976112"],"award-info":[{"award-number":["61976112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"jiangsu science foundation","award":["BK20200064"],"award-info":[{"award-number":["BK20200064"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10994-021-06072-w","type":"journal-article","created":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:03:15Z","timestamp":1641168195000},"page":"871-893","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Online strongly convex optimization with unknown delays"],"prefix":"10.1007","volume":"111","author":[{"given":"Yuanyu","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Wei","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5138-3182","authenticated-orcid":false,"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,3]]},"reference":[{"key":"6072_CR1","unstructured":"Abernethy, J. D., Bartlett, P. L., Rakhlin, A., & Tewari, A. (2008). Optimal stragies and minimax lower bounds for online convex games. In Proceedings of the 21st annual conference on learning theory (pp. 415\u2013424)."},{"key":"6072_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Hazan, E., Kale, S., & Schapire, R. E. (2006). Algorithms for portfolio management based on the Newton method. In Proceedings of the 23rd international conference on machine learning (pp. 9\u201316).","DOI":"10.1145\/1143844.1143846"},{"key":"6072_CR3","unstructured":"Agarwal, A., Dekel, O., & Xiao, L. (2010). Optimal algorithms for online convex optimization with multi-point bandit feedback. In Proceedings of the 23rd annual conference on learning theory (pp. 28\u201340)."},{"issue":"3","key":"6072_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1007530728748","volume":"35","author":"A Blum","year":"1999","unstructured":"Blum, A., & Kalai, A. (1999). Universal portfolios with and without transaction costs. Machine Learning, 35(3), 193\u2013205.","journal-title":"Machine Learning"},{"key":"6072_CR5","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. Cambridge University Press.","DOI":"10.1017\/CBO9780511546921"},{"key":"6072_CR6","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., & Singer, Y. (2011). Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12, 2121\u20132159.","journal-title":"Journal of Machine Learning Research"},{"key":"6072_CR7","unstructured":"Flaxman, A. D., Kalai, A. T., & McMahan, H. B. (2005). Online convex optimization in the bandit setting: Gradient descent without a gradient. In Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (pp. 385\u2013394)."},{"key":"6072_CR8","unstructured":"Gaillard, P., Stoltz, G., & van Erven, T. (2014). A second-order bound with excess losses. In Proceedings of the 27th annual conference on learning theory (pp. 176\u2013196)."},{"issue":"3\u20134","key":"6072_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan, E. (2016). Introduction to online convex optimization. Foundations and Trends in Optimization, 2(3\u20134), 157\u2013325.","journal-title":"Foundations and Trends in Optimization"},{"key":"6072_CR10","unstructured":"Hazan, E., & Kale, S. (2012). Projection-free online learning. In Proceedings of the 29th international conference on machine learning (pp. 1843\u20131850)."},{"issue":"2","key":"6072_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10994-007-5016-8","volume":"69","author":"E Hazan","year":"2007","unstructured":"Hazan, E., Agarwal, A., & Kale, S. (2007). Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2), 169\u2013192.","journal-title":"Machine Learning"},{"key":"6072_CR12","doi-asserted-by":"crossref","unstructured":"He, X., Pan, J., Jin, O., Xu, T., Liu, B., Xu, T., Shi, Y., Atallah, A., Herbrich, R., Bowers, S., & Candela, J. Q. (2014). Practical lessons from predicting clicks on ads at facebook. In Proceedings of the 8th international workshop on data mining for online advertising (pp. 1\u20139).","DOI":"10.1145\/2648584.2648589"},{"key":"6072_CR13","unstructured":"H\u00e9liou, A., Mertikopoulos, P., & Zhou, Z. (2020). Gradient-free online learning in games with delayed rewards. In Proceedings of the 37th international conference on machine learning (pp. 4172\u20134181)."},{"key":"6072_CR14","unstructured":"Joulani, P., Gy\u00f6rgy, A., & Szepesv\u00e1ri, C. (2013). Online learning under delayed feedback. In Proceedings of the 30th international conference on machine learning (pp. 1453\u20131461)."},{"key":"6072_CR15","doi-asserted-by":"crossref","unstructured":"Joulani, P., Gy\u00f6rgy, A., & Szepesv\u00e1ri, C. (2016). Delay-tolerant online convex optimization: Unified analysis and adaptive-gradient algorithms. In Proceedings of the 30th AAAI conference on artificial Intelligence (pp. 1744\u20131750).","DOI":"10.1609\/aaai.v30i1.10320"},{"key":"6072_CR16","unstructured":"Khashabi, D., Quanrud, K., & Taghvaei, A. (2016). Adversarial delays in online strongly-convex optimization. arXiv:160506201v1."},{"key":"6072_CR17","first-page":"2331","volume":"22","author":"J Langford","year":"2009","unstructured":"Langford, J., Smola, A. J., & Zinkevich, M. (2009). Slow learners are fast. Advances in Neural Information Processing Systems, 22, 2331\u20132339.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6072_CR18","unstructured":"Li, B., Chen, T., & Giannakis, G. B. (2019). Bandit online learning with unknown delays. In Proceedings of the 22nd international conference on artificial Intelligence and statistics (pp. 993\u20131002)."},{"key":"6072_CR19","unstructured":"McMahan, H. B., & Streeter, M. (2010). Adaptive bound optimization for online convex optimization. In Proceedings of the 23rd conference on learning theory (pp. 244\u2013256)."},{"key":"6072_CR20","first-page":"2915","volume":"27","author":"HB McMahan","year":"2014","unstructured":"McMahan, H. B., & Streeter, M. (2014). Delay-tolerant algorithms for asynchronous distributed online learning. Advances in Neural Information Processing Systems, 27, 2915\u20132923.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6072_CR21","doi-asserted-by":"crossref","unstructured":"McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E., Golovin, D., Chikkerur, S., Liu, D., Wattenberg, M., Hrafnkelsson, A. M., Boulos, T., & Kubica, J. (2013). Ad click prediction: a view from the trenches. In Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1222\u20131230).","DOI":"10.1145\/2487575.2488200"},{"key":"6072_CR22","doi-asserted-by":"crossref","unstructured":"Mesterharm, C. (2005). On-line learning with delayed label feedback. In Proceedings of the 16th international conference on algorithmic learning theory (pp. 399\u2013413).","DOI":"10.1007\/11564089_31"},{"key":"6072_CR23","first-page":"1270","volume":"28","author":"K Quanrud","year":"2015","unstructured":"Quanrud, K., & Khashabi, D. (2015). Online learning with adversarial delays. Advances in Neural Information Processing Systems, 28, 1270\u20131278.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6072_CR24","unstructured":"Saha, A., & Tewari, A. (2011). Improved regret guarantees for online smooth convex optimization with bandit feedback. In Proceedings of the 14th international conference on artificial intelligence and statistics (pp. 636\u2013642)."},{"issue":"2","key":"6072_CR25","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/2200000018","volume":"4","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S. (2011). Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4(2), 107\u2013194.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"6072_CR26","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007). Pegasos: Primal estimated subgradient solver for SVM. In Proceedings of the 24th international conference on machine learning (pp. 807\u2013814).","DOI":"10.1145\/1273496.1273598"},{"key":"6072_CR27","unstructured":"Shamir, O., & Szlak, L. (2017). Online learning with local permutations and delayed feedback. In Proceedings of the 34th international conference on machine learning (pp. 3086\u20133094)."},{"key":"6072_CR28","unstructured":"Wan, Y., Tu, W. W., & Zhang, L. (2020). Projection-free distributed online convex optimization with $${O}(\\sqrt{T})$$ communication complexity. In Proceedings of the 37th international conference on machine learning (pp. 9818\u20139828)."},{"key":"6072_CR29","doi-asserted-by":"crossref","unstructured":"Wan, Y., Tu, W. W., & Zhang, L. (2021a). Strongly adaptive online learning over partial intervals. Science China Information Sciences.","DOI":"10.1007\/s11432-020-3273-9"},{"key":"6072_CR30","doi-asserted-by":"crossref","unstructured":"Wan, Y., Wang, G., & Zhang, L. (2021b). Projection-free distributed online learning with strongly convex losses. arXiv:210311102","DOI":"10.1609\/aaai.v35i11.17209"},{"key":"6072_CR31","unstructured":"Wang, G., Lu, S., Cheng, Q., Tu, W. W., & Zhang, L. (2020). Sadam: A variant of adam for strongly convex functions. In International conference on learning representations (pp. 1\u201321)."},{"issue":"7","key":"6072_CR32","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.1109\/TIT.2002.1013136","volume":"48","author":"MJ Weinberger","year":"2002","unstructured":"Weinberger, M. J., & Ordentlich, E. (2002). On delayed prediction of individual sequences. IEEE Transactions on Information Theory, 48(7), 1959\u20131976.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6072_CR33","first-page":"1323","volume":"31","author":"L Zhang","year":"2018","unstructured":"Zhang, L., Lu, S., & Zhou, Z. H. (2018). Adaptive online learning in dynamic environments. Advances in Neural Information Processing Systems, 31, 1323\u20131333.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6072_CR34","unstructured":"Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th international conference on machine learning (pp. 928\u2013936)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06072-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06072-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06072-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T01:04:26Z","timestamp":1672707866000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06072-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,3]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["6072"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06072-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,3]]},"assertion":[{"value":"10 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 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 have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}