{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:27:55Z","timestamp":1760171275369,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2106659"],"award-info":[{"award-number":["CCF-2106659"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Intel Probabilistic Computing Center"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533330","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Computable PAC Learning of Continuous Features"],"prefix":"10.1145","author":[{"given":"Nathanael","family":"Ackerman","sequence":"first","affiliation":[{"name":"Harvard University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Asilis","sequence":"additional","affiliation":[{"name":"Boston College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieqi","family":"Di","sequence":"additional","affiliation":[{"name":"Boston College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cameron","family":"Freer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Baptiste","family":"Tristan","sequence":"additional","affiliation":[{"name":"Boston College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Nathanael Ackerman Julian Asilis Jieqi Di Cameron Freer and Jean-Baptiste Tristan. 2021. On Computable Learning of Continuous Features. arXiv e-print 2111.14630(2021). arXiv:2111.14630  Nathanael Ackerman Julian Asilis Jieqi Di Cameron Freer and Jean-Baptiste Tristan. 2021. On Computable Learning of Continuous Features. arXiv e-print 2111.14630(2021). arXiv:2111.14630"},{"key":"e_1_3_2_1_2_1","volume-title":"On the Computable Learning of Continuous Features. In Eighteenth International Conference on Computability and Complexity in Analysis. http:\/\/cca-net.de\/cca2021\/","author":"Ackerman Nathanael","year":"2021","unstructured":"Nathanael Ackerman , Julian Asilis , Jieqi Di , Cameron Freer , and Jean-Baptiste Tristan . 2021 . On the Computable Learning of Continuous Features. In Eighteenth International Conference on Computability and Complexity in Analysis. http:\/\/cca-net.de\/cca2021\/ Nathanael Ackerman, Julian Asilis, Jieqi Di, Cameron Freer, and Jean-Baptiste Tristan. 2021. On the Computable Learning of Continuous Features. In Eighteenth International Conference on Computability and Complexity in Analysis. http:\/\/cca-net.de\/cca2021\/"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 31st International Conference on Algorithmic Learning Theory (ALT)(PMLR, Vol.\u00a0117)","author":"Agarwal Sushant","year":"2020","unstructured":"Sushant Agarwal , Nivasini Ananthakrishnan , Shai Ben-David , Tosca Lechner , and Ruth Urner . 2020 . On Learnability with Computable Learners . In Proceedings of the 31st International Conference on Algorithmic Learning Theory (ALT)(PMLR, Vol.\u00a0117) . 48\u201360. http:\/\/proceedings.mlr.press\/v117\/agarwal20b.html Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, and Ruth Urner. 2020. On Learnability with Computable Learners. In Proceedings of the 31st International Conference on Algorithmic Learning Theory (ALT)(PMLR, Vol.\u00a0117). 48\u201360. http:\/\/proceedings.mlr.press\/v117\/agarwal20b.html"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2014.23"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"volume-title":"Handbook of Computability and Complexity in Analysis","author":"Brattka Vasco","key":"e_1_3_2_1_6_1","unstructured":"Vasco Brattka , Guido Gherardi , and Arno Pauly . 2021. Weihrauch Complexity in Computable Analysis . In Handbook of Computability and Complexity in Analysis , Vasco Brattka and Peter Hertling (Eds.). Springer , 367\u2013417. https:\/\/doi.org\/10.1007\/978-3-030-59234-9_11 10.1007\/978-3-030-59234-9_11 Vasco Brattka, Guido Gherardi, and Arno Pauly. 2021. Weihrauch Complexity in Computable Analysis. In Handbook of Computability and Complexity in Analysis, Vasco Brattka and Peter Hertling (Eds.). Springer, 367\u2013417. https:\/\/doi.org\/10.1007\/978-3-030-59234-9_11"},{"volume-title":"New Computational Paradigms","author":"Brattka Vasco","key":"e_1_3_2_1_7_1","unstructured":"Vasco Brattka , Peter Hertling , and Klaus Weihrauch . 2008. A tutorial on computable analysis . In New Computational Paradigms . Springer , 425\u2013491. https:\/\/doi.org\/10.1007\/978-0-387-68546-5_18 10.1007\/978-0-387-68546-5_18 Vasco Brattka, Peter Hertling, and Klaus Weihrauch. 2008. A tutorial on computable analysis. In New Computational Paradigms. Springer, 425\u2013491. https:\/\/doi.org\/10.1007\/978-0-387-68546-5_18"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00693-X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-015-0445-8"},{"key":"e_1_3_2_1_10_1","unstructured":"Tonicha Crook Jay Morgan Arno Pauly and Markus Roggenbach. 2021. A Computability Perspective on (Verified) Machine Learning. arXiv e-print 2102.06585(2021). arXiv:2102.06585  Tonicha Crook Jay Morgan Arno Pauly and Markus Roggenbach. 2021. A Computability Perspective on (Verified) Machine Learning. arXiv e-print 2102.06585(2021). arXiv:2102.06585"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022660318680"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.009"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1602"},{"volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"Shalev-Shwartz Shai","key":"e_1_3_2_1_15_1","unstructured":"Shai Shalev-Shwartz and Shai Ben-David . 2014. Understanding Machine Learning: From Theory to Algorithms . Cambridge University Press . https:\/\/doi.org\/10.1017\/CBO9781107298019 10.1017\/CBO9781107298019 Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9781107298019"},{"key":"e_1_3_2_1_16_1","unstructured":"David Soloveichik. 2008. Statistical Learning of Arbitrary Computable Classifiers. arXiv e-print 0806.3537(2008). arxiv:0806.3537  David Soloveichik. 2008. Statistical Learning of Arbitrary Computable Classifiers. arXiv e-print 0806.3537(2008). arxiv:0806.3537"},{"key":"e_1_3_2_1_17_1","unstructured":"Tom\u00a0F. Sterkenburg. 2022. On characterizations of learnability with computable learners. arXiv e-print 2202.05041(2022). arXiv:2202.05041  Tom\u00a0F. Sterkenburg. 2022. On characterizations of learnability with computable learners. arXiv e-print 2202.05041(2022). arXiv:2202.05041"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_19_1","volume-title":"On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Theory of Probability and its Applications 16, 2","author":"Vapnik N.","year":"1971","unstructured":"V.\u00a0 N. Vapnik and A.\u00a0 Ya. Chervonenkis . 1971. On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Theory of Probability and its Applications 16, 2 ( 1971 ), 264\u2013280. https:\/\/doi.org\/10.1137\/1116025 10.1137\/1116025 V.\u00a0N. Vapnik and A.\u00a0Ya. Chervonenkis. 1971. On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Theory of Probability and its Applications 16, 2 (1971), 264\u2013280. https:\/\/doi.org\/10.1137\/1116025"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533330","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533330","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":20,"alternative-id":["10.1145\/3531130.3533330","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533330","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}