Sharpening Occam's Razor
Ming Li, John Tromp, Paul Vitanyi
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.
Create a lesson
Related papers
Reinforcement Learning Enables Scaling Generalist Robot Policy Improvement
Michal Korniak, Marco Bagatella, Ralf Römer et al.
Adaptive Multi Mode: Budget-Aware Routing of Optimizers By Online Landscape Probes
Benjamin Jacob Bodner
Navigating Disagreement Among Criteria for Evaluating Explanation Faithfulness
Grant Shanklin, Jiří Němeček, Asia Biega
Context--Answer Metamodels: Forecasting LLM Activations Before the First Answer Token
Tommy He, Thomas Jiralerspong
Systolic Linear Attention: Co-Designing Tile-Grouped Gated Delta Attention for TPUs
Gagik Amirkhanyan, Nuojin Cheng
Message-passing graph persistence
Jorge Luiz Franco, Arthur Queiroz Moura, Moacir Ponti et al.