Matrix estimation under rank constraints for complete and incomplete noisy data

完整和不完整噪声数据的秩约束下的矩阵估计

• 批准号: 1212325
• 负责人: Florentina Bunea
• 金额: $ 22.03万
• 依托单位: Cornell University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2011
• 资助国家: 美国
• 起止时间: 2011-06-30 至 2014-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1212325&HistoricalAwards=false
• 关键词: Matrix; estimation; under; rank; constraints

The central goals of this proposal are:(a) to provide methods for the estimation of matrices of unknown rank from both completely and incompletely observed noisy matrices, using rank regularized risk minimization and (b) to establish novel oracle type risk bounds for the matrix estimates and the rank estimates, under minimal assumptions. The difficulty of the problem of recovering the underlying target matrix from an observed noisy matrix is that the number of independent parameters is large relative to the number of observations. Special attention is given to multivariate response regression models. There is an interesting resemblance between matrix estimation under low rank assumptions and estimation in general regression models under sparsity assumptions, but matrix models pose different mathematical and computational challenges.High dimensional data arranged in matrix format are increasingly common in many scientific disciplines such as genetics, medical imaging, engineering, psychology and neuroscience. The matrices containing observed data in these areas tend to have high rank due to the presence of noise, but the signal matrix underlying the data may have significantly lower rank. Ignoring this in any inferential procedure may lead to poor recovery of the target, with severe repercussions on the interpretation of the results. Instances of targets that must be recovered with the highest possible precision include: faces against background, ensembles of genes that are associated with a disease, brain structures associated with cognitive processes, to name just a few example. Some of the challenges associated with the analysis of such data can be met via the methodological and theoretical study of the problem of matrix estimation under rank constraints. A second problem, which is substantially more difficult, is to perform the same task when only partially observed noisy matrices are available. Systematic investigation of these two problems is the focus of this proposal. The usefulness of these techniques will be immediately disseminated to the scientific community by applying them to data obtained from a study of the effects of HIV on brain structure and functions. Free software that implements the developed methodology will be made available on the web in a readily implementable form.

本提案的中心目标是：(a)提供从完全观察和不完全观察的噪声矩阵中估计未知秩矩阵的方法，使用秩正则化风险最小化；(b)在最小假设下为矩阵估计和秩估计建立新的oracle类型风险界限。从观测到的噪声矩阵中恢复潜在目标矩阵问题的难点在于相对于观测值而言，独立参数的数量很大。特别注意多变量响应回归模型。在低秩假设下的矩阵估计与在稀疏性假设下的一般回归模型的估计之间存在有趣的相似之处，但矩阵模型提出了不同的数学和计算挑战。以矩阵形式排列的高维数据在遗传学、医学影像学、工程学、心理学和神经科学等许多科学学科中越来越普遍。由于噪声的存在，包含这些区域观测数据的矩阵往往具有高秩，但数据底层的信号矩阵可能具有明显较低的秩。在任何推理程序中忽略这一点可能导致目标恢复不良，对结果的解释产生严重影响。必须尽可能精确地恢复目标的实例包括：背景下的面孔，与疾病相关的基因集合，与认知过程相关的大脑结构，仅举几例。与这些数据分析相关的一些挑战可以通过秩约束下矩阵估计问题的方法和理论研究来解决。第二个困难得多的问题是，在只有部分观察到的噪声矩阵可用的情况下执行相同的任务。对这两个问题的系统研究是本文的重点。通过将这些技术应用于从艾滋病毒对大脑结构和功能的影响的研究中获得的数据，这些技术的有用性将立即传播给科学界。实现所开发方法的自由软件将以易于实现的形式在网络上提供。