Modern Optimal Recovery: Enriched, Nonconvex, Dynamical

NSF Award Search · 01002526DB NSF RESEARCH & RELATED ACTIVIT · $239,850 · view on nsf.gov ↗

Abstract

Numerous industrial and societal sectors depend heavily on the algorithmic automation that has emerged from Artificial Intelligence and Machine Learning. However, many algorithms were originally conceived to work approximately well most of the time, which does not fit the standards for areas critically important to the United States, such as defense, medicine, and transportation, where slight failure, however infrequent, is not an option. The purpose of the project is to further develop a mathematical framework called Optimal Recovery, which provides guarantees for function learning and recovery under realistic modeling assumptions. The results are expected to have implications in any field of science where average-case guarantees are not sufficient and worst-case guarantees are sought. The project also involves training early career mathematicians in computational and data-related topics that lay at the foundation of timely developments in Artificial Intelligence. The planned investigations are intended to widen the scope and applicability of Optimal Recovery on three selected topics. In the first topic, the theory and practice usually centered on functions with single real-valued outputs will be extended to functions with more complicated outputs. In the second topic, common assumptions of convexity on the quantities of interest and on the model sets will be generalized, allowing the results to apply to non-convex models including those utilizing neural networks. In the

Key facts

NSF award ID
2505204
Awardee
Texas A&M University (TX)
SAM.gov UEI
JF6XLNB4CDJ5
PI
Simon Foucart
Primary program
01002526DB NSF RESEARCH & RELATED ACTIVIT
All programs
Artificial Intelligence (AI), Machine Learning Theory
Estimated total
$239,850
Funds obligated
$239,850
Transaction type
Standard Grant
Period
08/15/2025 → 07/31/2028