Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Maximum variance unfolding"”.

  1. Subjective Mapping

    … dimensionality reduction algorithm called maximum variance unfolding, in order to solve the newly introduced subjective mapping problem. The resulting learned representations are shown to be useful for reasoning, planning and localization tasks. At the heart of the new algorithm lies a …

    waterloo Repository record for Subjective Mapping (opens in a new tab)

  2. Applications of Nonlinear Optimization

    … and estimate its accuracy. The first problem is maximum variance unfolding in machine learning. The traditional method to solve this problem is to convert it to a semi-definite optimization problem by defining a kernel matrix. We obtain better unfolding and higher speeds with the interior point …

    wustl Repository record for Applications of Nonlinear Optimization (opens in a new tab)

  3. Isometry and convexity in dimensionality reduction

    … of the art dimensionality reduction methods, Maximum Variance Unfolding (MVU) and Non-Negative Matrix Factorization (NMF). These two dimensionality reduction methods do not fit under the umbrella of Kernel PCA. MVU is cast as a Semidefinite Program, a modern convex nonlinear optimization …

    gatech Repository record for Isometry and convexity in dimensionality reduction (opens in a new tab)

  4. Learning with Scalability and Compactness

    … search which is recently ameliorated by Maximum Variance Unfolding (MVU), a manifold learning algorithm capable of learning state embeddings as effective heuristics to speed up $A^*$ search. Though achieving unprecedented online search performance with constraints on memory footprint, MVU …

    wustl Repository record for Learning with Scalability and Compactness (opens in a new tab)