Robust bilinear factorization with missing and grossly corrupted observations

DOI10.1016/J.INS.2015.02.026OpenAlexW1977580401MaRDI QIDQ1749100

Xianqiang Yang

Publication date: 15 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.1062

zbMATH Keywords

robust principal component analysisrobust matrix completioncompressive principal component pursuitlow-rank matrix recovery and completion

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25)

Related Items (4)

Matrix completion with column outliers and sparse noise ⋮ Estimating dynamical dimensions from noisy observations ⋮ Robust sparse signal reconstructions against basis mismatch and their applications ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset

Uses Software

• LMaFit
• softImpute
• RTRMC
• RASL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Graph dual regularization non-negative matrix factorization for co-clustering
• Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
• An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
• Fixed point and Bregman iterative methods for matrix rank minimization
• Compressed sensing and matrix completion with constant proportion of corruptions
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Local minima and convergence in low-rank semidefinite programming
• Exact matrix completion via convex optimization
• Active Subspace: Toward Scalable Low-Rank Learning
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Decomposition Approach for Low-Rank Matrix Completion and Its Applications
• Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Compressive principal component pursuit
• Robust PCA via Outlier Pursuit
• Matrix Completion From a Few Entries
• Adaptive Hypergraph Learning and its Application in Image Classification
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

This page was built for publication: Robust bilinear factorization with missing and grossly corrupted observations