CAREER: Theoretical Foundations for Probabilistic Models with Dense Random Matrices
CAREER: Theoretical Foundations for Probabilistic Models with Dense Random Matrices
批准号:
1750362
负责人:
Galen Reeves
金额:
$48.98万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2018
资助国家:
美国
项目状态:
未结题
起止时间:
2018-03-01 至 2025-02-28
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Many real-world scientific and engineering applications require sophisticated processing of large and complex data sets. Examples include wireless communications, computational photography, and the training of multilayer networks for classification tasks. In some cases, performance is fundamentally limited by the amount of data. In other cases, the main limitation is the computational complexity of processing algorithms. A major challenge for researchers is to understand these fundamental limits. This project explores these limits by studying probabilistic models that describe the statistical relationship between the data and the unknown quantities of interest (e.g., transmitted message or correct label). The research involves combining ideas from information theory and statistical physics to compute fundamental limits and using these results to design efficient methods with improved performance. The interdisciplinary nature of the research is mirrored in the education activities of this project, which focuses on making connections between engineering, statistical physics, and the information sciences, as well as improving undergraduate education through exploratory data analysis.The key conceptual idea behind this research is that statistical dependencies induced through multiplication by dense random matrices can be understood through connections with simpler models involving additive Gaussian noise. In a recent breakthrough, the investigator showed how ideas from information theory could provide rigorous proofs for behaviors that had been conjectured using the heuristic replica method from statistical physics. Building upon this insight, the research is organized around three thrusts: i) Developing new theoretical methods to provide rigorous and interpretable characterization of fundamental limits; ii) Designing new algorithms for inference, learning, and compression; and iii) Analyzing bi-linear and multi-layer inference problems with applications to deep learning.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.
期刊论文(11)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
DOI:
10.1109/allerton.2019.8919733
发表时间:
2019-09
期刊:
2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
影响因子:
--
作者:
[Vaishakhi Mayya;G. Reeves]
通讯作者:
Vaishakhi Mayya;G. Reeves
DOI:
10.1109/isit.2018.8437761
发表时间:
2018
期刊:
2018 IEEE International Symposium on Information Theory (ISIT
影响因子:
--
作者:
[Kipnis, Alon, Reeves, Galen, Eldar, Yonina C.]
通讯作者:
Eldar, Yonina C.
DOI:
--
发表时间:
2021-06
期刊:
影响因子:
--
作者:
[Joshua K. Behne;G. Reeves]
通讯作者:
Joshua K. Behne;G. Reeves
DOI:
--
发表时间:
2021-02
期刊:
影响因子:
--
作者:
[Yixing Zhang;Xiuyuan Cheng;G. Reeves]
通讯作者:
Yixing Zhang;Xiuyuan Cheng;G. Reeves
DOI:
10.1109/isit.2019.8849594
发表时间:
2019-07
期刊:
2019 IEEE International Symposium on Information Theory (ISIT)
影响因子:
--
作者:
[G. Reeves;Vaishakhi Mayya;A. Volfovsky]
通讯作者:
G. Reeves;Vaishakhi Mayya;A. Volfovsky
共 9 条
海外基金