{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:09Z","timestamp":1774680609658,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540352945","type":"print"},{"value":"9783540352969","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_37","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"499-513","source":"Crossref","is-referenced-by-count":38,"title":["Logarithmic Regret Algorithms for Online Convex Optimization"],"prefix":"10.1007","author":[{"given":"Elad","family":"Hazan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Kalai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyen","family":"Kale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Agarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Agarwal, A., Hazan, E.: Efficient algorithms for online game playing and universal portfolio management. In: ECCC, TR06-033 (2005)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/267460.267518","volume-title":"COLT 1997: Proceedings of the tenth annual conference on Computational learning theory","author":"A. Blum","year":"1997","unstructured":"Blum, A., Kalai, A.: Universal portfolios with and without transaction costs. In: COLT 1997: Proceedings of the tenth annual conference on Computational learning theory, pp. 309\u2013313. ACM Press, New York (1997)"},{"key":"37_CR3","unstructured":"Brookes, M.: The matrix reference manual (2005), online: http:\/\/www.ee.ic.ac.uk\/hp\/staff\/dmb\/matrix\/intro.html"},{"key":"37_CR4","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, Cambridge (2006)"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1467-9965.1991.tb00002.x","volume":"1","author":"T. Cover","year":"1991","unstructured":"Cover, T.: Universal portfolios. Math. Finance\u00a01, 1\u201319 (1991)","journal-title":"Math. Finance"},{"key":"37_CR6","unstructured":"Flaxman, A., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of 16th SODA, pp. 385\u2013394 (2005)"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Hannan, J.: Approximation to bayes risk in repeated play. In: Dresher, M., Tucker, A.W., Wolfe, P. (eds.) Contributions to the Theory of Games, vol.\u00a0III, pp. 97\u2013139 (1957)","DOI":"10.1515\/9781400882151-006"},{"key":"37_CR8","unstructured":"Kakade, S.: Personal communication (2005)"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1162\/153244303321897672","volume":"3","author":"A. Kalai","year":"2003","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for universal portfolios. J. Mach. Learn. Res.\u00a03, 423\u2013440 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"37_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A. Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for on-line optimization. Journal of Computer and System Sciences\u00a071(3), 291\u2013307 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-49097-3_13","volume-title":"Computational Learning Theory","author":"J. Kivinen","year":"1999","unstructured":"Kivinen, J., Warmuth, M.K.: Averaging expert predictions. In: Fischer, P., Simon, H.U. (eds.) EuroCOLT 1999. LNCS, vol.\u00a01572, pp. 153\u2013167. Springer, Heidelberg (1999)"},{"key":"37_CR12","unstructured":"Lov\u00e1sz, L., Vempala, S.: The geometry of logconcave functions and an o *(n 3) sampling algorithm. Technical Report MSR-TR-2003-04, Microsoft Research (2003)"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulated annealing in convex bodies and an 0*(n 4) volume algorithm. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS), pp. 650\u2013659 (2003)","DOI":"10.1109\/SFCS.2003.1238237"},{"issue":"1","key":"37_CR14","first-page":"80","volume":"12","author":"K. Riedel","year":"1991","unstructured":"Riedel, K.: A sherman-morrison-woodbury identity for rank augmenting matrices with application to centering. SIAM J. Mat. Anal.\u00a012(1), 80\u201395 (1991)","journal-title":"SIAM J. Mat. Anal."},{"key":"37_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization","author":"J. Spall","year":"2003","unstructured":"Spall, J.: Introduction to Stochastic Search and Optimization. John Wiley & Sons, Inc., New York (2003)"},{"issue":"3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02592216","volume":"73","author":"P.M. Vaidya","year":"1996","unstructured":"Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. Math. Program.\u00a073(3), 291\u2013341 (1996)","journal-title":"Math. Program."},{"key":"37_CR17","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the Twentieth International Conference (ICML), pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:40:00Z","timestamp":1736559600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11776420_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}