Robust alternating low-rank representation by joint L_p- and L₂,p-norm minimization

DOI10.1016/J.NEUNET.2017.08.001MaRDI QIDQ2179083zbMATH OpenOpenAlexWikidataFDO

Authors Zhao Zhang, Mingbo Zhao, Fanzhang Li, Li Zhang, Shuicheng Yan

Publication date 12 May 2020

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2017.08.001

zbMATH Keywords

adaptive local RPCAalternating low-rank representationforward-backward representationjoint \(L_p\)- and \(L_{2,p}\)-norm minimizationoutlier pursuit

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Relations among some low-rank subspace recovery models
• Robust subspace segmentation via nonconvex low rank representation
• Latent low-rank representation
• A subspace clustering algorithm based on simultaneously sparse and low-rank representation
• Similarity preserving low-rank representation for enhanced data representation and effective subspace learning

Cites work

• A cellular automaton model based on empirical observations of a driver's oscillation behavior reproducing the findings from Kerner's three-phase traffic theory
• A Singular Value Thresholding Algorithm for Matrix Completion
• A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
• Active subspace: toward scalable low-rank learning
• An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
• Exact matrix completion via convex optimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Inductive Robust Principal Component Analysis
• Joint Low-Rank and Sparse Principal Feature Coding for Enhanced Robust Representation and Visual Classification
• Pairwise Sparsity Preserving Embedding for Unsupervised Subspace Learning and Classification
• Robust PCA via Outlier Pursuit
• Robust principal component analysis?
• Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
• SparseNet: coordinate descent with nonconvex penalties
• Sparsity preserving projections with applications to face recognition
• Thresholding-based iterative selection procedures for model selection and shrinkage

Cited in

(4)

• Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
• Latent low-rank representation
• Relations among some low-rank subspace recovery models
• Total variation regularized multi-matrices weighted Schatten p-norm minimization for image denoising

This page was built for publication: Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179083)