Fast optimization for mixture prior models
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Fast communication: Some empirical advances in matrix completion
Signal Processing
A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
Journal of Scientific Computing
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
SIAM Journal on Matrix Analysis and Applications
Limitations of matrix completion via trace norm minimization
ACM SIGKDD Explorations Newsletter
A linear solution to 1-dimensional subspace fitting under incomplete data
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part II
Robust principal component analysis?
Journal of the ACM (JACM)
International Journal of Sensor Networks
The minimum-rank gram matrix completion via modified fixed point continuation method
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Integrating low-rank and group-sparse structures for robust multi-task learning
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Estimation of missing RTTs in computer networks: Matrix completion vs compressed sensing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multilinear model estimation with L2-regularization
DAGM'11 Proceedings of the 33rd international conference on Pattern recognition
Trace norm regularization and application to tensor based feature extraction
ACCV'10 Proceedings of the 2010 international conference on Computer vision - Volume part II
Composite splitting algorithms for convex optimization
Computer Vision and Image Understanding
Transactional Database Transformation and Its Application in Prioritizing Human Disease Genes
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Theoretical Analysis of Bayesian Matrix Factorization
The Journal of Machine Learning Research
Analysis and Generalizations of the Linearized Bregman Method
SIAM Journal on Imaging Sciences
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
SIAM Journal on Optimization
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
SIAM Journal on Optimization
SIAM Journal on Imaging Sciences
Hessian Matrix vs. Gauss-Newton Hessian Matrix
SIAM Journal on Numerical Analysis
On vector and matrix median computation
Journal of Computational and Applied Mathematics
A modified parallel optimization system for updating large-size time-evolving flow matrix
Information Sciences: an International Journal
Exact matrix completion via convex optimization
Communications of the ACM
Structural analysis of network traffic matrix via relaxed principal component pursuit
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimization with Sparsity-Inducing Penalties
Foundations and Trends® in Machine Learning
Music retagging using label propagation and robust principal component analysis
Proceedings of the 21st international conference companion on World Wide Web
TILT: Transform Invariant Low-Rank Textures
International Journal of Computer Vision
Practical acceleration for computing the HITS ExpertRank vectors
Journal of Computational and Applied Mathematics
Accelerated singular value thresholding for matrix completion
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Optimal exact least squares rank minimization
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Low rank modeling of signed networks
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Semi-supervised learning with mixed knowledge information
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Estimating conversion rate in display advertising from past erformance data
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Dictionary Learning for Noisy and Incomplete Hyperspectral Images
SIAM Journal on Imaging Sciences
Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
SIAM Journal on Optimization
Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation
SIAM Journal on Imaging Sciences
Foreground detection by robust PCA solved via a linearized alternating direction method
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
A fast tri-factorization method for low-rank matrix recovery and completion
Pattern Recognition
Surveillance video coding via low-rank and sparse decomposition
Proceedings of the 20th ACM international conference on Multimedia
On sparse and low-rank matrix decomposition for singing voice separation
Proceedings of the 20th ACM international conference on Multimedia
Low-rank matrix decomposition in L1-norm by dynamic systems
Image and Vision Computing
Learning spectral embedding via iterative eigenvalue thresholding
Proceedings of the 21st ACM international conference on Information and knowledge management
On traffic matrix completion in the internet
Proceedings of the 2012 ACM conference on Internet measurement conference
Joint face alignment with non-parametric shape models
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Mirror descent for metric learning: a unified approach
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Background modeling from surveillance video using rank minimization
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Active subspace: Toward scalable low-rank learning
Neural Computation
Error Forgetting of Bregman Iteration
Journal of Scientific Computing
Accelerated Linearized Bregman Method
Journal of Scientific Computing
Advances in Computational Mathematics
Optimal operator space pursuit: a framework for video sequence data analysis
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part II
Nonlocal spectral prior model for low-level vision
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part III
Shadow-Free TILT for facade rectification
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV
Quasi-regular facade structure extraction
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV
Robust principal component analysis via capped norms
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Low-rank matrix completion using alternating minimization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Multisample aCGH Data Analysis via Total Variation and Spectral Regularization
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Robust image annotation via simultaneous feature and sample outlier pursuit
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Global analytic solution of fully-observed variational Bayesian matrix factorization
The Journal of Machine Learning Research
Iterative reweighted algorithms for matrix rank minimization
The Journal of Machine Learning Research
Co-segmentation of 3D shapes via multi-view spectral clustering
The Visual Computer: International Journal of Computer Graphics
Learning compact hashing codes for efficient tag completion and prediction
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
International Journal of Computer Vision
SMI 2013: Point cloud normal estimation via low-rank subspace clustering
Computers and Graphics
Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
Journal of Computational and Applied Mathematics
Software for weighted structured low-rank approximation
Journal of Computational and Applied Mathematics
Nonconvex relaxation approaches to robust matrix recovery
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Social trust prediction using rank-k matrix recovery
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Large-scale multilabel propagation based on efficient sparse graph construction
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Multiple feature kernel hashing for large-scale visual search
Pattern Recognition
Approximation of rank function and its application to the nearest low-rank correlation matrix
Journal of Global Optimization
Stationary-sparse causality network learning
The Journal of Machine Learning Research
Matrix Recipes for Hard Thresholding Methods
Journal of Mathematical Imaging and Vision
Homogeneous Penalizers and Constraints in Convex Image Restoration
Journal of Mathematical Imaging and Vision
Transform invariant text extraction
The Visual Computer: International Journal of Computer Graphics
Hi-index | 0.02 |
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem and arises in many important applications as in the task of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Off-the-shelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries. This paper develops a simple first-order and easy-to-implement algorithm that is extremely efficient at addressing problems in which the optimal solution has low rank. The algorithm is iterative, produces a sequence of matrices $\{\boldsymbol{X}^k,\boldsymbol{Y}^k\}$, and at each step mainly performs a soft-thresholding operation on the singular values of the matrix $\boldsymbol{Y}^k$. There are two remarkable features making this attractive for low-rank matrix completion problems. The first is that the soft-thresholding operation is applied to a sparse matrix; the second is that the rank of the iterates $\{\boldsymbol{X}^k\}$ is empirically nondecreasing. Both these facts allow the algorithm to make use of very minimal storage space and keep the computational cost of each iteration low. On the theoretical side, we provide a convergence analysis showing that the sequence of iterates converges. On the practical side, we provide numerical examples in which $1,000\times1,000$ matrices are recovered in less than a minute on a modest desktop computer. We also demonstrate that our approach is amenable to very large scale problems by recovering matrices of rank about 10 with nearly a billion unknowns from just about 0.4% of their sampled entries. Our methods are connected with the recent literature on linearized Bregman iterations for $\ell_1$ minimization, and we develop a framework in which one can understand these algorithms in terms of well-known Lagrange multiplier algorithms.