Optimal prediction in the linearly transformed spiked model (Q2176630): Difference between revisions
From MaRDI portal
Latest revision as of 13:57, 22 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal prediction in the linearly transformed spiked model |
scientific article |
Statements
Optimal prediction in the linearly transformed spiked model (English)
0 references
5 May 2020
0 references
The authors consider the linearly transformed spiked model \(Y_i=A_iX_i+\epsilon_i\), \(i=1,\dots,n\). Here, the observations \(Y_i\) are noisy linear transforms of unobserved signals of interest \(X_i\). The observed transform matrices \(A_i\) reduce the dimension of the signal \(X_i\in \mathbb{R}^p\) to a possibly observation-dependent dimension \(q_i\leq p,\) thus \(A_i\in \mathbb{R}^{q_i\times p}\). The unobserved signals (or regression coefficients) \(X_i\) are vectors lying on an unknown low-dimensional space. Given only \(Y_i\) and \(A_i\), to predict or recover \(X_i\) values, the authors develop optimal methods by ``borrowing strength'' across the different samples. They use linear empirical Bayes methods scale to large datasets and weak moment assumptions. \newline The model has wide-ranging applications in signal processing, deconvolution, cryo-electron microscopy, and missing data with noise. For missing data, the authors demonstrate in simulations that the proposed methods are more robust to noise and to unequal sampling than well-known matrix completion methods.
0 references
principal component analysis
0 references
random matrix theory
0 references
shrinkage
0 references
high dimensional
0 references
spiked model
0 references
missing data
0 references
matrix completion
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references