Find a witness or shatter: the landscape of computable PAC learning
dc.article.number | arXiv:2302.04731 | |
dc.catalogador | aba | |
dc.contributor.author | Delle Rose, Valentino | |
dc.contributor.author | Kozachinskiy, Alexander | |
dc.contributor.author | Rojas González, Luis Cristóbal | |
dc.contributor.author | Steifer, Tomasz | |
dc.date.accessioned | 2023-08-29T16:35:30Z | |
dc.date.available | 2023-08-29T16:35:30Z | |
dc.date.issued | 2023 | |
dc.description.abstract | This paper contributes to the study of CPAC learnability -- a computable version of PAC learning -- by solving three open questions from recent papers. Firstly, we prove that every improperly CPAC learnable class is contained in a class which is properly CPAC learnable with polynomial sample complexity. This confirms a conjecture by Agarwal et al (COLT 2021). Secondly, we show that there exists a decidable class of hypothesis which is properly CPAC learnable, but only with uncomputably fast growing sample complexity. This solves a question from Sterkenburg (COLT 2022). Finally, we construct a decidable class of finite Littlestone dimension which is not improperly CPAC learnable, strengthening a recent result of Sterkenburg (2022) and answering a question posed by Hasrati and Ben-David (ALT 2023). Together with previous work, our results provide a complete landscape for the learnability problem in the CPAC setting. | |
dc.description.funder | European Union | |
dc.fechaingreso.objetodigital | 2023-08-29 | |
dc.fuente.origen | WOS | |
dc.identifier.doi | 10.48550/arXiv.2302.04731 | |
dc.identifier.uri | https://doi.org/10.48550/arXiv.2302.04731 | |
dc.identifier.uri | https://repositorio.uc.cl/handle/11534/74543 | |
dc.identifier.wosid | PPRN:36866201 | |
dc.information.autoruc | Instituto de Ingeniería Matemática y Computacional; Rojas González, Luis Cristóbal; 0000-0002-9037-6102; 1182858 | |
dc.language.iso | en | |
dc.nota.acceso | Contenido completo | |
dc.revista | Arxiv | |
dc.rights | acceso abierto | |
dc.subject.ddc | 510 | |
dc.subject.dewey | Matemática física y química | es_ES |
dc.title | Find a witness or shatter: the landscape of computable PAC learning | |
dc.type | preprint | |
sipa.codpersvinculados | 1182858 | |
sipa.index | WOS | |
sipa.trazabilidad | WOS;2023-07-06 | |
sipa.trazabilidad | ORCID;2023-08-28 |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Find a witness or shatter.pdf
- Size:
- 184.84 KB
- Format:
- Adobe Portable Document Format
- Description: