Active Learning Based on Locally Linear Reconstruction

Citations Over TimeTop 10% of 2011 papers

Abstract

We consider the active learning problem, which aims to select the most representative points. Out of many existing active learning techniques, optimum experimental design (OED) has received considerable attention recently. The typical OED criteria minimize the variance of the parameter estimates or predicted value. However, these methods see only global euclidean structure, while the local manifold structure is ignored. For example, I-optimal design selects those data points such that other data points can be best approximated by linear combinations of all the selected points. In this paper, we propose a novel active learning algorithm which takes into account the local structure of the data space. That is, each data point should be approximated by the linear combination of only its neighbors. Given the local reconstruction coefficients for every data point and the coordinates of the selected points, a transductive learning algorithm called Locally Linear Reconstruction (LLR) is proposed to reconstruct every other point. The most representative points are thus defined as those whose coordinates can be used to best reconstruct the whole data set. The sequential and convex optimization schemes are also introduced to solve the optimization problem. The experimental results have demonstrated the effectiveness of our proposed method.

Related Papers

• → AN OPTIMIZATION METHOD FOR THE DESIGN OF LARGE, HIGHLY CONSTRAINED COMPLEX SYSTEMS(1981)64 cited
• → A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS(2004)9 cited
• → On-line optimization of the power supplied in a microgrid prototype(2015)4 cited
• → Structural Optimization of Energy Supply Systems by a Decomposition Method for Mixed-Integer Linear Programming.(2000)2 cited