{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:03:53Z","timestamp":1761581033911},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,10,24]],"date-time":"2012-10-24T00:00:00Z","timestamp":1351036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10994-012-5321-8","type":"journal-article","created":{"date-parts":[[2012,10,23]],"date-time":"2012-10-23T19:16:54Z","timestamp":1351019814000},"page":"347-383","source":"Crossref","is-referenced-by-count":22,"title":["Multiclass classification with bandit feedback using adaptive regularization"],"prefix":"10.1007","volume":"90","author":[{"given":"Koby","family":"Crammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Gentile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,24]]},"reference":[{"key":"5321_CR1","first-page":"397","volume":"3","author":"P. Auer","year":"2003","unstructured":"Auer, P. (2003). Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, 3, 397\u2013422.","journal-title":"Journal of Machine Learning Research"},{"key":"5321_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K. S. Azoury","year":"2001","unstructured":"Azoury, K. S., & Warmuth, M. K. (2001). Relative loss bounds for online density estimation with the exponential family of distributions. Machine Learning, 43, 211\u2013246.","journal-title":"Machine Learning"},{"key":"5321_CR3","volume-title":"Association of computational linguistics (ACL)","author":"J. Blitzer","year":"2007","unstructured":"Blitzer, J., Dredze, M., & Pereira, F. (2007). Biographies, Bollywood, boom-boxes and blenders: domain adaptation for sentiment classification. In Association of computational linguistics (ACL)."},{"key":"5321_CR4","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1137\/S0097539703432542","volume":"43","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2005). A\u00a0second-order perceptron algorithm. SIAM Journal on Computing, 43, 640\u2013668.","journal-title":"SIAM Journal on Computing"},{"key":"5321_CR5","volume-title":"Proc. 26th ICML","author":"N. Cesa-Bianchi","year":"2009","unstructured":"Cesa-Bianchi, N., Gentile, C., & Orabona, F. (2009). Robust bounds for classification via selective sampling. In Proc. 26th ICML."},{"key":"5321_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1013637720281","volume":"47","author":"K. Crammer","year":"2002","unstructured":"Crammer, K., & Singer, Y. (2002). On the learnability and design of output codes for multiclass problems. Machine Learning, 47, 201\u2013233.","journal-title":"Machine Learning"},{"key":"5321_CR7","first-page":"951","volume":"3","author":"K. Crammer","year":"2003","unstructured":"Crammer, K., & Singer, Y. (2003). Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research, 3, 951\u2013991.","journal-title":"Journal of Machine Learning Research"},{"key":"5321_CR8","volume-title":"EMNLP 2009","author":"K. Crammer","year":"2009","unstructured":"Crammer, K., Dredze, M., & Kulesza, A. (2009a). Multi-class confidence weighted algorithms. In EMNLP 2009."},{"key":"5321_CR9","volume-title":"Nips 2009","author":"K. Crammer","year":"2009","unstructured":"Crammer, K., Kulesza, A., & Dredze, M. (2009b). Adaptive regularization of weighted vectors. In Nips 2009."},{"key":"5321_CR10","volume-title":"Colt 2008","author":"V. Dani","year":"2008","unstructured":"Dani, V., Hayes, T., & Kakade, S. (2008). Stochastic linear optimization under bandit feedback. In Colt 2008."},{"key":"5321_CR11","volume-title":"Colt 2010","author":"O. Dekel","year":"2010","unstructured":"Dekel, O., Gentile, C., & Sridharan, K. (2010). Robust selective sampling from single and multiple teachers. In Colt 2010."},{"key":"5321_CR12","volume-title":"ICML 2008","author":"M. Dredze","year":"2008","unstructured":"Dredze, M., Crammer, K., & Pereira, F. (2008). Confidence-weighted linear classification. In ICML 2008."},{"key":"5321_CR13","first-page":"272","volume-title":"ICML 2008","author":"J. Duchi","year":"2008","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008). Efficient projections onto the \u2113 1-ball for learning in high dimensions. In ICML 2008 (pp.\u00a0272\u2013279)."},{"key":"5321_CR14","volume-title":"NIPS 2011","author":"E. Hazan","year":"2011","unstructured":"Hazan, E., & Kale, S. (2011). Newtron: an efficient bandit algorithm for online multiclass prediction. In NIPS 2011."},{"key":"5321_CR15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00401706.1970.10488634","volume":"12","author":"A. Hoerl","year":"1970","unstructured":"Hoerl, A., & Kennard, R. (1970). Ridge regression: biased estimation for nonorthogonal problems. Technometrics, 12, 55\u201367.","journal-title":"Technometrics"},{"key":"5321_CR16","volume-title":"Nips 2008","author":"S. Kakade","year":"2008","unstructured":"Kakade, S., & Tewari, A. (2008). On the generalization ability of online strongly convex programming algorithm. In Nips 2008."},{"key":"5321_CR17","volume-title":"ICML 2008","author":"S. Kakade","year":"2008","unstructured":"Kakade, S., Shalev-Shwartz, S., & Tewari, A. (2008). Efficient bandit algorithms for online multiclass prediction. In ICML 2008."},{"key":"5321_CR18","volume-title":"Interspeech","author":"K. Kilanski","year":"2006","unstructured":"Kilanski, K., Malkin, J., Li, X., Wright, R., & Bilmes, J. (2006). The Vocal Joystick data collection effort and vowel corpus. In Interspeech, Pittsburgh, PA."},{"key":"5321_CR19","volume-title":"Nips 2007","author":"J. Langford","year":"2007","unstructured":"Langford, J., & Zhang, T. (2007). The epoch-greedy algorithm for contextual multi-armed bandits. In Nips 2007."},{"key":"5321_CR20","first-page":"361","volume":"5","author":"D. D. Lewis","year":"2004","unstructured":"Lewis, D. D., Yang, Y., Rose, T. G., & Li, F. (2004). Rcv1: a new benchmark collection for text categorization research. Journal of Machine Learning Research, 5, 361\u2013397.","journal-title":"Journal of Machine Learning Research"},{"key":"5321_CR21","doi-asserted-by":"crossref","first-page":"2559","DOI":"10.21437\/Interspeech.2009-674","volume-title":"INTERSPEECH","author":"H. Lin","year":"2009","unstructured":"Lin, H., Bilmes, J., & Crammer, K. (2009). How to loose confidence: probabilistic linear machines for multiclass classification. In INTERSPEECH (pp.\u00a02559\u20132562)."},{"key":"5321_CR22","first-page":"83","volume-title":"ICML 2009","author":"J. Liu","year":"2009","unstructured":"Liu, J., & Ye, J. (2009). Efficient Euclidean projections in linear time. In ICML 2009 (p.\u00a083)."},{"key":"5321_CR23","volume-title":"Aistat 2010","author":"T. Lu","year":"2010","unstructured":"Lu, T., Pal, D., & Pal, M. (2010). Showing relevant ads via Lipschitz context multi-armed bandits. In Aistat 2010."},{"key":"5321_CR24","volume-title":"Colt 2010","author":"P. Rigollet","year":"2010","unstructured":"Rigollet, P., & Zeevi, A. (2010). Nonparametric bandits with covariates. In Colt 2010."},{"key":"5321_CR25","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F. Rosenblatt","year":"1958","unstructured":"Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65, 386\u2013407.","journal-title":"Psychological Review"},{"key":"5321_CR26","volume-title":"The New York Times annotated corpus","author":"E. Sandhaus","year":"2008","unstructured":"Sandhaus, E. (2008). The New York Times annotated corpus. Philadelphia: Linguistic Data Consortium."},{"key":"5321_CR27","volume-title":"NIPS 2008","author":"A. Strehl","year":"2008","unstructured":"Strehl, A., & Littman, M. (2008). Online linear regression and its application to model-based reinforcement learning. In NIPS 2008."},{"key":"5321_CR28","volume-title":"KDD 2011","author":"H. Valizadegan","year":"2011","unstructured":"Valizadegan, H., Jin, R., & Wang, S. (2011). Learning to trade off between exploration and exploitation in multiclass bandit prediction. In KDD 2011."},{"key":"5321_CR29","volume-title":"UAI 2008 & Rutgers Univ. Tech. Rep","author":"T. J. Walsh","year":"2009","unstructured":"Walsh, T. J., Szita, I., Diuk, C., & Littman, M. L. (2009). Exploring compact reinforcement-learning representations with linear regression. In UAI 2008 & Rutgers Univ. Tech. Rep."},{"key":"5321_CR30","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TAC.2005.844079","volume":"50","author":"C. Wang","year":"2005","unstructured":"Wang, C., Kulkarni, S., & Poor, V. (2005). Bandit problems with side observation. IEEE Transactions on Automatic Control, 50, 338\u2013355.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5321_CR31","volume-title":"Aistat 2010","author":"S. Wang","year":"2010","unstructured":"Wang, S., Jin, R., & Valizadegan, H. (2010). A\u00a0potential-based framework for online multi-class learning with partial feedback. In Aistat 2010."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-012-5321-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-012-5321-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-012-5321-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T13:28:19Z","timestamp":1643549299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-012-5321-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,24]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["5321"],"URL":"https:\/\/doi.org\/10.1007\/s10994-012-5321-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,24]]}}}