Spectral regularization algorithms for learning large incomplete matrices

zbMATH Open1242.68237MaRDI QIDQ2896145FDOQ2896145

Authors: Rahul Mazumder, Robert Tibshirani, Trevor Hastie 

Publication date: 13 July 2012

Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL: http://www.jmlr.org/papers/v11/mazumder10a.html

Recommendations

• Matrix completion and low-rank SVD via fast alternating least squares
• Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
• A Singular Value Thresholding Algorithm for Matrix Completion
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Exact matrix completion via convex optimization

zbMATH Keywords

nuclear normcollaborative filteringspectral regularizationlarge scale convex optimizationNetflix prize

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Estimation in multivariate analysis (62H12) Matrix completion problems (15A83)

Cited In (only showing first 100 items - show all)

• Adaptive multinomial matrix completion
• Exact minimum rank approximation via Schatten \(p\)-norm minimization
• A novel robust principal component analysis method for image and video processing.
• Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
• Robust synthetic control
• 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
• Title not available (Why is that?)
• Matrix Completion under Low-Rank Missing Mechanism
• Factor analysis parameter estimation from incomplete data
• Nonparametric operator-regularized covariance function estimation for functional data
• Flexible low-rank statistical modeling with missing data and side information
• A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
• Robust bilinear factorization with missing and grossly corrupted observations
• Inference in adaptive regression via the Kac-Rice formula
• Matrix estimation by universal singular value thresholding
• Distributed matrix completion and robust factorization
• Decomposition of Variation of Mixed Variables by a Latent Mixed Gaussian Copula Model
• Matrix completion with covariate information
• The geometry of least squares in the 21st century
• Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
• Simple nuclear norm based algorithms for imputing missing data and forecasting in time series
• Matrix completion under interval uncertainty
• A note on the multiplicative gamma process
• Adaptive shrinkage of singular values
• Convex biclustering
• Matrix completion via max-norm constrained optimization
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Multi-target prediction: a unifying view on problems and methods
• Riemannian gradient descent methods for graph-regularized matrix completion
• Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
• Embedding Learning
• Regularised PCA to denoise and visualise data
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• Perturbation analysis of low-rank matrix stable recovery
• Imputation and low-rank estimation with missing not at random data
• Title not available (Why is that?)
• Matrix completion discriminant analysis
• A principal component method to impute missing values for mixed data
• Proximal distance algorithms: theory and practice
• softImpute
• Matrix completion and low-rank SVD via fast alternating least squares
• A graphical approach to the analysis of matrix completion
• Title not available (Why is that?)
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
• Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
• An extended Frank-Wolfe method with ``in-face directions, and its application to low-rank matrix completion
• Orthogonal rank-one matrix pursuit for low rank matrix completion
• Sparsity constrained estimation in image processing and computer vision
• Recovery of low-rank matrices based on the rank null space properties
• Random perturbation of low rank matrices: improving classical bounds
• Randomized LU decomposition
• Proximal Markov chain Monte Carlo algorithms
• An alternating minimization method for matrix completion problems
• Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
• Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification
• Credit constraints and GDP growth: evidence from a natural experiment
• Main effects and interactions in mixed and incomplete data frames
• Convex low rank approximation
• k-POD: A Method for k-Means Clustering of Missing Data
• Block tensor train decomposition for missing data estimation
• Latent variable selection in structural equation models
• Decomposable norm minimization with proximal-gradient homotopy algorithm
• Large-scale multivariate sparse regression with applications to UK Biobank
• Matrix completion by singular value thresholding: sharp bounds
• Statistical significance of the Netflix challenge
• DataWig: missing value imputation for tables
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Title not available (Why is that?)
• Parameters of stochastic models for electroencephalogram data as biomarkers for child's neurodevelopment after cerebral malaria
• Matrix recovery from nonconvex regularized least absolute deviations
• Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD
• Two directional Laplacian pyramids with application to data imputation
• Matrix Completion Methods for Causal Panel Data Models
• Imputed mean tensor regression for near-sited spatial temporal data
• Variable selection for high‐dimensional generalized linear model with block‐missing data
• Cardinality-constrained structured data-fitting problems
• Low-rank traffic matrix completion with marginal information
• Hierarchical nuclear norm penalization for multi-view data integration
• Matrix completion under complex survey sampling
• Bayesian matrix completion approach to causal inference with panel data
• Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
• Collective matrix completion
• An analysis of noise folding for low-rank matrix recovery
• A two-phase rank-based algorithm for low-rank matrix completion
• Regularization methods for low-rank factorization of matrices with missing data
• Bidimensional linked matrix factorization for pan-omics pan-cancer analysis
• Sparse principal component analysis with missing observations
• Distributed estimation in heterogeneous reduced rank regression: with application to order determination in sufficient dimension reduction
• Robust reduced rank regression in a distributed setting
• Exponential-Family Embedding With Application to Cell Developmental Trajectories for Single-Cell RNA-Seq Data
• Imputed quantile tensor regression for near-sited spatial-temporal data
• Matrix completion from a computational statistics perspective
• Exterior-point optimization for sparse and low-rank optimization
• Tensor completion with noisy side information
• PC-GAIN: pseudo-label conditional generative adversarial imputation networks for incomplete data
• Convergence of projected Landweber iteration for matrix rank minimization
• Matrix completion with the trace norm: learning, bounding, and transducing
• Estimating longitudinal change in latent variable means: a comparison of non-negative matrix factorization and other item non-response methods
• GNMR: a provable one-line algorithm for low rank matrix recovery
• Large factor model estimation by nuclear norm plus \(\ell_1\) norm penalization

Uses Software

• PROPACK
• SLEP
• impute

This page was built for publication: Spectral regularization algorithms for learning large incomplete matrices

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