CIF: Medium: Collaborative Research: New Approaches to Robustness in High-Dimensions

CIF：中：协作研究：高维鲁棒性的新方法

• 批准号: 1302435
• 负责人: Sujay Sanghavi
• 金额: $ 69.54万
• 依托单位: University of Texas at Austin
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2013
• 资助国家: 美国
• 起止时间: 2013-07-01 至 2019-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1302435&HistoricalAwards=false
• 关键词: CIF; Medium; Collaborative; Research; New

Rapid development of large-scale data collection technology hasignited research into high-dimensional machine learning. Forinstance, the problem of designing recommender systems, such as thoseused by Amazon, Netflix and other on-line companies, involvesanalyzing large matrices that describe users' behavior in pastsituations. In sociology, researchers are interested in fittingnetworks to large-scale data sets, involving hundreds or thousands ofindividuals. In medical imaging, the goal is to reconstructcomplicated phenomena (e.g., brain images; videos of a beating heart)based on a minimal number of incomplete and possibly corruptedmeasurements. Motivated by such applications, the goal of thisresearch is to develop and analyze models and algorithms forextracting relevant structure from such high-dimensional data sets ina robust and scalable fashion.The research leverages tools from convex optimization, signalprocessing, and robust statistics. It consists of three main thrusts:(1) Model restrictiveness: Successful methods for high-dimensionaldata exploit low-dimensional structure; however, many real-worldproblems fall outside the scope of existing models. This proposalsignificantly extends the basic set-up by allowing for multiplestructures, leading to computationally efficient algorithms whileeliminating negative effects of model mismatch. (2) Non-ideal data:Missing data are prevalent in real-world problems, and can cause majorbreakdowns in standard algorithms for high-dimensional data. Thesecond thrust devises relaxations and greedy approaches for thesenon-convex problems. (3) Arbitrary Outliers: Gross errors can arisefor various reasons, including fault-prone sensors and manipulativeagents. The third thrust proposes efficient and randomized algorithmsto address arbitrary outliers.

大规模数据采集技术的快速发展引发了高维机器学习的研究。 例如，设计推荐系统（例如亚马逊、Netflix 和其他在线公司使用的推荐系统）的问题涉及分析描述用户在过去情况下的行为的大型矩阵。 在社会学中，研究人员对将网络拟合到涉及数百或数千个人的大规模数据集感兴趣。 在医学成像中，目标是基于最少数量的不完整和可能损坏的测量来重建复杂的现象（例如，大脑图像；心脏跳动的视频）。 受此类应用的推动，本研究的目标是开发和分析模型和算法，以稳健且可扩展的方式从此类高维数据集中提取相关结构。该研究利用凸优化、信号处理和稳健统计等工具。 它包括三个主旨：（1）模型限制性：高维数据的成功方法利用低维结构；然而，许多现实世界的问题超出了现有模型的范围。 该提案通过允许多种结构显着扩展了基本设置，从而产生计算高效的算法，同时消除了模型不匹配的负面影响。 (2)非理想数据：缺失数据在现实问题中普遍存在，并且可能导致高维数据的标准算法出现重大故障。第二个推力为这些非凸问题设计了松弛和贪婪方法。 (3) 任意异常值：由于各种原因可能会出现严重错误，包括容易出现故障的传感器和操纵机构。 第三个要点提出了有效且随机的算法来解决任意异常值。