arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0707.0303stat.MLstat.ME
收藏

从相关观测中学习

Learning from dependent observations

Ingo Steinwart, Don Hush, Clint Scovel

摘要:

在大多数建立学习算法的一致性的论文中,假设用于训练的观察是i.i.d.的实现。过程在本文中,我们远远超出了这个经典的框架,支持向量机(SVM)基本上只需要数据生成过程满足一定的大数定律。然后,我们考虑支持向量机的可学习性$\a$混合(不一定是固定的)过程的分类和回归,后者,我们明确允许无界噪声。

英文摘要:

In most papers establishing consistency for learning algorithms it is assumed that the observations used for training are realizations of an i.i.d. process. In this paper we go far beyond this classical framework by showing that support vector machines (SVMs) essentially only require that the data-generating process satisfies a certain law of large numbers. We then consider the learnability of SVMs for $\a$-mixing (not necessarily stationary) processes for both classification and regression, where for the latter we explicitly allow unbounded noise.

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

↑