{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:03:54Z","timestamp":1729613034203,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1109\/ita.2016.7888187","type":"proceedings-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T00:41:16Z","timestamp":1490920876000},"page":"1-14","source":"Crossref","is-referenced-by-count":2,"title":["Sample compression schemes for VC classes"],"prefix":"10.1109","author":[{"given":"Shay","family":"Moran","sequence":"first","affiliation":[]},{"given":"Amir","family":"Yehudayoff","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176988847"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116037"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11662-4_20"},{"key":"ref30","first-page":"1221","article-title":"A geometric approach to sample compression","volume":"13","author":"rubinstein","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_60"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993593"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1136"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"journal-title":"Boosting Foundations and Algorithms Adaptive computation and machine learning","year":"2012","author":"freund","key":"ref13"},{"key":"ref14","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"guyon","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0221019"},{"journal-title":"Thoughts on hypothesis boosting","year":"1988","author":"kearns","key":"ref16"},{"key":"ref17","first-page":"433","article-title":"Cryptographic limitations on learning boolean formulae and finite automata","author":"kearns","year":"1989","journal-title":"STOC"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","author":"kearns","year":"1994","journal-title":"An Introduction to Computational Learning Theory"},{"key":"ref19","first-page":"2047","article-title":"Unlabeled compression schemes for maximum classes","volume":"8","author":"kuzmin","year":"2007","journal-title":"Journal of Machine Learning Research"},{"journal-title":"Game Theory","year":"1995","author":"owen","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448847"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00000-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801389"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-012-0061-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176991978"},{"key":"ref7","first-page":"287","article-title":"Optimal learners for multiclass problems","author":"daniely","year":"2014","journal-title":"COLT"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-094829-4.50028-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.5802\/aif.938"},{"key":"ref20","first-page":"309","article-title":"Improved bounds on the sample complexity of learning","author":"li","year":"2000","journal-title":"SODA"},{"journal-title":"Simple strategies for large zero-sum games with applications to complexity theory","year":"2002","author":"lipton","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779933"},{"key":"ref24","first-page":"77","article-title":"Honest compressions and their application to compression schemes","author":"livni","year":"2013","journal-title":"COLT"},{"journal-title":"Relating data compression and learnability","year":"1986","author":"littlestone","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00114804"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.12"}],"event":{"name":"2016 Information Theory and Applications (ITA)","start":{"date-parts":[[2016,1,31]]},"location":"La Jolla, CA, USA","end":{"date-parts":[[2016,2,5]]}},"container-title":["2016 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7882033\/7888130\/07888187.pdf?arnumber=7888187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T08:09:11Z","timestamp":1568966951000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7888187\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/ita.2016.7888187","relation":{},"subject":[],"published":{"date-parts":[[2016,1]]}}}