{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:06Z","timestamp":1763467986426},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222828"},{"type":"electronic","value":"9783540278191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27819-1_6","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T06:05:39Z","timestamp":1284444339000},"page":"77-92","source":"Crossref","is-referenced-by-count":3,"title":["Minimizing Regret with Label Efficient Prediction"],"prefix":"10.1007","author":[{"given":"Nicol\u00f2","family":"Cesa-Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Stoltz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing\u00a032(1), 48\u201377 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-Bianchi, N., Gentile, C.: Adaptive and self-confident on-line learning algorithms. Journal of Computer and System Sciences\u00a064(1) (2002)","DOI":"10.1006\/jcss.2001.1795"},{"key":"6_CR3","unstructured":"Birg\u00e9, L.: A new look at an old result: Fano\u2019s lemma. Technical report, Universit\u00e9 Paris 6 (2001)"},{"issue":"3","key":"6_CR4","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., Helmbold, D.P., Schapire, R., Warmuth, M.K.: How to use expert advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the ACM"},{"key":"6_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0504-0","volume-title":"Probability Theory","author":"Y.S. Chow","year":"1988","unstructured":"Chow, Y.S., Teicher, H.: Probability Theory. Springer, Heidelberg (1988)"},{"key":"6_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley and Sons, Chichester (1991)"},{"key":"6_CR7","first-page":"97","volume":"3","author":"J. Hannan","year":"1957","unstructured":"Hannan, J.: Approximation to Bayes risk in repeated play. Contributions to the theory of games\u00a03, 97\u2013139 (1957)","journal-title":"Contributions to the theory of games"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/267460.267502","volume-title":"Proceedings of the 10th Annual Conference on Computational Learning Theory","author":"D.P. Helmbold","year":"1997","unstructured":"Helmbold, D.P., Panizza, S.: Some label efficient learning results. In: Proceedings of the 10th Annual Conference on Computational Learning Theory, pp. 218\u2013230. ACM Press, New York (1997)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058, 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"6_CR10","unstructured":"Littlestone, N.: Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, University of California at Santa Cruz (1989)"},{"key":"6_CR11","unstructured":"Massart, P.: Concentration inequalities and model selection. Saint-Flour summer school lecture notes (2003) (to appear)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Piccolboni, A., Schindelhauer, C.: Discrete prediction games with arbitrary feedback and loss. In: Proceedings of the 14th Annual Conference on Computational Learning Theory, pp. 208\u2013223 (2001)","DOI":"10.1007\/3-540-44581-1_14"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27819-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:50Z","timestamp":1620012590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27819-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222828","9783540278191"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27819-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}