Name
Abstract | ||
|---|---|---|
We study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity: the PACS model. We relate the query model and the simple-PAC model with PACS. Using these relationships and previous results in those models we are able to get alternative proofs to all known results in the PACS model in a systematic way. (C) 2000 Published by Elsevier Science B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0020-0190(99)00161-1 | Inf. Process. Lett. |
Keywords | Field | DocType |
query learning,probability distribution,pac learning,theory of computation | Query learning,Kolmogorov complexity,Computer science,Theoretical computer science,Mathematical proof,Probability distribution,Artificial intelligence,Theory of computation | Journal |
Volume | Issue | ISSN |
73 | 1-2 | 0020-0190 |
Citations | PageRank | References |
2 | 0.38 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jorge Castro | 1 | 34 | 3.27 |
| David Guijarro | 2 | 2 | 0.38 |