Nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization
Abstract
We describe an algorithm for nonlinear dimensionality reduction based on semidefinite programming and kernel matrix factorization. The algorithm learns a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. In earlier work, the kernel matrix was learned by maximizing the variance in feature space while preserving the distances and angles between nearest neighbors. In this paper, adapting recent ideas from semi-supervised learning on graphs, we show that the full kernel matrix can be very well approximated by a product of smaller matrices. Representing the kernel matrix in this way, we can reformulate the semidefinite program in terms of a much smaller submatrix of inner products between randomly chosen landmarks. The new framework leads to order-of-magnitude reductions in computation time and makes it possible to study much larger problems in manifold learning. 1
Cite
Text
Weinberger et al. "Nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization." Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, 2005.Markdown
[Weinberger et al. "Nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization." Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, 2005.](https://mlanthology.org/aistats/2005/weinberger2005aistats-nonlinear/)BibTeX
@inproceedings{weinberger2005aistats-nonlinear,
title = {{Nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization}},
author = {Weinberger, Kilian and Packer, Benjamin and Saul, Lawrence},
booktitle = {Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics},
year = {2005},
pages = {381-388},
volume = {R5},
url = {https://mlanthology.org/aistats/2005/weinberger2005aistats-nonlinear/}
}