arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.03718cs.LG
收藏

多尺度拉普拉斯学习

Multiscale Laplacian Learning

Michigan State University(密歇根州立大学);University of Kentucky(肯塔基大学)

Ekaterina Merkurjev, Duc DUy Nguyen, Guo-Wei Wei

摘要:

机器学习方法极大地改变了科学、工程、金融、商业和其他领域。尽管机器学习和深度学习方法取得了巨大的成就,但仍然存在许多挑战。特别地,机器学习方法的性能在不同数据的情况下通常受到严重影响,这些数据通常与较小的数据集或与研究领域相关的数据相关联,其中数据集的大小受到实验的复杂性和/或高成本的约束。此外,具有有限标记样本的数据对大多数学习方法来说是一个挑战。在本文中,上述挑战是通过整合基于图的框架,多尺度结构,修改和适应优化程序和半监督技术。这就产生了两种创新的多尺度拉普拉斯学习(MLL)方法,用于机器学习任务,如数据分类,以及处理不同的数据,有限样本的数据和较小的数据集。第一种方法称为多核流形学习(MML),将流形学习与多核信息相结合,并使用多尺度图拉普拉斯算子解决由损失函数和扭曲核正则化器组成的正则化问题。第二种方法,称为多尺度MBO(MMBO)方法,引入多尺度Laplacian著名的经典Merriman-Bence-Osher(MBO)计划的修改,并利用快速求解器找到的极值特征向量的图形Laplacian的近似。我们证明了我们的方法实验上的各种数据集,如生物,文本和图像数据的性能,并比较他们有利的现有方法。

英文摘要:

Machine learning methods have greatly changed science, engineering, finance, business, and other fields. Despite the tremendous accomplishments of machine learning and deep learning methods, many challenges still remain. In particular, the performance of machine learning methods is often severely affected in case of diverse data, usually associated with smaller data sets or data related to areas of study where the size of the data sets is constrained by the complexity and/or high cost of experiments. Moreover, data with limited labeled samples is a challenge to most learning approaches. In this paper, the aforementioned challenges are addressed by integrating graph-based frameworks, multiscale structure, modified and adapted optimization procedures and semi-supervised techniques. This results in two innovative multiscale Laplacian learning (MLL) approaches for machine learning tasks, such as data classification, and for tackling diverse data, data with limited samples and smaller data sets. The first approach, called multikernel manifold learning (MML), integrates manifold learning with multikernel information and solves a regularization problem consisting of a loss function and a warped kernel regularizer using multiscale graph Laplacians. The second approach, called the multiscale MBO (MMBO) method, introduces multiscale Laplacians to a modification of the famous classical Merriman-Bence-Osher (MBO) scheme, and makes use of fast solvers for finding the approximations to the extremal eigenvectors of the graph Laplacian. We demonstrate the performance of our methods experimentally on a variety of data sets, such as biological, text and image data, and compare them favorably to existing approaches.

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

↑