Matrix completion and low-rank SVD via fast alternating least squares
From MaRDI portal
(Redirected from Publication:97013)
Abstract: The matrix-completion problem has attracted a lot of attention, largely as a result of the celebrated Netflix competition. Two popular approaches for solving the problem are nuclear-norm-regularized matrix approximation (Candes and Tao, 2009, Mazumder, Hastie and Tibshirani, 2010), and maximum-margin matrix factorization (Srebro, Rennie and Jaakkola, 2005). These two procedures are in some cases solving equivalent problems, but with quite different algorithms. In this article we bring the two approaches together, leading to an efficient algorithm for large matrix factorization and completion that outperforms both of these. We develop a software package "softImpute" in R for implementing our approaches, and a distributed version for very large matrices using the "Spark" cluster programming environment.
Recommendations
- Spectral regularization algorithms for learning large incomplete matrices
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- A Singular Value Thresholding Algorithm for Matrix Completion
- Low-rank matrix completion using alternating minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
Cited in
(89)- Ridge Regularization: An Essential Concept in Data Science
- Augmented doubly robust post-imputation inference for proteomic data
- Variable selection for high-dimensional incomplete data
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- A matrix completion algorithm using randomized SVD
- Inference for large dimensional factor models under general missing data patterns
- Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems
- A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
- Modeling Longitudinal Data Using Matrix Completion
- Matrix Completion Methods for Causal Panel Data Models
- Co-Factor Analysis of Citation Networks
- MFAI: A Scalable Bayesian Matrix Factorization Approach to Leveraging Auxiliary Information
- Outlier detection in networks with missing links
- A very fast algorithm for matrix factorization
- Flexible low-rank statistical modeling with missing data and side information
- Imputed mean tensor regression for near-sited spatial temporal data
- Spectral regularization algorithms for learning large incomplete matrices
- Modeling extreme events: univariate and multivariate data-driven approaches. EVA (2023) Conference Data Challenge: team genEVA
- Rank regularized estimation of approximate factor models
- Smooth over-parameterized solvers for non-smooth structured optimization
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Low-rank traffic matrix completion with marginal information
- Missing value imputation in multivariate time series with end-to-end generative adversarial networks
- Distributed matrix completion and robust factorization
- Statistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information
- On a Problem of Weighted Low-Rank Approximation of Matrices
- Low-rank matrix completion using alternating minimization
- Matrix completion under interval uncertainty
- Accurate low-rank approximations via a few iterations of alternating least squares
- A nonlinear matrix decomposition for mining the zeros of sparse data
- Sparse principal component analysis with missing observations
- Low-rank factorization for rank minimization with nonconvex regularizers
- Column \(\ell_{2,0}\)-norm regularized factorization model of low-rank matrix recovery and its computation
- Imputed quantile tensor regression for near-sited spatial-temporal data
- Matrix completion from a computational statistics perspective
- Riemannian gradient descent methods for graph-regularized matrix completion
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Provable accelerated gradient method for nonconvex low rank optimization
- On the consistency of supervised learning with missing values
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Inductive matrix completion with feature selection
- Online Policy Learning and Inference by Matrix Completion
- Large factor model estimation by nuclear norm plus _1 norm penalization
- Asymptotic dynamics of alternating minimization for bilinear regression
- softImpute
- rsparse
- Imputation and low-rank estimation with missing not at random data
- Matrix completion with noisy entries and outliers
- Computationally efficient likelihood-based estimation and variable selection for the Cox model with incomplete covariates
- scientific article; zbMATH DE number 7626713 (Why is no real title available?)
- Matrix completion discriminant analysis
- Inference for low-rank models
- Active matrix factorization for surveys
- A data-adaptive dimension reduction for functional data via penalized low-rank approximation
- Convergence analysis of the rank-restricted soft SVD algorithm
- Collaborative Filtering With Awareness of Social Networks
- Imputation of Mixed Data With Multilevel Singular Value Decomposition
- \textsc{OCam}: out-of-core coordinate descent algorithm for matrix completion
- scientific article; zbMATH DE number 6142618 (Why is no real title available?)
- Greedy low-rank algorithm for spatial connectome regression
- Reexamining low rank matrix factorization for trace norm regularization
- Matrix completion methods for the total electron content video reconstruction
- Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization
- scientific article; zbMATH DE number 7370637 (Why is no real title available?)
- Core-elements for large-scale least squares estimation
- Approximate matrix completion based on cavity method
- scientific article; zbMATH DE number 6961486 (Why is no real title available?)
- The power of subsampling in submodular maximization
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- scientific article; zbMATH DE number 7306912 (Why is no real title available?)
- scientific article; zbMATH DE number 7626764 (Why is no real title available?)
- Adaptive thresholding for iterative matrix completion with heterogeneous missing probability: H-AdaptiveImpute
- Intelligent Initialization and Adaptive Thresholding for Iterative Matrix Completion: Some Statistical and Algorithmic Theory forAdaptive-Impute
- Smooth neighborhood recommender systems
- Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model
- Majorized proximal alternating imputation for regularized rank constrained matrix completion
- Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
- ResQPASS: an algorithm for bounded variable linear least squares with asymptotic Krylov convergence
- Main effects and interactions in mixed and incomplete data frames
- Duality theory on generalized singular values and its applications
- Empirical Bayes matrix completion
- Scenario-based quantile connectedness of the U.S. interbank liquidity risk network
- On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
- Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation
- Automatic Transformation and Integration to Improve Visualization and Discovery of Latent Effects in Imaging Data
- A fast regression via SVD and marginalization
- Nonparametric Imputation by Data Depth
This page was built for publication: Matrix completion and low-rank SVD via fast alternating least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q97013)
