{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:49:59Z","timestamp":1725454199819},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341052"},{"type":"electronic","value":"9783642341069"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34106-9_21","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:56:27Z","timestamp":1349070987000},"page":"245-259","source":"Crossref","is-referenced-by-count":0,"title":["Weighted Last-Step Min-Max Algorithm with Improved Sub-logarithmic Regret"],"prefix":"10.1007","author":[{"given":"Edward","family":"Moroshko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koby","family":"Crammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K.S. Azoury","year":"2001","unstructured":"Azoury, K.S., Warmuth, M.W.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning\u00a043(3), 211\u2013246 (2001)","journal-title":"Machine Learning"},{"key":"21_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, New York (2006)"},{"key":"21_CR3","first-page":"2233","volume":"8","author":"O. Dekel","year":"2007","unstructured":"Dekel, O., Long, P.M., Singer, Y.: Online learning of multiple tasks with a shared loss. Journal of Machine Learning Research\u00a08, 2233\u20132264 (2007)","journal-title":"Journal of Machine Learning Research"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-48321-7_22","volume-title":"Fundamentals of Computation Theory","author":"J. Forster","year":"1999","unstructured":"Forster, J.: On Relative Loss Bounds in Generalized Linear Regression. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 269\u2013280. Springer, Heidelberg (1999)"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1214\/aos\/1176348140","volume":"19","author":"D.P. Foster","year":"1991","unstructured":"Foster, D.P.: Prediction in the worst case. The An. of Stat.\u00a019(2), 1084\u20131090 (1991)","journal-title":"The An. of Stat."},{"key":"21_CR6","volume-title":"Matrix computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"21_CR7","unstructured":"Hayes, M.H.: 9.4: Recursive least squares. In: Statistical Digital Signal Processing and Modeling, p. 541 (1996)"},{"key":"21_CR8","first-page":"281","volume":"1","author":"M. Herbster","year":"2001","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best linear predictor. Journal of Machine Learning Research\u00a01, 281\u2013309 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"21_CR9","unstructured":"Orabona, F., Cesa-Bianchi, N., Gentile, C.: Beyond logarithmic bounds in online learning. In: AISTATS (2012)"},{"key":"21_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-40992-0_21","volume-title":"Algorithmic Learning Theory","author":"E. Takimoto","year":"2000","unstructured":"Takimoto, E., Warmuth, M.K.: The Last-Step Minimax Algorithm. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol.\u00a01968, pp. 279\u2013290. Springer, Heidelberg (2000)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-24412-4_12","volume-title":"Algorithmic Learning Theory","author":"N. Vaits","year":"2011","unstructured":"Vaits, N., Crammer, K.: Re-adapting the Regularization of Weights for Non-stationary Regression. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol.\u00a06925, pp. 114\u2013128. Springer, Heidelberg (2011)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Vovk, V.G.: Aggregating strategies. In: Proceedings of the Third Annual Workshop on Computational Learning Theory, pp. 371\u2013383. Morgan Kaufmann (1990)","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Vovk, V.: Competitive on-line statistics. International Statistical Review\u00a069 (2001)","DOI":"10.2307\/1403814"},{"key":"21_CR14","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the Twentieth International Conference on Machine Learning, pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34106-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:44:56Z","timestamp":1620132296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34106-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341052","9783642341069"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34106-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}