Award Abstract # 2216899
Institute for Data, Econometrics, Algorithms and Learning (IDEAL)

NSF Org: ECCS
Division of Electrical, Communications and Cyber Systems
Recipient: TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO
Initial Amendment Date: July 28, 2022
Latest Amendment Date: August 14, 2024
Award Number: 2216899
Award Instrument: Continuing Grant
Program Manager: Eyad Abed
eabed@nsf.gov
 (703)292-2303
ECCS
 Division of Electrical, Communications and Cyber Systems
ENG
 Directorate for Engineering
Start Date: September 1, 2022
End Date: August 31, 2027 (Estimated)
Total Intended Award Amount: $1,967,500.00
Total Awarded Amount to Date: $1,687,375.00
Funds Obligated to Date: FY 2022 = $787,000.00
FY 2023 = $787,000.00

FY 2024 = $113,375.00
History of Investigator:
  • Avrim Blum (Principal Investigator)
    avrim@ttic.edu
  • Nathan Srebro (Co-Principal Investigator)
  • Julia Chuzhoy (Co-Principal Investigator)
  • Yury Makarychev (Co-Principal Investigator)
  • Matthew Walter (Co-Principal Investigator)
Recipient Sponsored Research Office: Toyota Technological Institute at Chicago
6045 S KENWOOD AVE
CHICAGO
IL  US  60637-2803
(773)834-0409
Sponsor Congressional District: 01
Primary Place of Performance: Toyota Technological Institute at Chicago
IL  US  60637-2803
Primary Place of Performance
Congressional District:
01
Unique Entity Identifier (UEI): ERBJF4DMW6G4
Parent UEI: ERBJF4DMW6G4
NSF Program(s): TRIPODS Transdisciplinary Rese,
HDR-Harnessing the Data Revolu,
EPCN-Energy-Power-Ctrl-Netwrks
Primary Program Source: 01002223DB NSF RESEARCH & RELATED ACTIVIT
01002324DB NSF RESEARCH & RELATED ACTIVIT

01002425DB NSF RESEARCH & RELATED ACTIVIT

01002526DB NSF RESEARCH & RELATED ACTIVIT

01002627DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 048Z, 062Z, 075Z, 079Z, 6840, 7218, 8888, 9102
Program Element Code(s): 041Y00, 099Y00, 760700
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.041, 47.049, 47.070

ABSTRACT

The Institute for Data, Econometrics, Algorithms, and Learning (IDEAL) will consolidate and amplify research devoted to the foundations of data science across all the major research-focused educational institutions in the greater Chicago area: the University of Illinois at Chicago, Northwestern University, the Toyota Technological Institute at Chicago, the University of Chicago, and the Illinois Institute of Technology. This transdisciplinary institute involves over 50 researchers working on key aspects of the foundations of data science across computer science, electrical engineering, mathematics, statistics, and several related fields like economics, operations research, and law, and they are complemented by members of Google?s learning theory team. Its research goals range from the core foundations of data science to its interfaces with other disciplines: 1) tackling important challenges related to foundations of machine learning and optimization, 2) addressing statistical, algorithmic and mathematical challenges in dealing with high-dimensional data, and 3) exploring the foundations of aspects of data science that interact with society. The institute will foster strong connections with the community and local high schools, broaden participation in data science locally and nationally, and build lasting research and educational infrastructure through its activities. Institute activities will include workshops for undergraduate students, high school teacher workshops, public lectures, and museum exhibit designs. These will build new pathways for undergraduate students, high school students, and the broader public from diverse and underrepresented backgrounds, to increase participation and engagement with scientific fields related to data science.

