softImpute

swMATH12263CRANsoftImputeMaRDI QIDQ24194FDOQ24194

Matrix Completion via Iterative Soft-Thresholded SVD

Trevor Hastie

Last update: 9 May 2021

Copyright license: GNU General Public License, version 2.0

Software version identifier: 1.4-1

Official website: http://cran.r-project.org/web/packages/softImpute/index.html

Source code repository: https://github.com/cran/softImpute

Described by source

• Spectral regularization algorithms for learning large incomplete matrices
• Matrix completion and low-rank SVD via fast alternating least squares

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

• Exact minimum rank approximation via Schatten \(p\)-norm minimization
• Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD
• A novel robust principal component analysis method for image and video processing.
• Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
• Matrix Completion under Low-Rank Missing Mechanism
• Nonparametric operator-regularized covariance function estimation for functional data
• A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
• Robust bilinear factorization with missing and grossly corrupted observations
• RASL
• Inference in adaptive regression via the Kac-Rice formula
• The geometry of least squares in the 21st century
• Low-rank traffic matrix completion with marginal information
• Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
• Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
• Matrix completion under interval uncertainty
• A note on the multiplicative gamma process
• Adaptive shrinkage of singular values
• Sparse principal component analysis with missing observations
• Convex biclustering
• 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
• A general framework for fast stagewise algorithms
• Low-rank matrix recovery via regularized nuclear norm minimization
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• Matrix completion with noisy entries and outliers
• Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity
• Perturbation analysis of low-rank matrix stable recovery
• Imputation and low-rank estimation with missing not at random data
• Active matrix factorization for surveys
• Doubly robust treatment effect estimation with missing attributes
• Matrix completion discriminant analysis
• A principal component method to impute missing values for mixed data
• A graphical approach to the analysis of matrix completion
• From predictive methods to missing data imputation: an optimization approach
• Lasso meets horseshoe: a survey
• A Probit Tensor Factorization Model For Relational Learning
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
• Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
• CoCoLasso
• Genten
• STransE
• 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
• Random perturbation of low rank matrices: improving classical bounds
• Randomized LU decomposition
• Optimal sparse linear prediction for block-missing multi-modality data without imputation
• augsynth
• MisGAN
• gcimpute
• T-product factorization based method for matrix and tensor completion problems
• Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
• Two-level monotonic multistage recommender systems
• Heteroskedastic PCA: algorithm, optimality, and applications
• Credit constraints and GDP growth: evidence from a natural experiment
• A Comparative Study of Pairwise Learning Methods Based on Kernel Ridge Regression
• Convex low rank approximation
• Latent variable selection in structural equation models
• Decomposable norm minimization with proximal-gradient homotopy algorithm
• 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
• Adaptive multinomial matrix completion
• Robust synthetic control
• 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
• Flexible low-rank statistical modeling with missing data and side information
• Matrix estimation by universal singular value thresholding
• Matrix completion with covariate information
• Amelia
• FactoMineR
• blasso
• VIM
• missMDA
• NMF
• Monomvn
• CoSaMP
• MICE
• JIVE
• LMaFit
• CausalImpact
• Eigentaste
• Jellyfish
• Optspace
• homals
• impute
• GenRTR
• PLS_Toolbox
• InspectChangepoint
• simstudy
• boral
• dagitty
• CoXpress
• denoiseR
• missForest
• rARPACK
• MultiwayRegression
• NESToolbox

This page was built for software: softImpute