Ensemble Manifold Regularization

Citations Over TimeTop 1% of 2012 papers

Abstract

We propose an automatic approximation of the intrinsic manifold for general semi-supervised learning (SSL) problems. Unfortunately, it is not trivial to define an optimization function to obtain optimal hyperparameters. Usually, cross validation is applied, but it does not necessarily scale up. Other problems derive from the suboptimality incurred by discrete grid search and the overfitting. Therefore, we develop an ensemble manifold regularization (EMR) framework to approximate the intrinsic manifold by combining several initial guesses. Algorithmically, we designed EMR carefully so it 1) learns both the composite manifold and the semi-supervised learner jointly, 2) is fully automatic for learning the intrinsic manifold hyperparameters implicitly, 3) is conditionally optimal for intrinsic manifold approximation under a mild and reasonable assumption, and 4) is scalable for a large number of candidate manifold hyperparameters, from both time and space perspectives. Furthermore, we prove the convergence property of EMR to the deterministic matrix at rate root-n. Extensive experiments over both synthetic and real data sets demonstrate the effectiveness of the proposed framework.

Related Papers

• Random Projections for Manifold Learning(2007)
• → Manifold-Based Learning and Synthesis(2009)12 cited
• → A Fast Manifold Learning Algorithm for Dimensionality Reduction(2016)1 cited
• Manifold learning and applications to shape and image processing(2009)
• → An Improved Laplacian Eigenmaps Algorithm for Nonlinear Dimensionality Reduction(2015)