On the convergence of maximum variance unfolding - Université de Rennes Accéder directement au contenu
Article Dans Une Revue Journal of Machine Learning Research Année : 2013

On the convergence of maximum variance unfolding

Résumé

Maximum Variance Unfolding is one of the main methods for (nonlinear) dimensionality reduction. We study its large sample limit, providing specific rates of convergence under standard assumptions. We find that it is consistent when the underlying submanifold is isometric to a convex subset, and we provide some simple examples where it fails to be consistent.

Dates et versions

hal-00771311 , version 1 (08-01-2013)

Identifiants

Citer

Ery Arias-Castro, Bruno Pelletier. On the convergence of maximum variance unfolding. Journal of Machine Learning Research, 2013, 14, pp.1747-1770. ⟨hal-00771311⟩
112 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More