{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:20:18Z","timestamp":1725618018425},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642244117"},{"type":"electronic","value":"9783642244124"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24412-4_19","type":"book-chapter","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T00:41:17Z","timestamp":1317861677000},"page":"219-233","source":"Crossref","is-referenced-by-count":1,"title":["Combining Initial Segments of Lists"],"prefix":"10.1007","author":[{"given":"Manfred K.","family":"Warmuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter M.","family":"Koolen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Helmbold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Abernethy, J., Hazan, E., Rakhlin, A.: Competing in the dark: An efficient algorithm for bandit linear optimization. In: Proceedings of the 21st Annual Conference on Learning Theory (July 2008)"},{"key":"19_CR2","unstructured":"Abernethy, J., Warmuth, M.K., Yellin, J.: Optimal strategies for random walks. In: Proceedings of the 21st Annual Conference on Learning Theory (July 2008)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11841036_17","volume-title":"Algorithms \u2013 ESA 2006","author":"D. Bremner","year":"2006","unstructured":"Bremner, D., Chan, T.M., Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Taslakian, P.: Necklaces, convolutions, and x\u2009+\u2009y. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"key":"19_CR4","first-page":"363","volume":"3","author":"O. Bousquet","year":"2002","unstructured":"Bousquet, O., Warmuth, M.K.: Tracking a small set of experts by mixing past posteriors. Journal of Machine Learning Research\u00a03, 363\u2013396 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"19_CR5","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinatorial bandits. In: Proceedings of the 22nd Annual Conference on Learning Theory (June 2009)"},{"issue":"90","key":"19_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation\u00a019(90), 297\u2013301 (1965)","journal-title":"Mathematics of Computation"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences\u00a055, 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11503415_14","volume-title":"Learning Theory","author":"A. Gy\u00f6rgy","year":"2005","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G.: Tracking the best of many experts. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol.\u00a03559, pp. 204\u2013216. Springer, Heidelberg (2005)"},{"key":"19_CR9","unstructured":"Gramacy, R.B.: Adaptive caching by experts. PhD thesis, University of California at Santa Cruz (2003)"},{"key":"19_CR10","unstructured":"Geulen, S., V\u00f6cking, B., Winkler, M.: Regret minimization for online buffering problems using the Weighted Majority algorithm. In: Proceedings of the 23rd Annual Conference on Learning Theory (2010)"},{"key":"19_CR11","first-page":"1465","volume-title":"NIPS","author":"R.B. Gramacy","year":"2002","unstructured":"Gramacy, R.B., Warmuth, M.K., Brandt, S.A., Ari, I.: Adaptive caching by refetching. In: Becker, S., Thrun, S., Obermayer, K. (eds.) NIPS, pp. 1465\u20131472. MIT Press, Cambridge (2002)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Helmbold, D.P., Long, D.D.E., Sconyers, T.L., Sherrod, B.: Adaptive disk spin-down for mobile computers. In: ACM\/Baltzer Mobile Networks and Applications (MONET), pp. 285\u2013297 (2000)","DOI":"10.1023\/A:1019129116852"},{"key":"19_CR13","first-page":"639","volume":"6","author":"M. Hutter","year":"2005","unstructured":"Hutter, M., Poland, J.: Adaptive online prediction by following the perturbed leader. Journal of Machine Learning Research\u00a06, 639\u2013660 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1007424614876","volume":"32","author":"M. Herbster","year":"1998","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best expert. Machine Learning\u00a032, 151\u2013178 (1998)","journal-title":"Machine Learning"},{"key":"19_CR15","unstructured":"Kontkanen, P., Myllym\u00e4ki, P.: A fast normalized maximum likelihood algorithm for multinomial data. In: IJCAI, pp. 1613\u20131615 (2005)"},{"issue":"3","key":"19_CR16","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 online decision problems. J. Comput. Syst. Sci.\u00a071(3), 291\u2013307 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR17","unstructured":"Koolen, W.M., Warmuth, M.K., Kivinen, J.: Hedging structured concepts. In: Proceedings of the 23rd Annual Conference on Learning Theory, pp. 93\u2013105 (June 2010)"},{"issue":"4","key":"19_CR18","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning\u00a02(4), 285\u2013318 (1988)","journal-title":"Machine Learning"},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The Weighted Majority algorithm. Information and Computation\u00a0108(2), 212\u2013261 (1994)","journal-title":"Information and Computation"},{"issue":"4","key":"19_CR20","first-page":"6","volume":"28","author":"N. Megiddo","year":"2003","unstructured":"Megiddo, N., Modha, D.S.: One up on LRU. login: The Magazine of USENIX and SAGE\u00a028(4), 6\u201311 (2003)","journal-title":"login: The Magazine of USENIX and SAGE"},{"issue":"4","key":"19_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MC.2004.1297303","volume":"37","author":"N. Megiddo","year":"2004","unstructured":"Megiddo, N., Modha, D.S.: Outperforming LRU with an adaptive replacement cache algorithm. IEEE Computer\u00a037(4), 58\u201365 (2004)","journal-title":"IEEE Computer"},{"key":"19_CR22","unstructured":"Scalisi, C.A.: An adaptive caching algorithm. Master\u2019s thesis, University of California Santa Cruz (June 2007)"},{"key":"19_CR23","unstructured":"Sen, A., Scalisi, C.: Making online predictions from k-lists. Project report for CMPS 290C, Advanced Topics in Machine Learning (June 2007)"},{"key":"19_CR24","first-page":"773","volume":"4","author":"E. Takimoto","year":"2003","unstructured":"Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. Journal of Machine Learning Research\u00a04, 773\u2013818 (2003)","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jcss.1997.1556","volume":"56","author":"V. Vovk","year":"1998","unstructured":"Vovk, V.: A game of prediction with expert advice. J. of Comput. Syst. Sci.\u00a056(2), 153\u2013173 (1998)","journal-title":"J. of Comput. Syst. Sci."}],"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-24412-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:45:17Z","timestamp":1560728717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24412-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642244117","9783642244124"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24412-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}