Publication

Compressive PCA for Low-Rank Matrices on Graphs

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Compressive PCA for Low-Rank Matrices on Graphs

Graph Chatbot

Chat with Graph Search

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

DARE-GRAM : Unsupervised Domain Adaptation Regression by Aligning Inverse Gram Matrices

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Optimal denoising of rotationally invariant rectangular matrices

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

Low-rank and sparse subspace modeling of speech for DNN based acoustic modeling

A new kind of atlas of zeolite building blocks

Applying dimension reduction to EEG data by Principal Component Analysis reduces the quality of its subsequent Independent Component decomposition

Scalable Low-rank Matrix and Tensor Decomposition on Graphs

Low-Rank Matrices on Graphs: Generalized Recovery & Applications