Co-occurring keywords · papers mentioning both
Papers
Bootstrap-Based Regularization for Low-Rank Matrix Estimation
JMLR 2016
Dynamic matrix recovery from incomplete observations under an exact low-rank constraint
NeurIPS 2016
Fast recovery from a union of subspaces
NeurIPS 2016
Fitting Spectral Decay with the k-Support Norm
AISTATS 2016
Global Convergence of a Grassmannian Gradient Descent Algorithm for Subspace Estimation
AISTATS 2016
High Dimensional Structured Superposition Models
NeurIPS 2016
Low-Rank Regression with Tensor Responses
NeurIPS 2016
Matrix Completion has No Spurious Local Minimum
NeurIPS 2016
Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling
NeurIPS 2016
Online Learning with Low Rank Experts
COLT 2016
On the low-rank approach for semidefinite programs arising in synchronization and community detection
COLT 2016
Optimal Statistical and Computational Rates for One Bit Matrix Completion
AISTATS 2016
Probabilistic Low-Rank Matrix Completion from Quantized Measurements
JMLR 2016
Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent
NeurIPS 2016
Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
JMLR 2016
Robust Principal Component Analysis with Side Information
ICML 2016
A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements
NeurIPS 2015
Analysis of Robust PCA via Local Incoherence
NeurIPS 2015
A Supervised Low-Rank Method for Learning Invariant Subspaces
ICCV 2015
Classification with Low Rank and Missing Data
ICML 2015
Clique-Graph Matching by Preserving Global & Local Structure
CVPR 2015
Collaborative Filtering with Graph Information: Consistency and Scalable Methods
NeurIPS 2015
Collaboratively Learning Preferences from Ordinal Data
NeurIPS 2015
Completing Any Low-rank Matrix, Provably
JMLR 2015
Efficient Compressive Phase Retrieval with Constrained Sensing Vectors
NeurIPS 2015