{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:49:57Z","timestamp":1725454197202},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_25","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:56:27Z","timestamp":1349070987000},"page":"305-319","source":"Crossref","is-referenced-by-count":4,"title":["Partial Monitoring with Side Information"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Bart\u00f3k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba","family":"Szepesv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"1","volume":"19","author":"Y. Abbasi-Yadkori","year":"2011","unstructured":"Abbasi-Yadkori, Y., Szepesv\u00e1ri, Cs.: Regret bounds for the adaptive control of linear quadratic systems. Journal of Machine Learning Research - Proceedings Track (COLT 2011)\u00a019, 1\u201326 (2011)","journal-title":"Journal of Machine Learning Research - Proceedings Track (COLT 2011)"},{"key":"25_CR2","unstructured":"Abbasi-Yadkori, Y., P\u00e1l, D., Szepesv\u00e1ri, Cs.: Improved algorithms for linear stochastic bandits (extended version). In: NIPS, pp. 2312\u20132320 (2011), \n                      \n                        http:\/\/www.ualberta.ca\/~szepesva\/papers\/linear-bandits-NIPS2011.pdf"},{"key":"25_CR3","first-page":"422","volume":"3","author":"P. Auer","year":"2003","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. The Journal of Machine Learning Research\u00a03, 422 (2003)","journal-title":"The Journal of Machine Learning Research"},{"key":"25_CR4","first-page":"133","volume":"19","author":"G. Bart\u00f3k","year":"2011","unstructured":"Bart\u00f3k, G., P\u00e1l, D., Szepesv\u00e1ri, Cs.: Minimax regret of finite partial-monitoring games in stochastic environments. Journal of Machine Learning Research - Proceedings Track (COLT 2011)\u00a019, 133\u2013154 (2011)","journal-title":"Journal of Machine Learning Research - Proceedings Track (COLT 2011)"},{"key":"25_CR5","unstructured":"Bart\u00f3k, G., Zolghadr, N., Szepesv\u00e1ri, Cs.: An adaptive algorithm for finite stochastic partial monitoring. To appear in ICML (2012)"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1287\/moor.1060.0206","volume":"31","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G., Stoltz, G.: Regret minimization under partial monitoring. Math. Oper. Res.\u00a031(3), 562\u2013580 (2006)","journal-title":"Math. Oper. Res."},{"key":"25_CR7","unstructured":"Dud\u00edk, M., Hsu, D., Kale, S., Karampatziakis, N., Langford, J., Reyzin, L., Zhang, T.: Efficient optimal learning for contextual bandits. In: UAI, pp. 169\u2013178 (2011)"},{"key":"25_CR8","unstructured":"Filippi, S., Capp\u00e9, O., Garivier, A., Szepesv\u00e1ri, Cs.: Parametric bandits: The generalized linear case. In: NIPS, pp. 586\u2013594 (2010)"},{"key":"25_CR9","unstructured":"Foster, D.P., Rakhlin, A.: No internal regret via neighborhood watch. CoRR, abs\/1108.6088 (2011)"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/inco.2000.2870","volume":"161","author":"D.P. Helmbold","year":"2000","unstructured":"Helmbold, D.P., Littlestone, N., Long, P.M.: Apple tasting. Information and Computation\u00a0161(2), 85\u2013139 (2000)","journal-title":"Information and Computation"},{"key":"25_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-44581-1_14","volume-title":"Computational Learning Theory","author":"A. Piccolboni","year":"2001","unstructured":"Piccolboni, A., Schindelhauer, C.: Discrete Prediction Games with Arbitrary Feedback and Loss. In: Helmbold, D.P., Williamson, B. (eds.) COLT\/EuroCOLT 2001. LNCS (LNAI), vol.\u00a02111, pp. 208\u2013223. Springer, Heidelberg (2001)"}],"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_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:44:58Z","timestamp":1620132298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34106-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341052","9783642341069"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34106-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}