Award Abstract # 2023505
Foundations of Data Science Institute

NSF Org: DMS
Division Of Mathematical Sciences
Recipient: REGENTS OF THE UNIVERSITY OF CALIFORNIA, THE
Initial Amendment Date: August 31, 2020
Latest Amendment Date: August 21, 2023
Award Number: 2023505
Award Instrument: Continuing Grant
Program Manager: Tracy Kimbrel
tkimbrel@nsf.gov
 (703)292-0000
DMS
 Division Of Mathematical Sciences
MPS
 Direct For Mathematical & Physical Scien
Start Date: September 1, 2020
End Date: August 31, 2025 (Estimated)
Total Intended Award Amount: $5,900,308.00
Total Awarded Amount to Date: $4,720,248.00
Funds Obligated to Date: FY 2020 = $1,180,062.00
FY 2021 = $1,180,062.00

FY 2022 = $1,380,062.00

FY 2023 = $980,062.00
History of Investigator:
  • Peter Bartlett (Principal Investigator)
    bartlett@stat.berkeley.edu
  • Josh Hug (Co-Principal Investigator)
  • Bin Yu (Co-Principal Investigator)
  • Michael Jordan (Co-Principal Investigator)
  • Martin Wainwright (Co-Principal Investigator)
Recipient Sponsored Research Office: University of California-Berkeley
1608 4TH ST STE 201
BERKELEY
CA  US  94710-1749
(510)643-3891
Sponsor Congressional District: 12
Primary Place of Performance: University of California-Berkeley
Sponsored Projects Office
Berkeley
CA  US  94710-1749
Primary Place of Performance
Congressional District:
12
Unique Entity Identifier (UEI): GS3YEVSS12N6
Parent UEI:
NSF Program(s): TRIPODS Transdisciplinary Rese
Primary Program Source: 01002021DB NSF RESEARCH & RELATED ACTIVIT
01002122DB NSF RESEARCH & RELATED ACTIVIT

01002324DB NSF RESEARCH & RELATED ACTIVIT

01002223DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 048Z, 075Z, 079Z
Program Element Code(s): 041Y00
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.049, 47.070

ABSTRACT

The Foundations of Data Science Institute (FODSI) brings together a large and diverse team of researchers and educators from UC Berkeley, MIT, Boston University, Bryn Mawr College, Harvard University, Howard University, and Northeastern University, with the aim of advancing the theoretical foundations for the field of data science. Data science has emerged as a central science for the 21st century, a widespread approach to science and technology that exploits the explosion in the availability of data to allow empirical investigations at unprecedented scale and scope. It now plays a central role in diverse domains across all of science, commerce and industry. The development of theoretical foundations for principled approaches to data science is particularly challenging because it requires progress across the full breadth of scientific issues that arise in the rich and complex processes by which data can be used to make decisions. These issues include the specification of the goals of data analysis, the development of models that aim to capture the way in which data may have arisen, the crafting of algorithms that are responsive to the models and goals, an understanding of the impact of misspecifications of these models and goals, an understanding of the effects of interactions, interventions and feedback mechanisms that affect the data and the interpretation of the results, concern about the uncertainty of these results, an understanding of the impact of other decision-makers with competing goals, and concern about the economic, social, and ethical implications of automated data analysis and decision-making. To address these challenges, FODSI brings together experts from many cognate academic disciplines, including computer science, statistics, mathematics, electrical engineering, and economics. Institute research outcomes have strong potential to directly impact the many application domains for data science in industry, commerce, science and society, facilitated by mechanisms that directly involve a stream of institute-trained personnel in industrial partners' projects, and by public activities designed to nurture substantive interactions between foundational and use-inspired research communities in data science. The institute also aims to educate and mentor future leaders in data science, through the further development of a pioneering undergraduate program in data science, and by training a diverse cohort of graduate students and postdocs with an innovative approach that emphasizes strong mentorship, flexibility, and breadth of collaboration opportunities. In addition, the institute plans to host an annual summer school that will deliver core curriculum and a taste of foundational research to a diverse group of advanced undergraduates, graduate students, and postdocs. It aims to broaden participation and increase diversity in the data science workforce, bringing the excitement of data science to under-represented groups at the high school level, and targeting diverse participation in the institute's public activities. And it will act as a nexus for research and education in the foundations of data science, by convening public events, such as summer schools and research workshops and other collaborative research opportunities, and by providing models for education, human resource development, and broadening participation.

