arXiv Analytics

Sign in

arXiv:1810.06803 [stat.ML]AbstractReferencesReviewsResources

Co-manifold learning with missing data

Gal Mishne, Eric C. Chi, Ronald R. Coifman

Published 2018-10-16Version 1

Representation learning is typically applied to only one mode of a data matrix, either its rows or columns. Yet in many applications, there is an underlying geometry to both the rows and the columns. We propose utilizing this coupled structure to perform co-manifold learning: uncovering the underlying geometry of both the rows and the columns of a given matrix, where we focus on a missing data setting. Our unsupervised approach consists of three components. We first solve a family of optimization problems to estimate a complete matrix at multiple scales of smoothness. We then use this collection of smooth matrix estimates to compute pairwise distances on the rows and columns based on a new multi-scale metric that implicitly introduces a coupling between the rows and the columns. Finally, we construct row and column representations from these multi-scale metrics. We demonstrate that our approach outperforms competing methods in both data visualization and clustering.

Related articles: Most relevant | Search more
arXiv:1904.01385 [stat.ML] (Published 2019-04-02)
UAFS: Uncertainty-Aware Feature Selection for Problems with Missing Data
arXiv:1905.00709 [stat.ML] (Published 2019-05-02)
Phase transition in PCA with missing data: Reduced signal-to-noise ratio, not sample size!
arXiv:2205.03820 [stat.ML] (Published 2022-05-08)
Some performance considerations when using multi-armed bandit algorithms in the presence of missing data