Nonlinear Learning using Local Coordinate Coding
Kai Yu, Tong Zhang, Yihong Gong · 2009
This paper introduces a new method for semi-supervised learning on high dimensional nonlinear manifolds, which includes a phase of unsupervised basis learning and a phase of supervised function learning. The learned bases provide a set of anchor points to form a local coordinate system, such that each data point x on the manifold can be locally approximated by a linear combination of its nearby anchor points, and the linear weights become its local coordinate coding. We show that a high dimensional nonlinear function can be approximated by a global linear function with respect to this coding scheme, and the approximation quality is ensured by the locality of such coding. The method turns a difficult nonlinear learning problem into a simple global linear learning problem, which overcomes some drawbacks of traditional local learning methods. 1
Cited by 669 works.
Authors
References
- Reducing the Dimensionality of Data with Neural Networks
- Nonlinear Dimensionality Reduction by Locally Linear Embedding
- A Global Geometric Framework for Nonlinear Dimensionality Reduction
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Efficient sparse coding algorithms
- Self-taught learning
- Sparse Feature Learning for Deep Belief Networks
- Local Learning Algorithms
- Supervised Dictionary Learning
- Local Regression: Automatic Kernel Carpentry