arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.20274cs.FLcs.LG
收藏

索洛蒙夫归纳

Solomonoff induction

Munich Center for Mathematical Philosophy (MCMP), LMU Munich(慕尼黑数学哲学中心(MCMP)、慕尼黑大学);Munich Center for Machine Learning (MCML)(慕尼黑机器学习中心(MCML))

Tom F. Sterkenburg

AI总结:

本文探讨了索洛蒙夫的通用预测方法,分析其可计算性假设及失败原因,并讨论其对奥卡姆剃刀原则和机器学习理论的理想意义。

摘要:

本文探讨了索洛蒙夫的通用预测方法,分析其可计算性假设及失败原因,并讨论其对奥卡姆剃刀原则和机器学习理论的理想意义。

英文摘要:

This chapter discusses the Solomonoff approach to universal prediction. The crucial ingredient in the approach is the notion of computability, and I present the main idea as an attempt to meet two plausible computability desiderata for a universal predictor. This attempt is unsuccessful, which is shown by a generalization of a diagonalization argument due to Putnam. I then critically discuss purported gains of the approach, in particular it providing a foundation for the methodological principle of Occam's razor, and it serving as a theoretical ideal for the development of machine learning methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