| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Sharpening Occam's Razor | Ming Li
; John Tromp
; Paul Vitanyi
; | Date: |
8 Dec 2001 | Subject: | Learning; Artificial Intelligence; Computational Complexity; Probability; Data Analysis, Statistics and Probability; Disordered Systems and Neural Networks ACM-class: F.2, E.4, I.2 | cs.LG cond-mat.dis-nn cs.AI cs.CC math.PR physics.data-an | Affiliation: | Univ. Waterloo), John Tromp (CWI), and Paul Vitanyi (CWI and University of Amsterdam | Abstract: | 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. | Source: | arXiv, cs.LG/0201005 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |