Abstract:
|
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. |