Query, PACS and simple-PAC learning
We study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity. We relate the PACS model, defined by Denis, D'Halluin and Gilleron, with the standard simple-PAC model and give a general technique that subsumes the results of Denis et...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/84029 |
| Acceso en línea: | https://hdl.handle.net/2117/84029 |
| Access Level: | acceso abierto |
| Palabra clave: | PAC learning Kolmogorov complexity Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | We study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity. We relate the PACS model, defined by Denis, D'Halluin and Gilleron, with the standard simple-PAC model and give a general technique that subsumes the results of Denis et al and Parekh and Honavar. |
|---|