Collaborative Research: Random Matrices and Algorithms in High Dimension

合作研究：高维随机矩阵和算法

• 批准号: 2306439
• 负责人: Xiucai Ding
• 金额: $ 9.28万
• 依托单位: University of California-Davis
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-07-01 至 2026-06-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2306439&HistoricalAwards=false
• 关键词: Collaborative; Research; Random; Matrices; Algorithms

Numerical algorithms that can process huge amounts of data are increasingly important, notably for those algorithms used every day within artificial intelligence (AI) software. Examples include voice assistants, facial recognition for cellphones, and machine-learning-based financial fraud detection. But many algorithms are applied only heuristically and remain poorly understood, meaning that theoretical guarantees are missing. In fact, recent AI applications indicate that the direct application of these algorithms, without proper validation, may generate artificial, misleading information. The broad aim of this proposal is to deepen our understanding of classes of statistically-relevant random matrix models that are used to model, analyze and interpret large data sets and to analyze new and classical algorithms as they act on these models. It is expected that this will produce new insights and statistical tools, paired with theoretical guarantees. This award will also train junior researchers and help continue to build the community of researchers working in this field.The proposed problems fit into three main projects. The first concerns the analysis of random matrix models that extend the classical setting of sample covariance matrices. Then by connecting random matrix models and orthogonal polynomials via Riemann--Hilbert problems, the PIs will obtain new estimates and new conclusions about orthogonal polynomials for natural measures generated by these random matrices. Armed with the theoretical results, the second project concerns the direct application of the estimates from the first project, and further refinement of previous analyses, to understand the average-case behavior of numerical algorithms. The focus here is on algorithms from numerical linear algebra. In the third project, the investigators will use the new random matrix estimates, the new results in the theory of orthogonal polynomials and its associated Riemann--Hilbert theory, for both classical and new random matrix ensembles, to generate new algorithms, ultimately leading to new viable statistical estimators.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

能够处理大量数据的数值算法变得越来越重要，特别是对于人工智能 (AI) 软件中日常使用的算法。 例如语音助手、手机面部识别以及基于机器学习的金融欺诈检测。但许多算法仅被启发式地应用，并且人们仍然知之甚少，这意味着缺乏理论保证。事实上，最近的人工智能应用表明，如果没有适当的验证，直接应用这些算法可能会产生虚假的误导性信息。 该提案的广泛目标是加深我们对统计相关随机矩阵模型类别的理解，这些模型用于建模、分析和解释大型数据集，并分析作用于这些模型的新算法和经典算法。 预计这将产生新的见解和统计工具，并辅以理论保证。 该奖项还将培训初级研究人员，并帮助继续建立该领域研究人员的社区。所提出的问题分为三个主要项目。 第一个涉及扩展样本协方差矩阵的经典设置的随机矩阵模型的分析。然后，通过黎曼-希尔伯特问题连接随机矩阵模型和正交多项式，PI 将获得关于这些随机矩阵生成的自然测度的正交多项式的新估计和新结论。 有了理论结果，第二个项目涉及直接应用第一个项目的估计，并进一步细化以前的分析，以了解数值算法的平均情况行为。 这里的重点是数值线性代数的算法。 在第三个项目中，研究人员将使用新的随机矩阵估计、正交多项式理论及其相关的黎曼-希尔伯特理论的新结果，对于经典和新的随机矩阵系综，生成新的算法，最终导致新的可行的统计估计器。该奖项反映了 NSF 的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。