title: Ensemble manifold regularization.
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.
authors.affiliation: Key Laboratory of Machine Perception (Ministry of Education), Peking University, Beijing 100871, China. bogeng@pku.edu.cn
authors.forename: Bo
authors.initials: B
authors.lastname: Geng
authors.forename: Dacheng
authors.initials: D
authors.lastname: Tao
authors.forename: Chao
authors.initials: C
authors.lastname: Xu
authors.forename: Linjun
authors.initials: L
authors.lastname: Yang
authors.forename: Xian-Sheng
authors.initials: XS
authors.lastname: Hua
mesh_terms: D000465:Algorithms; D057225:Data Mining / Q000379:methods*; D016208:Databases, Factual; D010363:Pattern Recognition, Automated; D060388:Support Vector Machine