Using Side Information to Reliably Learn Low-Rank Matrices from Missing and Corrupted Observations

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Journal of machine learning research

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Robust Principal Component Analysis with Side Information

  2016influential reference
• Robust PCA with compressed data

  2015cited by this paper
• Tumblr Blog Recommendation with Boosted Inductive Matrix Completion

  2015cited by this paper
• Matrix Completion with Noisy Side Information

  2015cited by this paper
• Efficient Matrix Sensing Using Rank-1 Gaussian Measurements

  2015influential reference
• Matrix Factorization Techniques for Recommender Systems

  2014influential reference
• Inductive matrix completion for predicting gene–disease associations

  2014cited by this paper
• PU Learning for Matrix Completion

  2014cited by this paper
• Nuclear Norm Minimization via Active Subspace Selection

  2014cited by this paper
• Matrix completion with the trace norm: learning, bounding, and transducing

  2014influential reference
• Prediction and clustering in signed networks: a local to global perspective

  2013influential reference
• Semi-supervised Clustering by Input Pattern Assisted Pairwise Similarity Matrix Completion

  2013influential reference
• Speedup Matrix Completion with Side Information: Application to Multi-Label Learning

  2013influential reference
• Provable Inductive Matrix Completion

  2013influential reference
• Low-rank matrix completion using alternating minimization

  2012influential reference
• Low rank modeling of signed networks

  2012influential reference
• SVDFeature: a toolkit for feature-based collaborative filtering

  2012influential reference
• Low-rank matrix recovery from errors and erasures

  2011cited by this paper
• Clustering Partially Observed Graphs via Convex Optimization

  2011cited by this paper
• Link Prediction via Matrix Factorization

  2011cited by this paper
• Predicting positive and negative links in online social networks

  2010cited by this paper
• Robust PCA via Outlier Pursuit

  2010cited by this paper
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise

  2010influential reference
• Robust Recovery of Subspace Structures by Low-Rank Representation

  2010influential reference
• Robust Subspace Segmentation by Low-Rank Representation

  2010cited by this paper
• Matrix Completion With Noise

  2009cited by this paper
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

  2009influential reference
• Rank-Sparsity Incoherence for Matrix Decomposition

  2009influential reference
• Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices

  2009influential reference
• Matrix Completion from Noisy Entries

  2009cited by this paper
• A Simpler Approach to Matrix Completion

  2009cited by this paper
• Robust principal component analysis?

  2009influential reference
• Constrained clustering by spectral kernel learning

  2009cited by this paper
• Exact Matrix Completion via Convex Optimization

  2008influential reference
• On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization

  2008cited by this paper
• A Singular Value Thresholding Algorithm for Matrix Completion

  2008cited by this paper
• Trust-aware Bootstrapping of Recommender Systems

  2006cited by this paper
• Information-theoretic metric learning

  2006cited by this paper
• Rank, Trace-Norm and Max-Norm

  2005cited by this paper
• Generalization Error Bounds for Bayesian Mixture Algorithms

  2003cited by this paper
• Optimal oblivious routing in polynomial time

  2003cited by this paper
• Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

  2003cited by this paper
• A rank minimization heuristic with application to minimum order system approximation

  2001cited by this paper
• Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization

  2001cited by this paper
• Eigenfaces for Recognition

  1991cited by this paper
• Analysis of a complex of statistical variables into principal components.

  1933cited by this paper

• Adaptively-weighted Nearest Neighbors for Matrix Completion

  2025cites this paper
• Generalization Bounds for Semi-supervised Matrix Completion with Distributional Side Information

  2025cites this paper
• Conv4Rec: A 1-by-1 Convolutional Autoencoder for User Profiling Through Joint Analysis of Implicit and Explicit Feedback

  2025cites this paper
• Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness

  2024cites this paper
• Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion

  2024cites this paper
• Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization

  2024cites this paper
• Regionalization-Based Collaborative Filtering: Harnessing Geographical Information in Recommenders

  2024cites this paper
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution

  2023cites this paper
• Bi-directional matrix completion for highly incomplete multi-label learning via co-embedding predictive side information

  2023influential citation
• Uncertainty-Adjusted Recommendation via Matrix Factorization With Weighted Losses

  2023influential citation
• Transductive Matrix Completion with Calibration for Multi-Task Learning

  2023cites this paper
• Tensor Robust Principal Component Analysis With Side Information: Models and Applications

  2023cites this paper
• Matrix Approximation With Side Information: When Column Sampling Is Enough

  2022cites this paper
• Exact Decomposition of Joint Low Rankness and Local Smoothness Plus Sparse Matrices

  2022cites this paper
• Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm

  2022cites this paper
• Generalization Bounds for Inductive Matrix Completion in Low-noise Settings

  2022influential citation
• Supplementary Material for “Fine-grained Generalisation Analysis of Inductive Matrix Completion”

  2022influential citation
• Robust clustering with sparse corruption via ℓ2, 1, ℓ1 norm constraint and Laplacian regularization

  2021cites this paper
• Tensor Estimation with Nearly Linear Samples Given Weak Side Information

  2021cites this paper
• University of Birmingham Fine-grained generalization analysis of inductive matrix completion

  2021cites this paper
• Nonparametric Matrix Estimation with One-Sided Covariates

  2021cites this paper
• Beyond missing: weakly-supervised multi-label learning with incomplete and noisy labels

  2020cites this paper
• Tensor Completion with Nearly Linear Samples Given Weak Side Information

  2020cites this paper
• Weakly-supervised multi-label learning with noisy features and incomplete labels

  2020cites this paper
• Adaptive Graph Regularized Low–Rank Matrix Factorization With Noise and Outliers for Clustering

  2020cites this paper
• Orthogonal Inductive Matrix Completion

  2020influential citation
• Noisy Dual Principal Component Pursuit

  2019cites this paper
• HERA

  2019cites this paper
• Robust Multi-Label Learning with Corrupted Features and Incomplete Labels

  2019cites this paper
• Exact gaussian process regression with distributed computations

  2019cites this paper
• Mutual-manifold regularized robust fast latent LRR for subspace recovery and learning

  2019cites this paper
• Scalable Probabilistic Matrix Factorization with Graph-Based Priors

  2019cites this paper
• Online Matrix Completion with Side Information

  2019cites this paper
• Collective Matrix Completion

  2018cites this paper
• Efficient Active Manifold Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization

  year unknowncites this paper