← Back to papers
2016 JMLR JMLR 2016

Subspace Learning with Partial Information

Abstract

The goal of subspace learning is to find a $k$-dimensional subspace of $\mathbb{R}^d$, such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a partial information setting, in which the learner can only observe $r \le d$ attributes from each instance vector. We propose several efficient algorithms for this task, and analyze their sample complexity. [abs] [ pdf ][ bib ] © JMLR 2016. (edit, beta)

🐣 Hot Topic Early Bird — sample complexity
🐝 Cross-Pollinator — Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Machine Learning, Mathematics & Optimization, Reinforcement Learning, Robotics, Security & Privacy

Authors

Alon Gonen , Dan Rosenbaum , Yonina C. Eldar , Shai Shalev-shwartz

Topics

Machine Learning > Core Methods > Representation Learning Machine Learning > Core Methods > Embedding Learning Machine Learning > Core Methods > Dimensionality Reduction Machine Learning > Core Methods > Feature Selection Machine Learning > Learning Paradigms > Semi-Supervised Learning

Keywords

dimensionality reduction subspace learning feature selection sample complexity matrix approximation matrix completion partial information
Download PDF

Related papers

Trend Filtering on Graphs 2016
Causal Inference through a Witness Protection Program 2016
A Characterization of Linkage-Based Hierarchical Clustering 2016
How to Center Deep Boltzmann Machines 2016
Minimax Rates in Permutation Estimation for Feature Matching 2016