The research thrusts of the institute will center around the foundations of machine learning, high-dimensional data analysis and inference, and data science and society. Specific topics include foundations of deep learning, reinforcement learning, machine learning and logic, network inference, high-dimensional data analysis, trustworthiness & reliability, fairness, and data science with strategic agents. The research activities are designed to facilitate collaboration between the different disciplines and across the five Chicago-area institutions, and they build on the extensive experience from previous efforts of the participating universities. The activities include topical special programs, postdoctoral fellows, co-mentored PhD students, workshops, coordinated graduate courses, visiting fellows, research meetings, and brainstorming sessions. The proposed research will lead to new theoretical frameworks, models, mathematical tools and algorithms for analyzing high-dimensional data, inference and learning. Successful outcomes will also lead to a better understanding of the foundations of data science and machine learning in both strategic and non-strategic environments ? including emerging concerns like reliability, fairness, privacy and interpretability as data science interacts with society in various ways. The institute will also have broader impacts of strengthening research and educational infrastructure, developing human resources, broadening participation from underrepresented groups, and by connecting theory to science and industry. The institute will organize activities to engage the community and a diverse group of students at all levels, including introductory workshops for undergraduate research participants, high school student and teacher outreach (through a partnership with the Math Circles of Chicago), and public lectures as part of both our research program and a partnership with the Museum of Science and Industry. The Chicago public institutions that we engage serve a very diverse population, so the outreach, recruitment, and training activities will broaden participation from underrepresented groups. Finally, the institute will have direct engagement with applications and industry through its activities involving Google, other industry partners in the broader Chicago area, and applied data science institutes.

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 13)
Ahmadi, Saba and Blum, Avrim and Montasser, Omar and Stangl, Kevin M "Agnostic Multi-Robust Learning using ERM" The 27th International Conference on Artificial Intelligence and Statistics (AISTATS 2024) , 2024 Citation Details
Ahmadi, Saba and Blum, Avrim and Yang, Kunhe "Fundamental Bounds on Online Strategic Classification" Proceedings of the 24th ACM Conference on Economics and Computation , 2023 https://doi.org/10.1145/3580507.3597818 Citation Details
Blum, Avrim and Dutz, Melissa "Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round" 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) , 2024 https://doi.org/10.4230/LIPIcs.ITCS.2024.18 Citation Details
Blum, Avrim and Gupta, Meghal and Li, Gene and Manoj, Naren Sarayu and Saha, Aadirupa and Yang, Yuanyuan "Dueling Optimization with a Monotone Adversary" The 35th International Conference on Algorithmic Learning Theory (ALT 2024) , 2024 Citation Details
Carlson, Charlie and Jafarov, Jafar and Makarychev, Konstantin and Makarychev, Yury and Shan, Liren "Approximation Algorithm for Norm Multiway Cut" Proceedings of the European Symposium on Algorithms , 2023 https://doi.org/10.4230/LIPIcs.ESA.2023.32 Citation Details
Chuzhoy, Julia and Khanna, Sanjeev "A Faster Combinatorial Algorithm for Maximum Bipartite Matching" , 2024 Citation Details
Chuzhoy, Julia and Parter, Merav "Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition" Proceedings of the annual ACMSIAM Symposium on Discrete Algorithms , 2025 Citation Details
Chuzhoy, Julia and Trabelsi, Ohad "Breaking the ()-Time Barrier for Vertex-Weighted Global Minimum Cut" , 2025 https://doi.org/10.1145/3717823.3718185 Citation Details
Makarychev, Konstantin and Makarychev, Yury and Shan, Liren and Vijayaraghavan, Aravindan "Higher-Order Cheeger Inequality for Partitioning with Buffers" Proceedings of the Symposium on Discrete Algorithms , 2024 https://doi.org/10.1137/1.9781611977912.80 Citation Details
Makarychev, Yury and Manoj, Naren Sarayu and Ovsiankin, Max "Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes" Proceedings of the Symposium on Theory of Computing , 2024 https://doi.org/10.1145/3618260.3649692 Citation Details
Makarychev, Yury and Ovsiankin, Max and Tani, Erasmo "Approximation Algorithms for _p-Shortest Path and _p-Group Steiner Tree" , v.297 , 2024 https://doi.org/10.4230/LIPIcs.ICALP.2024.111 Citation Details
(Showing: 1 - 10 of 13)

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

Print this page

Back to Top of page