{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:02:53Z","timestamp":1750492973300,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451104","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"504-517","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["VC dimension and distribution-free sample-based testing"],"prefix":"10.1145","author":[{"given":"Eric","family":"Blais","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Ferreira Pinto Jr.","sequence":"additional","affiliation":[{"name":"Google, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathaniel","family":"Harms","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462817"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102410973"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.19086\/da.7757"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000292"},{"key":"e_1_3_2_1_5_1","volume-title":"Conference on Learning Theory. Pages 47\u201380","author":"Alon Noga","year":"2016","unstructured":"Noga Alon, Shay Moran, and Amir Yehudayoff. 2016. Sign rank versus VC dimension. In Conference on Learning Theory. Pages 47\u201380. http:\/\/proceedings.mlr.press\/v49\/alon16.html"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.64"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00000-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0467-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-012-0040-x"},{"key":"e_1_3_2_1_10_1","volume-title":"Renato Ferreira Pinto Jr., and Nathaniel Harms","author":"Blais Eric","year":"2020","unstructured":"Eric Blais, Renato Ferreira Pinto Jr., and Nathaniel Harms. 2020. VC Dimension and Distribution-Free Sample-Based Testing. arxiv:2012.03923"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20807"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 31st Conference On Learning Theory. http:\/\/proceedings.mlr.press\/v75\/blum18a.html","author":"Blum Avrim","year":"2018","unstructured":"Avrim Blum and Lunjia Hu. 2018. Active tolerant testing. In Proceedings of the 31st Conference On Learning Theory. http:\/\/proceedings.mlr.press\/v75\/blum18a.html"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7_46"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.34"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2017.37"},{"key":"e_1_3_2_1_18_1","first-page":"2019","article-title":"Tight Lower Bounds on the VC-dimension of Geometric Set Systems","volume":"20","author":"Csik\u00f3s M\u00f3nika","year":"2019","unstructured":"M\u00f3nika Csik\u00f3s, Nabil H Mustafa, and Andrey Kupavskii. 2019. Tight Lower Bounds on the VC-dimension of Geometric Set Systems. J. Mach. Learn. Res., 20, 2019. Pages 81\u20131. https:\/\/www.jmlr.org\/papers\/volume20\/18-719\/18-719.pdf","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_19_1","first-page":"993","volume-title":"Conference on Learning Theory (COLT 2019). Proceedings of Machine Learning Research. 99","author":"De Anindya","year":"2019","unstructured":"Anindya De, Elchanan Mossel, and Joe Neeman. 2019. Is your function low dimensional? In Conference on Learning Theory (COLT 2019). Proceedings of Machine Learning Research. 99, PMLR. Pages 979\u2013993. http:\/\/proceedings.mlr.press\/v99\/de19a.html"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806763"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2020.98"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Sally Floyd. 1989. Space-bounded learning and the Vapnik-Chervonenkis dimension. https:\/\/www.icsi.berkeley.edu\/pubs\/techreports\/tr-89-61.pdf","DOI":"10.1016\/B978-0-08-094829-4.50028-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022660318680"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574389"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a010"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898355"},{"key":"e_1_3_2_1_29_1","unstructured":"Sariel Har-Peled. 2014. Determining the number of clusters using property testing algorithm. Theoretical Computer Science Stack Exchange. https:\/\/cstheory.stackexchange.com\/q\/25655"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.44"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.018"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.01.006"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1656"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.07.007"},{"key":"e_1_3_2_1_35_1","article-title":"Unlabeled compression schemes for maximum classes","volume":"8","author":"Kuzmin Dima","year":"2007","unstructured":"Dima Kuzmin and Manfred K Warmuth. 2007. Unlabeled compression schemes for maximum classes. Journal of Machine Learning Research, 8, Sep, 2007. Pages 2047\u20132081. http:\/\/jmlr.org\/papers\/v8\/kuzmin07a.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_36_1","first-page":"6705","volume-title":"Graph-based Discriminators: Sample Complexity and Expressiveness. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019 (NeurIPS","author":"Livni Roi","year":"2019","unstructured":"Roi Livni and Yishay Mansour. 2019. Graph-based Discriminators: Sample Complexity and Expressiveness. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019 (NeurIPS 2019). Pages 6696\u20136705. http:\/\/papers.nips.cc\/paper\/8895-graph-based-discriminators-sample-complexity-and-expressiveness"},{"key":"e_1_3_2_1_37_1","volume-title":"Machine Learning-International Workshop then Conference. Pages 195\u2013201","author":"Mansour Yishay","year":"1997","unstructured":"Yishay Mansour. 1997. Pessimistic decision tree pruning based on tree size. In Machine Learning-International Workshop then Conference. Pages 195\u2013201. https:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.54.3146 citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.54.3146"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/070707890"},{"key":"e_1_3_2_1_39_1","unstructured":"Shay Moran. 2012. Shattering Extremal Systems. arxiv:1211.2980"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46379-7_3"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591807"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2173-3"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/070701649"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00095"},{"volume-title":"Understanding machine learning: From theory to algorithms","author":"Shalev-Shwartz Shai","key":"e_1_3_2_1_46_1","unstructured":"Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding machine learning: From theory to algorithms. Cambridge university press."},{"key":"e_1_3_2_1_47_1","unstructured":"Sandeep Silwal. 2020. Personal communication."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16367-8_12"},{"key":"e_1_3_2_1_49_1","unstructured":"Li-Yang Tan. 2020. Personal communication."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993727"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.81"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.7146\/math.scand.a-10655"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(81)90274-0"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1665"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":55,"alternative-id":["10.1145\/3406325.3451104","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451104","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}