在线稀疏化准则的近似误差
Approximation errors of online sparsification criteria
摘要:
许多机器学习框架,如资源分配网络,基于核的方法,高斯过程和径向基函数网络,需要一个稀疏化方案,以解决在线学习范式。为此,已经提出了几个在线稀疏化标准,以限制模型定义的样本的子集。最著名的标准是(线性)近似标准,它丢弃任何可以很好地由已经贡献的样本表示的样本,这是一种具有过度计算复杂性的操作。一些计算效率高的稀疏化标准已经在文献中介绍,如距离,相干性和巴贝尔标准。在本文中,我们提供了一个框架,这些稀疏化标准的问题,近似样本,通过推导理论界的近似误差。此外,我们调查近似任何功能的错误,提出了上述稀疏化标准的近似误差的上限。详细描述了核主成分分析中的两类特征:经验均值和主轴。
英文摘要:
Many machine learning frameworks, such as resource-allocating networks, kernel-based methods, Gaussian processes, and radial-basis-function networks, require a sparsification scheme in order to address the online learning paradigm. For this purpose, several online sparsification criteria have been proposed to restrict the model definition on a subset of samples. The most known criterion is the (linear) approximation criterion, which discards any sample that can be well represented by the already contributing samples, an operation with excessive computational complexity. Several computationally efficient sparsification criteria have been introduced in the literature, such as the distance, the coherence and the Babel criteria. In this paper, we provide a framework that connects these sparsification criteria to the issue of approximating samples, by deriving theoretical bounds on the approximation errors. Moreover, we investigate the error of approximating any feature, by proposing upper-bounds on the approximation error for each of the aforementioned sparsification criteria. Two classes of features are described in detail, the empirical mean and the principal axes in the kernel principal component analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。