{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:12:55Z","timestamp":1726848775557},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. IEEE"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1109\/jproc.2015.2494118","type":"journal-article","created":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T19:07:24Z","timestamp":1449774444000},"page":"136-147","source":"Crossref","is-referenced-by-count":5,"title":["Learning Reductions That Really Work"],"prefix":"10.1109","volume":"104","author":[{"given":"Alina","family":"Beygelzimer","sequence":"first","affiliation":[]},{"given":"Hal","family":"Daume","sequence":"additional","affiliation":[]},{"given":"John","family":"Langford","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Mineiro","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2307\/1390710"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307429"},{"key":"ref32","first-page":"1097","article-title":"Doubly robust policy evaluation and learning","author":"dudik","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref31","first-page":"327","article-title":"On the consistency of ranking algorithms","author":"duchi","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref37","first-page":"142","article-title":"Structured perceptron with inexact search","author":"huang","year":"0","journal-title":"Proc Conf North Amer Chapter Assoc Comput Linguistics"},{"key":"ref36","first-page":"772","article-title":"Multi-label prediction via compressed sensing","author":"hsu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","author":"hsu","year":"2010","journal-title":"Algorithms for Active Learning"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273541"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.430"},{"key":"ref61","first-page":"181","article-title":"Label partitioning for sublinear ranking","author":"weston","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273628"},{"key":"ref28","first-page":"1151","article-title":"Output space search for structured prediction","author":"doppa","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref64","first-page":"2041","article-title":"Discriminative learning of beam-search heuristics for planning","author":"xu","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1613\/jair.105","article-title":"Solving multiclass learning problems via error-correcting output codes","volume":"2","author":"dietterich","year":"1995","journal-title":"J Artif Intell Res"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553489"},{"key":"ref66","author":"zadrozny","year":"2003","journal-title":"Policy mining Learning decision policies from fixed sets of data"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1613\/jair.4212","article-title":"HC-Search: A learning framework for search-based structured prediction","volume":"50","author":"doppa","year":"2014","journal-title":"J Artif Intell Res"},{"key":"ref2","first-page":"541","article-title":"Least squares revisited: Scalable approaches for multi-class prediction","author":"agarwal","year":"0","journal-title":"Proc 31st Int Conf Mach Learn Cycle 2"},{"key":"ref1","first-page":"1638","article-title":"Taming the monster: A fast and simple algorithm for contextual bandits","author":"agarwal","year":"0","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref20","author":"choromanska","year":"2014","journal-title":"Logarithmic time online multiclass prediction"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3115\/1218955.1218970"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3115\/1118693.1118694"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5106-x"},{"key":"ref23","first-page":"951","article-title":"Ultraconservative online algorithms for multiclass problems","volume":"3","author":"crammer","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102373"},{"key":"ref25","author":"daum\u00e9","year":"2014","journal-title":"Efficient programmable learning to search"},{"key":"ref50","first-page":"1153","article-title":"Boosting structured prediction for imitation learning","author":"ratliff","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.3115\/1118853.1118871"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015341"},{"key":"ref57","first-page":"2253","article-title":"A reduction from apprenticeship learning to classification","author":"syed","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref56","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8291.001.0001","author":"schapire","year":"2012","journal-title":"Boosting Foundations and Algorithms"},{"key":"ref55","first-page":"pp. 537","article-title":"Normalized online learning","author":"ross","year":"0","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref54","first-page":"627","article-title":"A reduction of imitation learning and structured prediction to no-regret online learning","author":"ross","year":"0","journal-title":"Proc Workshop Artif Intell Statist"},{"key":"ref53","first-page":"885","article-title":"On the consistency of output code based learning algorithms for multiclass learning problems","author":"ramaswamy","year":"0","journal-title":"Proc 27th Annu Conf Learn Theory"},{"key":"ref52","article-title":"Large margin online learning algorithms for scalable structured classification","author":"mcdonald","year":"0","journal-title":"Proc NIPS Workshop Learning Structured Outputs"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102358"},{"key":"ref11","first-page":"163","article-title":"Label embedding trees for large multi-class tasks","author":"bengio","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390212"},{"key":"ref12","first-page":"199","article-title":"Agnostic active learning without constraints","author":"beygelzimer","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557040"},{"key":"ref14","first-page":"720","article-title":"Weighted one against all","author":"beygelzimer","year":"0","journal-title":"Proc 20th Nat Conf Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_22"},{"key":"ref16","first-page":"203","article-title":"Beating the holdout: Bounds for KFold and progressive cross-validation","author":"blum","year":"0","journal-title":"Proc 12th Annu Conf Comput Learn Theory"},{"key":"ref17","author":"bottou","year":"2011","journal-title":"crfsgd project"},{"key":"ref18","first-page":"2058","article-title":"Learning to search better than your teacher","author":"chang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_26"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5176-9"},{"key":"ref3","first-page":"1653","article-title":"Surrogate regret bounds for bipartite ranking via strongly proper losses","volume":"15","author":"agarwal","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref5","first-page":"113","article-title":"Reducing multiclass to binary: A unifying approach for margin classifiers","volume":"1","author":"allwein","year":"2000","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1198\/016214505000000907"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143853"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.2307\/2006193"},{"key":"ref9","first-page":"586","article-title":"Guess-averse loss functions for cost-sensitive multiclass boosting","author":"beijbom","year":"0","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref46","author":"langford","year":"2007","journal-title":"Vowpal wabbit online learning project"},{"key":"ref45","first-page":"158","article-title":"Sensitive error correcting output codes","author":"langford","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63487"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref42","author":"kudo","year":"2005","journal-title":"CRF++ project"},{"key":"ref41","first-page":"392","article-title":"Online importance weight aware updates","author":"karampatziakis","year":"0","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref44","first-page":"316","article-title":"Robust efficient conditional probability estimation","author":"langford","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref43","first-page":"282","article-title":"Conditional random fields: Probabilistic models for segmenting and labeling sequence data","author":"lafferty","year":"0","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/7360840\/07352305.pdf?arnumber=7352305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T03:36:53Z","timestamp":1692157013000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7352305\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":66,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2015.2494118","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}