“Solomonoff induction seems to be an useful innate bias for the current approaches at general intelligence. It's basically a formalization of Occam's razor that states that instead of being completely random, the surrounding environment is mostly lawful and simple, and therefore most of the processes in it can be described by algorithms with short rather t…”
No Free Lunch versus Occam's Razor in Supervised Learning
The No Free Lunch theorems are often used to argue that domain specific knowledge is required to design successful algorithms. We use algorithmic information theory to argue the case for a universal bias allowing an algorithm to succeed in all interesting problem domains. Additionally, we give a new algorithm for off-line classification, inspired by Solomonoff induction, with good performance on all structured problems under reasonable assumptions. This includes a proof of the efficacy of the well-known heuristic of randomly selecting training data in the hope of reducing misclassification rates.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“The No Free Lunch Theorem is irrelevant to the real world [0][1]. It assumes all functions, even those with infinite algorithmic complexity, are equally likely. You should look into algorithmic probability for a better foundation. [0] http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.540.7938 [1] https://arxiv.org/abs/1111.3846.pdf”