{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:07:26Z","timestamp":1777597646984,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,25]],"date-time":"2014-12-25T00:00:00Z","timestamp":1419465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10994-014-5474-8","type":"journal-article","created":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T20:39:12Z","timestamp":1419453552000},"page":"411-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A generalized online mirror descent with applications to classification and regression"],"prefix":"10.1007","volume":"99","author":[{"given":"Francesco","family":"Orabona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koby","family":"Crammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00f2","family":"Cesa-Bianchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,25]]},"reference":[{"key":"5474_CR1","first-page":"263","volume-title":"COLT","author":"J Abernethy","year":"2008","unstructured":"Abernethy, J., Hazan, E., & Rakhlin, A. (2008). Competing in the dark: An efficient algorithm for bandit linear optimization. In R. A. Servedio & T. Zhang (Eds.), COLT (pp. 263\u2013274). Madison: Omnipress."},{"issue":"7","key":"5474_CR2","doi-asserted-by":"crossref","first-page":"4164","DOI":"10.1109\/TIT.2012.2192096","volume":"58","author":"J Abernethy","year":"2012","unstructured":"Abernethy, J., Hazan, E., & Rakhlin, A. (2012). Interior-point methods for full-information and bandit online learning. IEEE Transactions on Information Theory, 58(7), 4164\u20134175.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"5474_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jcss.2001.1795","volume":"64","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Gentile, C. (2002). Adaptive and self-confident on-line learning algorithms. Journal of Computer and System Sciences, 64(1), 48\u201375.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"5474_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"KS Azoury","year":"2001","unstructured":"Azoury, K. S., & Warmuth, M. K. (2001). Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning, 43(3), 211\u2013246.","journal-title":"Machine Learning"},{"key":"5474_CR5","volume-title":"NIPS","author":"PL Bartlett","year":"2007","unstructured":"Bartlett, P. L., Hazan, E., & Rakhlin, A. (2007). Adaptive online gradient descent. In Platt John C., Koller Daphne, Singer Yoram, & Roweis Sam T. (Eds.), NIPS. USA: Curran Associates, Inc."},{"key":"5474_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H. H., & Combettes, P. L. (2011). Convex analysis and monotone operator theory in hilbert spaces. Berlin: Springer."},{"issue":"3","key":"5474_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., & Teboulle, M. (2003). Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3), 167\u2013175.","journal-title":"Operations Research Letters"},{"key":"5474_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, learning, and games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. Cambridge: Cambridge University Press."},{"issue":"3","key":"5474_CR9","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1137\/S0097539703432542","volume":"34","author":"N Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2005). A second-order Perceptron algorithm. SIAM Journal on Computing, 34(3), 640\u2013668.","journal-title":"SIAM Journal on Computing"},{"key":"5474_CR10","first-page":"551","volume":"7","author":"K Crammer","year":"2006","unstructured":"Crammer, K., Dekel, O., Keshet, J., Shalev-Shwartz, S., & Singer, Y. (2006). Online passive\u2013aggressive algorithms. Journal of Machine Learning Research, 7, 551\u2013585.","journal-title":"Journal of Machine Learning Research"},{"key":"5474_CR11","unstructured":"Crammer, K., Dredze, M., & Pereira, F. (2008). Exact convex confidence-weighted learning. Advances in Neural Information Processing Systems, 22, 345\u2013352."},{"key":"5474_CR12","unstructured":"Crammer, K., Kulesza, A., & Dredze, M. (2009). Adaptive regularization of weight vectors. Advances in Neural Information Processing Systems, 23, 414\u2013422."},{"key":"5474_CR13","unstructured":"Crammer, K., Dredze, M., & Pereira, F. (2012). Confidence-weighted linear classification for text categorization. Journal of Machine Learning Reseatch, 13, 1891\u20131926. ISSN: 1532-4435."},{"key":"5474_CR14","unstructured":"Dredze, M., Crammer, K., & Pereira, F. (2008). Online confidence-weighted learning. In Proceedings of the 25th international conference on machine learning."},{"key":"5474_CR15","first-page":"2899","volume":"10","author":"J Duchi","year":"2009","unstructured":"Duchi, J., & Singer, Y. (2009). Efficient online and batch learning using forward backward splitting. Journal of Machine Learning Research, 10, 2899\u20132934.","journal-title":"Journal of Machine Learning Research"},{"key":"5474_CR16","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y.,&Tewari, A. (2010). Composite objective mirror descent. In Proceedings of the 23rd annual conference on learning theory (pp. 14\u201326)."},{"key":"5474_CR17","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":"5474_CR18","unstructured":"Forster, J. (1999). On relative loss bounds in generalized linear regression. In FCT, ISBN: 3-540-66412-2."},{"issue":"3","key":"5474_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1026319107706","volume":"53","author":"C Gentile","year":"2003","unstructured":"Gentile, C. (2003). The robustness of the $$p$$ p -norm algorithms. Machine Learning, 53(3), 265\u2013299.","journal-title":"Machine Learning"},{"key":"5474_CR20","first-page":"225","volume-title":"NIPS","author":"C Gentile","year":"1998","unstructured":"Gentile, C., & Warmuth, M. K. (1998). Linear hinge loss and average margin. In M. J. Kearns, S. A. Solla, & D. A. Cohn (Eds.), NIPS (pp. 225\u2013231). Cambridge: MIT Press."},{"key":"5474_CR21","unstructured":"Grave, E., Obozinski, G., & Bach, F.R. (2011). Trace Lasso: a trace norm regularization for correlated designs. CoRR, abs\/1109.1990."},{"key":"5474_CR22","doi-asserted-by":"crossref","unstructured":"Hazan, E. (2011). The convex optimization approach to regret minimization. Optimization for machine learning (pp. 287\u2013303).","DOI":"10.7551\/mitpress\/8996.003.0012"},{"issue":"2\u20133","key":"5474_CR23","doi-asserted-by":"crossref","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\u20133), 169\u2013192.","journal-title":"Machine Learning"},{"key":"5474_CR24","unstructured":"Jie, L., Orabona, F., Fornoni, M., Caputo, B., & Cesa-Bianchi, N. (2010). OM-2: An online multi-class multi-kernel learning algorithm. In 4th IEEE online learning for computer vision workshop (in CVPR10). IEEE Computer Society."},{"key":"5474_CR25","first-page":"1865","volume":"13","author":"SM Kakade","year":"2012","unstructured":"Kakade, S. M., Shalev-Shwartz, S., & Tewari, A. (2012). Regularization techniques for learning with matrices. The Journal of Machine Learning Research, 13, 1865\u20131890.","journal-title":"The Journal of Machine Learning Research"},{"issue":"1","key":"5474_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J Kivinen","year":"1997","unstructured":"Kivinen, J., & Warmuth, M. K. (1997). Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1), 1\u201363.","journal-title":"Information and Computation"},{"issue":"3","key":"5474_CR27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J Kivinen","year":"2001","unstructured":"Kivinen, J., & Warmuth, M. K. (2001). Relative loss bounds for multidimensional regression problems. Machine Learning, 45(3), 301\u2013329.","journal-title":"Machine Learning"},{"issue":"5","key":"5474_CR28","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1109\/TSP.2006.872551","volume":"54","author":"J Kivinen","year":"2006","unstructured":"Kivinen, J., Warmuth, M. K., & Hassibi, B. (2006). The $$p$$ p -norm generalization of the LMS algorithm for adaptive filtering. IEEE Transactions on Signal Processing, 54(5), 1782\u20131793.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"5474_CR29","first-page":"285","volume":"2","author":"N Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4), 285\u2013318.","journal-title":"Machine Learning"},{"key":"5474_CR30","unstructured":"McMahan, B., & Orabona, F. (2014). Unconstrained online linear learning in Hilbert spaces: Minimax algorithms and Normal approximations. In Conference on Learning Theory (COLT)."},{"key":"5474_CR31","unstructured":"McMahan, H.B., & Streeter, M. J. (2010). Adaptive bound optimization for online convex optimization. In Proceedings of the 23rd conference on learning theory (pp. 244\u2013256). Omnipress."},{"key":"5474_CR32","volume-title":"Problem complexity and method efficiency in optimization","author":"A Nemirovsky","year":"1983","unstructured":"Nemirovsky, A., & Yudin, D. (1983). Problem complexity and method efficiency in optimization. New York: Wiley."},{"key":"5474_CR33","unstructured":"Orabona, F. (2013). Dimension-free exponentiated gradient. In Advances in neural information processing systems (NIPS) (Vol. 26)."},{"key":"5474_CR34","first-page":"2571","volume":"10","author":"F Orabona","year":"2009","unstructured":"Orabona, F., Keshet, J., & Caputo, B. (2009). Bounded kernel-based online learning. Journal of Machine Learning Research, 10, 2571\u20132594.","journal-title":"Journal of Machine Learning Research"},{"key":"5474_CR35","unstructured":"Orabona, F., Cesa-Bianchi, N., & Gentile, C. (2012). Beyond logarithmic bounds in online learning. In Proceedings of the 15th international conference on artificial intelligence and statistics (pp. 823\u2013831). JMLR W&CP."},{"key":"5474_CR36","unstructured":"Rakhlin, A., & Tewari, A. (2008). Lecture notes on online learning. Technical report. http:\/\/stat.wharton.upenn.edu\/~rakhlin\/papers\/online_learning.pdf ."},{"key":"5474_CR37","unstructured":"Ross, S., Mineiro, P., & Langford, J. (2013). Normalized online learning. In Proceedings of the 29th conference on uncertainty in artificial intelligence (pp. 537\u2013545). AUAI Press."},{"key":"5474_CR38","unstructured":"Shalev-Shwartz, S. (2007). Online learning: Theory, algorithms, and applications. Ph.D. thesis, The Hebrew University."},{"key":"5474_CR39","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S. (2012). Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4(2), 107\u2013194.","DOI":"10.1561\/2200000018"},{"key":"5474_CR40","first-page":"1457","volume":"21","author":"S Shalev-Shwartz","year":"2009","unstructured":"Shalev-Shwartz, S., & Kakade, S. M. (2009). Mind the duality gap: Logarithmic regret algorithms for online optimization. Advances in Neural Information Processing Systems, 21, 1457\u20131464.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5474_CR41","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., & Singer, Y. (2007). A primal\u2013dual perspective of online learning algorithms. Machine Learning Journal, 69(2\u20133), 115\u2013142.","DOI":"10.1007\/s10994-007-5014-x"},{"key":"5474_CR42","first-page":"2645","volume":"24","author":"N Srebro","year":"2011","unstructured":"Srebro, N., Sridharan, K., & Tewari, A. (2011). On the universality of online mirror descent. Advances in Neural Information Processing Systems, 24, 2645\u20132653.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5474_CR43","unstructured":"Sridharan, K., & Tewari, A. (2010a). Convex games in banach spaces. In Proceedings of the 23rd conference on learning theory (pp. 1\u201313). Omnipress."},{"key":"5474_CR44","unstructured":"Sridharan, K., & Tewari, A. (2010b). Convex games in banach spaces. In Proceedings of the 23rd annual conference on learning theory (pp. 1\u201313). Citeseer."},{"key":"5474_CR45","unstructured":"Steinhardt, J., & Liang, P. (2014). Adaptivity and optimism: An improved exponentiated gradient algorithm. In Proceedings of the 31st international conference on machine learning (pp. 1593\u20131601)."},{"key":"5474_CR46","unstructured":"Streeter, M., & McMahan, B. (2012). No-regret algorithms for unconstrained online convex optimization. In Bartlett, P., Pereira, F. C. N., Burges, C. J. C., Bottou, L., Weinberger, K. Q. (Eds.), Advances in neural information processing systems (Vol. 25, pp. 2411\u20132419)."},{"key":"5474_CR47","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1111\/j.1751-5823.2001.tb00457.x","volume":"69","author":"V Vovk","year":"2001","unstructured":"Vovk, V. (2001). Competitive on-line statistics. International Statistical Review, 69, 213\u2013248.","journal-title":"International Statistical Review"},{"key":"5474_CR48","unstructured":"Warmuth, M.K., & Jagota, A.K. (1997). Continuous and discrete-time nonlinear gradient descent: Relative loss bounds and convergence. In Electronic proceedings of the 5th international symposium on artificial intelligence and mathematics."},{"key":"5474_CR49","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L. (2010). Dual averaging methods for regularized stochastic learning and online optimization. Journal of Machine Learning Research, 11, 2543\u20132596.","journal-title":"Journal of Machine Learning Research"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5474-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-014-5474-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5474-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T04:05:27Z","timestamp":1690776327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-014-5474-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,25]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["5474"],"URL":"https:\/\/doi.org\/10.1007\/s10994-014-5474-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,25]]}}}