Compressive PCA for Low-Rank Matrices on Graphs

Abstract : We introduce a novel framework for an approximate recovery of data matrices which are low-rank on graphs, from sampled measurements. The rows and columns of such matrices belong to the span of the first few eigenvectors of the graphs constructed between their rows and columns. We leverage this property to recover the non-linear low-rank structures efficiently from sampled data measurements, with a low cost (linear in n). First, a restricted Isometry Property (RIP) condition is introduced for efficient uniform sampling of the rows and columns of such matrices based on the cumulative coherence of graph eigenvectors. Secondly, a state-of-the-art fast low-rank recovery method is suggested for the sampled data. Finally, several efficient, parallel and parameter-free decoders are presented along with their theoretical analysis for decoding the low-rank and cluster indicators for the full data matrix. Thus, we overcome the computational limitations of the standard linear low-rank recovery methods for big datasets. Our method can also be seen as a major step towards efficient recovery of non-linear low-rank structures. For a matrix of size n x p, on a single core machine, our method gains a speed up of p^2 /k over Robust Principal Component Analysis (RPCA), where k << p is the subspace dimension. Numerically, we can recover a low-rank matrix of size 10304 x 1000, 100 times faster than Robust PCA.
Type de document :
Article dans une revue
IEEE transactions on Signal and Information Processing over Networks, IEEE, 2016, pp.17. <10.1109/TSIPN.2016.2631890>
Liste complète des métadonnées

https://hal.inria.fr/hal-01277625
Contributeur : Gilles Puy <>
Soumis le : mercredi 4 janvier 2017 - 00:30:51
Dernière modification le : samedi 18 février 2017 - 01:10:26
Document(s) archivé(s) le : mercredi 5 avril 2017 - 13:16:53

Identifiants

Citation

Nauman Shahid, Nathanael Perraudin, Gilles Puy, Pierre Vandergheynst. Compressive PCA for Low-Rank Matrices on Graphs. IEEE transactions on Signal and Information Processing over Networks, IEEE, 2016, pp.17. <10.1109/TSIPN.2016.2631890>. <hal-01277625v2>

Partager

Métriques

Consultations de
la notice

107

Téléchargements du document

25