Sharpening Occam's Razor

Details Sharpening Occam's Razor Sharpening Occam's Razor

2002-01-08

arxiv.org/abs/cs/0201005v2

Computer Science

Learning

LaTeX 13 pages; Proc 8th COCOON, LNCS 2387, Springer-Verlag, Berlin, 2002, 411--419

Scientific paper

We provide a new representation-independent formulation of Occam's razor theorem, based on Kolmogorov complexity. This new formulation allows us to: (i) Obtain better sample complexity than both length-based and VC-based versions of Occam's razor theorem, in many applications. (ii) Achieve a sharper reverse of Occam's razor theorem than previous work. Specifically, we weaken the assumptions made in an earlier publication, and extend the reverse to superpolynomial running times.

Affiliated with

Also associated with

No associations

Rating

Sharpening Occam's Razor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sharpening Occam's Razor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharpening Occam's Razor will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-321629