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

最小学习机:理论结果和基于排序的参考点选择

Minimal Learning Machine: Theoretical Results and Clustering-Based Reference Point Selection

University of Jyvaskyla(于韦斯屈莱大学);Federal University of Ceará - UFC(塞阿拉联邦大学);Federal Institute of Education, Science and Technology of Ceará - IFCE(塞阿拉联邦教育科学技术学院)

Joonas Hämäläinen, Alisson S. C. Alencar, Tommi Kärkkäinen, César L. C. Mattos, Amauri H. Souza Júnior, João P. P. Gomes

摘要:

最小学习机(MLM)是一种基于学习在输入和输出数据空间中计算的距离矩阵之间的线性映射的非线性监督方法,其中使用称为参考点的点的子集来计算距离。它的简单配方吸引了一些最近的工作扩展和应用。在本文中,我们的目的是解决一些与传销有关的公开问题。首先,我们详细的理论方面,保证插值和普遍的近似能力的MLM,这是以前只有经验验证。其次,我们确定的任务,选择参考点具有重大意义的MLM的泛化能力。然后提出并分析了几种基于聚类的回归场景参考点选择方法。基于广泛的实证评估,我们得出结论,评估的方法是可扩展的和有用的。具体而言,对于少量的参考点,基于聚类的方法优于原始MLM公式的标准随机选择。

英文摘要:

The Minimal Learning Machine (MLM) is a nonlinear supervised approach based on learning a linear mapping between distance matrices computed in the input and output data spaces, where distances are calculated using a subset of points called reference points. Its simple formulation has attracted several recent works on extensions and applications. In this paper, we aim to address some open questions related to the MLM. First, we detail theoretical aspects that assure the interpolation and universal approximation capabilities of the MLM, which were previously only empirically verified. Second, we identify the task of selecting reference points as having major importance for the MLM's generalization capability. Several clustering-based methods for reference point selection in regression scenarios are then proposed and analyzed. Based on an extensive empirical evaluation, we conclude that the evaluated methods are both scalable and useful. Specifically, for a small number of reference points, the clustering-based methods outperformed the standard random selection of the original MLM formulation.

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

↑