Inductive matrix completion with feature selection

DOI10.1134/S0965542521050079zbMath1476.62105OpenAlexW3184998253MaRDI QIDQ2038483

Yanyan Li

Publication date: 7 July 2021

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542521050079

zbMATH Keywords

group sparsitysample complexityinductive matrix completion

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Estimation in multivariate analysis (62H12) Ridge regression; shrinkage estimators (Lasso) (62J07) Matrix equations and identities (15A24) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

New applications of matrix methods

Uses Software

• LIBSVM
• glasso

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Convex multi-task feature learning
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Exact matrix completion via convex optimization
• 10.1162/153244303321897690
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Low-rank matrix completion using alternating minimization