published by Paul Vitanyi
in 2002
in Informatics Engineering
and research's language is
English
Download
Abstract in English
We provide a new representation-independent formulation of Occams razor theorem, based on Kolmogorov complexity. This new formulation allows us to: (i) Obtain better sample complexity than both length-based and VC-base