DeepAI AI Chat
Log In Sign Up

Bounded Manifold Completion

by   Kelum Gajamannage, et al.
Texas A&M University Corpus Christi
Worcester Polytechnic Institute

Nonlinear dimensionality reduction or, equivalently, the approximation of high-dimensional data using a low-dimensional nonlinear manifold is an active area of research. In this paper, we will present a thematically different approach to detect the existence of a low-dimensional manifold of a given dimension that lies within a set of bounds derived from a given point cloud. A matrix representing the appropriately defined distances on a low-dimensional manifold is low-rank, and our method is based on current techniques for recovering a partially observed matrix from a small set of fully observed entries that can be implemented as a low-rank Matrix Completion (MC) problem. MC methods are currently used to solve challenging real-world problems, such as image inpainting and recommender systems, and we leverage extent efficient optimization techniques that use a nuclear norm convex relaxation as a surrogate for non-convex and discontinuous rank minimization. Our proposed method provides several advantages over current nonlinear dimensionality reduction techniques, with the two most important being theoretical guarantees on the detection of low-dimensional embeddings and robustness to non-uniformity in the sampling of the manifold. We validate the performance of this approach using both a theoretical analysis as well as synthetic and real-world benchmark datasets.


page 10

page 11


Clipped Matrix Completion: a Remedy for Ceiling Effects

We consider the recovery of a low-rank matrix from its clipped observati...

A Nonlinear Dimensionality Reduction Framework Using Smooth Geodesics

Existing dimensionality reduction methods are adept at revealing hidden ...

On the Optimality of Nuclear-norm-based Matrix Completion for Problems with Smooth Non-linear Structure

Originally developed for imputing missing entries in low rank, or approx...

Probabilistic low-rank matrix completion on finite alphabets

The task of reconstructing a matrix given a sample of observedentries is...

Solving Interpretable Kernel Dimension Reduction

Kernel dimensionality reduction (KDR) algorithms find a low dimensional ...

Unrolling Swiss Cheese: Metric repair on manifolds with holes

For many machine learning tasks, the input data lie on a low-dimensional...