Sciweavers

Share
TIT
2016

Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics

4 years 3 months ago
Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
Principal component analysis (PCA) aims at estimating the direction of maximal variability of a high-dimensional dataset. A natural question is: does this task become easier, and estimation more accurate, when we exploit additional knowledge on the principal vector? We study the case in which the principal vector is known to lie in the positive orthant. Similar constraints arise in a number of applications, ranging from analysis of gene expression data to spike sorting in neural signal processing. In the unconstrained case, the estimation performances of PCA has been precisely characterized using random matrix theory, under a statistical model known as the ‘spiked model.’ It is known that the estimation error undergoes a phase transition as the signal-to-noise ratio crosses a certain threshold. Unfortunately, tools from random matrix theory have no bearing on the constrained problem. Despite this challenge, we develop an analogous characterization in the constrained case, within a...
Andrea Montanari, Emile Richard
Added 11 Apr 2016
Updated 11 Apr 2016
Type Journal
Year 2016
Where TIT
Authors Andrea Montanari, Emile Richard
Comments (0)
books