返回
SPARSE CCA: ADAPTIVE ESTIMATION AND COMPUTATIONAL BARRIERS
DOI:10.1214/16-AOS1519.png)
摘要
En 中文
Canonical correlation analysis is a classical technique for exploring the relationship between two sets of variables. It has important applications in analyzing high dimensional datasets originated from genomics, imaging and other fields. This paper considers adaptive minimax and computationally tractable estimation of leading sparse canonical coefficient vectors in high dimensions. Under a Gaussian canonical pair model, we first establish separate minimax estimation rates for canonical coefficient vectors of each set of random variables under no structural assumption on marginal covariance matrices. Second, we propose a computationally feasible estimator to attain the optimal rates adaptively under an additional sample size condition. Finally, we show that a sample size condition of this kind is needed for any randomized polynomial-time estimator to be consistent, assuming hardness of certain instances of the planted clique detection problem. As a byproduct, we obtain the first computational lower bounds for sparse PCA under the Gaussian single spiked covariance model.
Keyword:
Convex programming
group-Lasso
minimax rates
computational complexity
planted clique
sparse CCA (SCCA)
sparse PCA (SPCA)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
Genetic association study of the GNB3 C825T, the ACE I/D and the eNOS G894T polymorphisms and the risk to develop erectile dysfunction in a German ED population
Andrologia
IF0
A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers
STATISTICAL SCIENCE
IF3.4
STATISTICAL AND COMPUTATIONAL TRADE-OFFS IN ESTIMATION OF SPARSE PRINCIPAL COMPONENTS
ANNALS OF STATISTICS
IF3.7

