Estimation of Simultaneously Sparse and Low Rank Matrices
The paper introduces a penalized matrix estimation procedure aiming at solutions which are sparse and low-rank at the same time. Such structures arise in the context of social networks or protein interactions where underlying graphs have adjacency matrices which are block-diagonal in the appropriate basis. We introduce a convex mixed penalty which involves $\ell_1$-norm and trace norm simultaneously. We obtain an oracle inequality which indicates how the two effects interact according to the nature of the target matrix. We bound generalization error in the link prediction problem. We also develop proximal descent strategies to solve the optimization problem efficiently and evaluate performance on synthetic and real data sets.
Code (1)
Tasks
Link PredictionSimilar Papers 제목 키워드 기반
Sparse and Low-Rank Covariance Matrices Estimation
This paper aims at achieving a simultaneously sparse and low-rank estimator from the semidefinite population covariance matrices. We first benefit from a convex optimization which develops $l_1$-norm penalty to encourage…
Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
We propose a new algorithm for the problem of recovering data that adheres to multiple, heterogeneous low-dimensional structures from linear observations. Focusing on data matrices that are simultaneously row-sparse and …
Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing
In a plethora of applications dealing with inverse problems, e.g. in image processing, social networks, compressive sensing, biological data processing etc., the signal of interest is known to be structured in several wa…
Compressive SensingGroup-sparse Embeddings in Collective Matrix Factorization
CMF is a technique for simultaneously learning low-rank representations based on a collection of matrices with shared entities. A typical example is the joint modeling of user-item, item-property, and user-feature matric…
MULTI-VIEW LEARNINGRecommendation SystemsRecovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
We study the problem of recovery of matrices that are simultaneously low rank and row and/or column sparse. Such matrices appear in recent applications in cognitive neuroscience, imaging, computer vision, macroeconomics,…
Multi-Task Learning