Multiscale Laplacian Learning

TL;DR

This paper introduces two innovative multiscale Laplacian learning methods that enhance machine learning performance on diverse, limited, or small datasets by integrating graph-based frameworks and multiscale structures.

Contribution

The paper presents two novel multiscale Laplacian learning approaches, MML and MMBO, combining manifold learning, multikernel information, and modified optimization for improved data classification.

Findings

Methods outperform existing approaches on biological, text, and image datasets.

Effective handling of small and diverse datasets demonstrated.

Enhanced semi-supervised learning capabilities shown through experiments.

Abstract

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.