Sharpening Occam's Razor: A Kolmogorov Complexity-Based Approach: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:4903:49, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,090 bytes +2,090‎ Created page with "Title: Sharpening Occam's Razor: A Kolmogorov Complexity-Based Approach Abstract: This research article presents a new formulation of Occam's razor theorem, based on Kolmogorov complexity. This formulation allows for better sample complexity than both length-based and VC-based versions of Occam's razor theorem in many applications, and achieves a sharper reverse of Occam's razor theorem. The authors weaken the assumptions made in a previous study [5] and extend the reve..."
Retrieved from "https://simplesci.org/wiki/Sharpening_Occam%27s_Razor:_A_Kolmogorov_Complexity-Based_Approach"