CAREER: Optimal High-Dimensional Estimators Using Sum-of-Squares Proof Systems
CAREER: Optimal High-Dimensional Estimators Using Sum-of-Squares Proof Systems
批准号:
2143246
负责人:
Tselil Schramm
金额:
$64.95万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2022
资助国家:
美国
项目状态:
未结题
起止时间:
2022-02-01 至 2027-01-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Statistical estimation problems are ubiquitous in the modern world. A multitude of important machine-learning tasks fall under the umbrella of estimation, including regression, principal components analysis, and clustering. In the sciences more broadly, estimating parameters from data is crucial to the pursuit of knowledge: in Biology, estimating protein network structure; in Astronomy and Physics, estimating the spatial locations of stellar objects from diffraction patters; in Biochemistry, estimating the three-dimensional structure of a protein from spectroscopy and imaging data; and so on. In high-dimensional settings, where the quantities to be estimated describe large, complicated systems, the role of efficient computation is crucial. Despite the ubiquity of high-dimensional statistical estimation problems, understanding of their computational landscape remains primitive.The goal of this project is to develop and characterize optimal estimation algorithms through the lens of the sum-of-squares (SoS) algorithm and proof system. The sum-of-squares algorithm is a powerful class of semidefinite programming algorithms which are among the most powerful known algorithms (empirically and in a precise sense), while their relationship to the sum-of-squares proof system also allows for a systematic approach to algorithm design. The project is organized into three primary thrusts: (i) predicting the computational limits of statistical estimation with SoS, giving a unified theory for automatically predicting the computational limits of our most powerful algorithms; (ii) giving optimal algorithms for estimation via SoS for important problems such as clustering, graphical models, and block models; (iii) making sum-of-squares algorithms practical, replacing optimization over SoS programs with lightweight algorithms.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.
期刊论文(1)
专著(0)
科研奖励(0)
会议论文
Local and Global Expansion in Random Geometric Graphs
随机几何图中的局部和全局扩展
DOI:
10.1145/3564246.3585106
发表时间:
2023
期刊:
ACM
影响因子:
--
作者:
[Liu, Siqi, Mohanty, Sidhanth, Schramm, Tselil, Yang, Elizabeth]
通讯作者:
Yang, Elizabeth
海外基金