arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.09500cs.LGstat.ML
收藏

机器学习的逻辑

Logic of Machine Learning

Marina Sapir

摘要:

主要的问题是:我们为什么以及如何能够根据有限的样本进行预测?统计学习理论无法回答这个问题。在这里,我认为预测需要对潜在依赖的“可预测性”的信念,而学习涉及寻找一个假设,在这个假设中,这些信念在观察中被违反的程度最小。这些违规(“错误”)的措施,为给定的数据,假设和特定类型的可预测性信念形式化的概念不协调的观察和假设的模态逻辑(LOH)。我展示了许多流行的教科书学习器(从层次聚类到k-NN和SVM)的例子,他们每个人都最大限度地减少了自己版本的不一致。此外,不协调的概念被证明是足够灵活的形式化的一些重要的数据分析问题,不被认为是ML的一部分。

英文摘要:

The main question is: why and how can we ever predict based on a finite sample? The question is not answered by statistical learning theory. Here, I suggest that prediction requires belief in "predictability" of the underlying dependence, and learning involves search for a hypothesis where these beliefs are violated the least given the observations. The measure of these violations ("errors") for given data, hypothesis and particular type of predictability beliefs is formalized as concept of incongruity in modal Logic of Observations and Hypotheses (LOH). I show on examples of many popular textbook learners (from hierarchical clustering to k-NN and SVM) that each of them minimizes its own version of incongruity. In addition, the concept of incongruity is shown to be flexible enough for formalization of some important data analysis problems, not considered as part of ML.

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

↑