The scientific focus of the institute will encompass the full range of issues that arise in data science -- modeling issues, inferential issues, computational issues, and societal issues ? and the challenges that emerge from the conflicts between their competing requirements. Its research agenda is organized around eight themes. Three of these themes focus on key challenges arising from the rich variety of interactions between a decision maker and its environment, not only the classical view of data that is processed in a batch or a stream, but also sequential interactions with feedback (the control perspective), experimental interactions designed to answer "what if" questions (the causality perspective), and strategic interactions involving other actors with conflicting goals (the economic perspective). The other research themes focus on opportunities for major impacts across disciplinary boundaries: on elucidating the algorithmic landscape of statistical problems, and in particular the computational complexity of statistical estimation problems, on sketching, sampling, and sub-linear time algorithms designed to address issues of scalability in data science problems; on exploiting statistical methodology in the service of algorithms; and on using breakthroughs in applied mathematics to address computational and inferential challenges. Intellectual contributions to societal issues in data science will feature throughout this set of themes. The institute will exploit strong connections with its scientific and industrial partners to ensure that these research directions enjoy a rich engagement with a broad range of commercial, technological and scientific application domains. Its sequence of research workshops and a collaborative research program will serve the broader research community by nurturing additional research in these key challenge areas. The institute will be led by a steering committee that will seek the help of an external advisory board to prioritize its research themes and activities throughout its lifetime. Its educational programs will include curriculum development from K-12 through undergraduate, a graduate level visit program, and a postdoc training model, aimed at empowering the next generation of leaders to fluidly work across conventional disciplinary boundaries while being mindful of the full set of scientific issues. The institute will undertake a multi-pronged effort to recruit, engage and support the full range of groups traditionally under-represented in mathematics, computer science and statistics.

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.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 53)
Bartlett, Peter L. and Bubeck, Sebastien and Cherapanamjeri, Yeshwanth "Adversarial Examples in Multi-Layer Random ReLU Networks" Advances in Neural Information Processing Systems , v.34 , 2021 Citation Details
Chatterji, Niladri S. and Long, Philip M. and Bartlett, Peter L. "When does gradient descent with logistic loss find interpolating two-layer networks?" Journal of machine learning research , v.22 , 2021 Citation Details
Wei, Alexander and Hu, Wei and Steinhardt, Jacob "More Than a Toy: Random Matrix Models Predict How Real-World Neural Representations Generalize" International Conference on Machine Learning , 2022 Citation Details
Chatterji, Niladri S. and Bartlett, Peter L. and Long, Philip M. "Oracle lower bounds for stochastic gradient sampling algorithms" Bernoulli , v.28 , 2022 Citation Details
Bartlett, Peter L. and Montanari, Andrea and Rakhlin, Alexander "Deep learning: a statistical viewpoint" Acta numerica , 2021 Citation Details
Braverman, Mark and Derakhshan, Mahsa and Lovett, Antonio Molina "Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark" 23rd ACM Conference on economics and Computation , 2022 https://doi.org/10.1145/3490486.3538315 Citation Details
Cherapanamjeri, Yeshwanth and Daskalakis, Constantinos and Ilyas, Andrew and Zampetakis, Manolis "Estimation of Standard Auction Models" 23rd ACM Conference on Economics and Computation , 2022 https://doi.org/10.1145/3490486.3538284 Citation Details
Daskalakis, Constantinos and Stefanou, Patroklos and Yao, Rui and Zampetakis, Manolis "Efficient Truncated Linear Regression with Unknown Noise Variance" Advances in neural information processing systems , 2021 Citation Details
Daskalakis, Constantinos and Skoulakis, Stratis and Zampetakis, Manolis "The Complexity of Constrained Min-Max Optimization" Proceedings of the Annual ACM Symposium on Theory of Computing , v.53 , 2021 https://doi.org/10.1145/3406325.3451125 Citation Details
Pacchiano, Aldo and Lee, Jonathan and Bartlett, Peter L. and Nachum, Ofir "Near Optimal Policy Optimization via REPS" Advances in neural information processing systems , v.34 , 2021 Citation Details
Zrnic, Tijana and Mazumdar, Eric and Sastry, Shankar and Jordan, Michael I "Who Leads and Who Follows in Strategic Classification?" ArXivorg , 2021 Citation Details
(Showing: 1 - 10 of 53)

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page