{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:39:20Z","timestamp":1742398760402},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11432-020-3273-9","type":"journal-article","created":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T15:10:23Z","timestamp":1665069023000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Strongly adaptive online learning over partial intervals"],"prefix":"10.1007","volume":"65","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"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,26]]},"reference":[{"key":"3273_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi N, Freund Y, Haussler D, et al. How to use expert advice. J ACM, 1997, 44: 427\u2013485","journal-title":"J ACM"},{"key":"3273_CR2","unstructured":"Zinkevich M. Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning, Washington, 2003. 928\u2013936"},{"key":"3273_CR3","doi-asserted-by":"crossref","unstructured":"Zhang L J. Online learning in changing environments. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, Online, 2020. 5178\u20135182","DOI":"10.24963\/ijcai.2020\/731"},{"key":"3273_CR4","unstructured":"Daniely A, Gonen A, Shalev-Shwartz S. Strongly adaptive online learning. In: Proceedings of the 32nd International Conference on Machine Learning, Lille, 2015. 1405\u20131411"},{"key":"3273_CR5","unstructured":"Jun K-S, Orabona F, Wright S, et al. Improved strongly adaptive online learning using coin betting. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, Fort Lauderdale, 2017. 943\u2013951"},{"key":"3273_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1006\/jcss.2001.1795","volume":"64","author":"P Auer","year":"2002","unstructured":"Auer P, Cesa-Bianchi N, Gentile C. Adaptive and self-confident on-line learning algorithms. J Comput Syst Sci, 2002, 64: 48\u201375","journal-title":"J Comput Syst Sci"},{"key":"3273_CR7","series-title":"Dissertation for Ph.D. Degree","volume-title":"Online learning: theory, algorithms, and applications","author":"S Shalev-Shwartz","year":"2007","unstructured":"Shalev-Shwartz S. Online learning: theory, algorithms, and applications. Dissertation for Ph.D. Degree. Jerusalem: The Hebrew University of Jerusalem, 2007"},{"key":"3273_CR8","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. Logarithmic regret algorithms for online convex optimization. Mach Learn, 2007, 69: 169\u2013192","journal-title":"Mach Learn"},{"key":"3273_CR9","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi J, Hazan E, Singer Y. Adaptive subgradient methods for online learning and stochastic optimization. J Mach Learn Res, 2011, 12: 2121\u20132159","journal-title":"J Mach Learn Res"},{"key":"3273_CR10","unstructured":"Hazan E, Kale S. Projection-free online learning. In: Proceedings of the 29th International Conference on Machine Learning, Edinburgh, 2012. 1843\u20131850"},{"key":"3273_CR11","doi-asserted-by":"crossref","unstructured":"Zhang L J, Jin R, Chen C, et al. Efficient online learning for large-scale sparse kernel logistic regression. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, Toronto, 2012. 1219\u20131225","DOI":"10.1609\/aaai.v26i1.8300"},{"key":"3273_CR12","unstructured":"Zhang L J, Yi J F, Jin R, et al. Online kernel learning with a near optimal sparsity bound. In: Proceedings of the 30th International Conference on Machine Learning, Atlanta, 2013. 621\u2013629"},{"key":"3273_CR13","doi-asserted-by":"publisher","first-page":"052104","DOI":"10.1007\/s11432-014-5082-z","volume":"57","author":"H Oiwa","year":"2014","unstructured":"Oiwa H, Matsushima S, Nakagawa H. Feature-aware regularization for sparse online learning. Sci China Inf Sci, 2014, 57: 052104","journal-title":"Sci China Inf Sci"},{"key":"3273_CR14","doi-asserted-by":"crossref","unstructured":"Wan Y Y, Wei N, Zhang L J. Efficient adaptive online learning via frequent directions. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. Stockholm, 2018. 2748\u20132754","DOI":"10.24963\/ijcai.2018\/381"},{"key":"3273_CR15","doi-asserted-by":"publisher","first-page":"092202","DOI":"10.1007\/s11432-016-9173-8","volume":"61","author":"Y H Wang","year":"2018","unstructured":"Wang Y H, Lin P, Hong Y G. Distributed regression estimation with incomplete data in multi-agent networks. Sci China Inf Sci, 2018, 61: 092202","journal-title":"Sci China Inf Sci"},{"key":"3273_CR16","unstructured":"Wan Y Y, Tu W W, Zhang L J. Projection-free distributed online convex optimization with $$O\\left( {\\sqrt T } \\right)$$ communication complexity. In: Proceedings of the 37th International Conference on Machine Learning, Online, 2020. 9818\u20139828"},{"key":"3273_CR17","unstructured":"Wan Y Y, Zhang L J. Projection-free online learning over strongly convex sets. 2020. ArXiv:2010.08177"},{"key":"3273_CR18","unstructured":"Hou B J, Zhang L J, Zhou Z H. Learning with feature evolvable streams. In: Proceedings of Advances in Neural Information Processing Systems 30, Long Beach, 2017. 1416\u20131426"},{"key":"3273_CR19","doi-asserted-by":"crossref","unstructured":"Wang C Y, Xie L, Wang W, et al. Moving tag detection via physical layer analysis for large-scale RFID systems. In: Proceedings of the 35th Annual IEEE International Conference on Computer Communications, Calcutta, 2016. 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524575"},{"key":"3273_CR20","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1177\/002224376600300403","volume":"3","author":"W D Wells","year":"1966","unstructured":"Wells W D, Gubar G. Life cycle concept in marketing research. J Marketing Res, 1966, 3: 355\u2013363","journal-title":"J Marketing Res"},{"key":"3273_CR21","doi-asserted-by":"crossref","unstructured":"Yang J W, Yu Y, Zhang X P. Life-stage modeling by customer-manifold embedding. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, Melbourne, 2017. 3259\u20133265","DOI":"10.24963\/ijcai.2017\/455"},{"key":"3273_CR22","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.tourman.2010.03.012","volume":"32","author":"D C Bojanic","year":"2011","unstructured":"Bojanic D C. The impact of age and family life experiences on Mexican visitor shopping expenditures. Tourism Manage, 2011, 32: 406\u2013414","journal-title":"Tourism Manage"},{"key":"3273_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2015","unstructured":"Hazan E. Introduction to online convex optimization. FNT Optim, 2015, 2: 157\u2013325","journal-title":"FNT Optim"},{"key":"3273_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/2200000018","volume":"4","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz S. Online learning and online convex optimization. FNT Mach Learn, 2011, 4: 107\u2013194","journal-title":"FNT Mach Learn"},{"key":"3273_CR25","first-page":"1","volume":"8","author":"N Cesa-Bianchi","year":"2020","unstructured":"Cesa-Bianchi N, Orabona F. Online learning algorithms. Annu Rev Stat Appl, 2020, 8: 1\u201326","journal-title":"Annu Rev Stat Appl"},{"key":"3273_CR26","first-page":"88","volume":"14","author":"E Hazan","year":"2007","unstructured":"Hazan E, Seshadhri C. Adaptive algorithms for online decision problems. Electron Colloq Comput Complex, 2007, 14: 88","journal-title":"Electron Colloq Comput Complex"},{"key":"3273_CR27","unstructured":"Abernethy J D, Bartlett P L, Rakhlin A, et al. Optimal stragies and minimax lower bounds for online convex games. In: Proceedings of the 21st Annual Conference on Learning Theory, Helsinki, 2008. 415\u2013424"},{"key":"3273_CR28","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora S, Hazan E, Kale S. The multiplicative weights update method: a meta-algorithm and applications. Theor Comput, 2012, 8: 121\u2013164","journal-title":"Theor Comput"},{"key":"3273_CR29","doi-asserted-by":"crossref","unstructured":"Freund Y, Schapire R E, Singer Y, et al. Using and combining predictors that specialize. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, 1997. 334\u2013343","DOI":"10.1145\/258533.258616"},{"key":"3273_CR30","unstructured":"Orabona F, Pal D. Coin betting and parameter-free online learning. In: Proceedings of Advances in Neural Information Processing Systems 29, Barcelona, 2016. 577\u2013585"},{"key":"3273_CR31","unstructured":"Zhang L J, Liu T Y, Zhou Z H. Adaptive regret of convex and smooth functions. In: Proceedings of the 36th International Conference on Machine Learning, Long Beach, 2019. 7414\u20137423"},{"key":"3273_CR32","unstructured":"Luo H P, Schapire R E. Achieving all with no parameters: AdaNormalHedge. In: Proceedings of the 28th Conference on Learning Theory, Paris, 2015. 1286\u20131304"},{"key":"3273_CR33","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2017.11.021","volume":"716","author":"F Orabona","year":"2018","unstructured":"Orabona F, P\u00e1l D. Scale-free online learning. Theor Comput Sci, 2018, 716: 50\u201369","journal-title":"Theor Comput Sci"},{"key":"3273_CR34","doi-asserted-by":"crossref","unstructured":"Wang G H, Zhao D K, Zhang L J. Minimizing adaptive regret with one gradient per iteration. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, Stockholm, 2018. 2762\u20132768","DOI":"10.24963\/ijcai.2018\/383"},{"key":"3273_CR35","unstructured":"van Erven T, Koolen W M. MetaGrad: multiple learning rates in online learning. In: Proceedings of Advances in Neural Information Processing Systems 29, Barcelona, 2016. 3666\u20133674"},{"key":"3273_CR36","unstructured":"Zhang L J, Yang T B, Jin R, et al. Dynamic regret of strongly adaptive methods. In: Proceedings of the 35th International Conference on Machine Learning, Stockholm, 2018. 5877\u20135886"},{"key":"3273_CR37","unstructured":"Zhang L J, Wang G H, Tu W W, et al. Dual adaptivity: a universal algorithm for minimizing the adaptive regret of convex functions. 2019. ArXiv:1906.10851"},{"key":"3273_CR38","unstructured":"Zhang L J, Lu S Y, Yang T B. Minimizing dynamic regret and adaptive regret simultaneously. In: Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, Palermo, 2020. 309\u2013319"},{"key":"3273_CR39","unstructured":"Srebro N, Sridharan K, Tewari A. Smoothness, low-noise and fast rates. In: Proceedings of Advances in Neural Information Processing Systems 23, Vancouver, 2010. 2199\u20132207"},{"key":"3273_CR40","unstructured":"Gaillard P, Stoltz G, van Erven T. A second-order bound with excess losses. In: Proceedings of the 27th Annual Conference on Learning Theory, Barcelona, 2014. 176\u2013196"},{"key":"3273_CR41","unstructured":"Luo H P, Schapire R E. A drifting-games analysis for online learning and applications to boosting. In: Proceedings of Advances in Neural Information Processing Systems 27, Montreal, 2014. 1368\u20131376"},{"key":"3273_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C C Chang","year":"2011","unstructured":"Chang C C, Lin C J. LIBSVM: a library for support vector machines. ACM Trans Intell Syst Technol, 2011, 2: 1\u201327","journal-title":"ACM Trans Intell Syst Technol"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3273-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-3273-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3273-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T22:06:30Z","timestamp":1699135590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-3273-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,26]]},"references-count":42,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["3273"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-3273-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,26]]},"assertion":[{"value":"22 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"202101"}}