{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:45:44Z","timestamp":1778564744328,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642411359","type":"print"},{"value":"9783642411366","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41136-6_16","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T09:16:27Z","timestamp":1386753387000},"page":"177-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Transductive Online Learning via Randomized Rounding"],"prefix":"10.1007","author":[{"given":"Nicol\u00f2","family":"Cesa-Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ohad","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,9]]},"reference":[{"key":"16_CR1","volume-title":"Repeated games against budgeted adversaries","author":"J. Abernethy","year":"2010","unstructured":"Abernethy, J., Warmuth, M.: Repeated games against budgeted adversaries. In: NIPS, Vancouver (2010)"},{"key":"16_CR2","volume-title":"Optimal strategies and minimax lower bounds for online convex games","author":"J. Abernethy","year":"2009","unstructured":"Abernethy, J., Bartlett, P., Rakhlin, A., Tewari, A.: Optimal strategies and minimax lower bounds for online convex games. In: COLT, Montreal (2009)"},{"key":"16_CR3","first-page":"1019","volume":"9","author":"F. Bach","year":"2008","unstructured":"Bach, F.: Consistency of trace-norm minimization. J. Mach. Learn. Res. 9, 1019\u20131048 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR4","volume-title":"Rademacher and Gaussian complexities: risk bounds and structural results","author":"P. Bartlett","year":"2001","unstructured":"Bartlett, P., Mendelson, S.: Rademacher and Gaussian complexities: risk bounds and structural results. In: COLT, Amsterdam (2001)"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1007465907571","volume":"29","author":"S. Ben-David","year":"1997","unstructured":"Ben-David, S., Kushilevitz, E., Mansour, Y.: Online learning versus offline learning. Mach. Learn. 29(1), 45\u201363 (1997)","journal-title":"Mach. Learn."},{"key":"16_CR6","volume-title":"Agnostic online learning","author":"S. Ben-David","year":"2009","unstructured":"Ben-David, S., P\u00e1l, D., Shalev-Shwartz, S.: Agnostic online learning. In: COLT, Montreal (2009)"},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1137\/S009753979223455X","volume":"23","author":"A. Blum","year":"1994","unstructured":"Blum, A.: Separating distribution-free and mistake-bound learning models over the Boolean domain. SIAM J. Comput. 23(5), 990\u20131000 (1994)","journal-title":"SIAM J. Comput."},{"key":"16_CR8","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)"},{"issue":"3","key":"16_CR9","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., Schapire, R., Warmuth, M.: How to use expert advice. J.\u00a0ACM 44(3), 427\u2013485 (1997)","journal-title":"J. ACM"},{"issue":"9","key":"16_CR10","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1109\/TIT.2004.833339","volume":"50","author":"N. Cesa-Bianchi","year":"2004","unstructured":"Cesa-Bianchi, N., Conconi, A., Gentile, C.: On the generalization ability of on-line learning algorithms. IEEE Trans. Inf. Theory 50(9), 2050\u20132057 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR11","volume-title":"Approximate methods for sequential decision making using expert advice","author":"T. Chung","year":"1994","unstructured":"Chung, T.: Approximate methods for sequential decision making using expert advice. In: COLT, New Brunswick (1994)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Dudley, R.M.: A Course on Empirical Processes, \u00c9cole de Probabilit\u00e9s de St. Flour, 1982. Lecture Notes in Mathematics, vol.\u00a01097. Springer, Berlin (1984)","DOI":"10.1007\/BFb0099432"},{"key":"16_CR13","volume-title":"Learning with the weighted trace-norm under arbitrary sampling distributions","author":"R. Foygel","year":"2011","unstructured":"Foygel, R., Salakhutdinov, R., Shamir, O., Srebro, N.: Learning with the weighted trace-norm under arbitrary sampling distributions. In: NIPS, Granada (2011)"},{"key":"16_CR14","volume-title":"Optimization for Machine Learning","author":"E. Hazan","year":"2012","unstructured":"Hazan, E.: The convex optimization approach to regret minimization. In: Nowozin, S., Sra, S., Wright, S. (eds.) Optimization for Machine Learning. MIT, Cambridge (2012)"},{"key":"16_CR15","volume-title":"Near-optimal algorithms for online matrix prediction","author":"E. Hazan","year":"2012","unstructured":"Hazan, E., Kale, S., Shalev-Shwartz, S.: Near-optimal algorithms for online matrix prediction. In: COLT, Edinburgh (2012)"},{"key":"16_CR16","volume-title":"From batch to transductive online learning","author":"S. Kakade","year":"2005","unstructured":"Kakade, S., Kalai, A.: From batch to transductive online learning. In: NIPS, Vancouver (2005)"},{"key":"16_CR17","volume-title":"Collaborative filtering with temporal dynamics","author":"Y. Koren","year":"2009","unstructured":"Koren, Y.: Collaborative filtering with temporal dynamics. In: KDD, Paris (2009)"},{"key":"16_CR18","volume-title":"Practical large-scale optimization for max-norm regularization","author":"J. Lee","year":"2010","unstructured":"Lee, J., Recht, B., Salakhutdinov, R., Srebro, N., Tropp, J.: Practical large-scale optimization for max-norm regularization. In: NIPS, Vancouver (2010)"},{"key":"16_CR19","volume-title":"Online learning: random averages, combinatorial parameters, and learnability","author":"A. Rakhlin","year":"2010","unstructured":"Rakhlin, A., Sridharan, K., Tewari, A.: Online learning: random averages, combinatorial parameters, and learnability. In: NIPS, Vancouver (2010)"},{"key":"16_CR20","unstructured":"Rakhlin, A., Shamir, O., Sridharan, K.: Relax and localize: from value to algorithms. CoRR abs\/1204.0870 (2012)"},{"key":"16_CR21","volume-title":"Probabilistic matrix factorization","author":"R. Salakhutdinov","year":"2007","unstructured":"Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: NIPS, Vancouver (2007)"},{"key":"16_CR22","volume-title":"Collaborative filtering in a non-uniform world: learning with the weighted trace norm","author":"R. Salakhutdinov","year":"2010","unstructured":"Salakhutdinov, R., Srebro, N.: Collaborative filtering in a non-uniform world: learning with the weighted trace norm. In: NIPS, Vancouver (2010)"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/2200000018","volume":"4","author":"S. Shalev-Shwartz","year":"2012","unstructured":"Shalev-Shwartz, S.: Online learning and online convex optimization. Found. Trends Mach. Learn. 4(2), 107\u2013194 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"16_CR24","volume-title":"Collaborative filtering with the trace norm: learning, bounding, and transducing","author":"O. Shamir","year":"2011","unstructured":"Shamir, O., Shalev-Shwartz, S.: Collaborative filtering with the trace norm: learning, bounding, and transducing. In: COLT, Budapest (2011)"},{"key":"16_CR25","volume-title":"Rank, trace-norm and max-norm","author":"N. Srebro","year":"2005","unstructured":"Srebro, N., Shraibman, A.: Rank, trace-norm and max-norm. In: COLT, Bertinoro (2005)"},{"key":"16_CR26","volume-title":"Maximum-margin matrix factorization","author":"N. Srebro","year":"2004","unstructured":"Srebro, N., Rennie, J., Jaakkola, T.: Maximum-margin matrix factorization. In: NIPS, Vancouver (2004)"},{"key":"16_CR27","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. Wiley, New York (1998)"}],"container-title":["Empirical Inference"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41136-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T18:53:00Z","timestamp":1674067980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-41136-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411359","9783642411366"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41136-6_16","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"9 October 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}