MFAI: Computational and Statistical Limits in Generative Sampling

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

Abstract

This project aims to fill the gap in foundational knowledge between well-established sampling and estimation methods and Artificial Intelligence (AI)-inspired ones, referred to as ‘generative sampling.’ Generative AI algorithms are capable of producing plausible instances of objects from complex distributions, such as ‘naturally occurring’ sentences or ‘naturally occurring’ images. Rather than learning a probability distribution, these methods typically learn an ‘algorithm’ to generate samples with the desired distribution. This project has two main goals: (1) Determine the fundamental computational and statistical limitations of generative Artificial Intelligence (AI) methods, addressing what the classes of outputs (probability distributions) can and cannot be generated by these methods; (2) Design algorithms to accelerate the generation process. The project also involves training activities in this area through the involvement of undergraduate and graduate students in this research and the development of topics courses. More specifically, the project’s focus is on denoising diffusions, their generalization via stochastic localization, and related approaches. It appears that the scope and limitations of these methods are dictated by subtle properties of the target probability distribution. For instance, it can happen that a distribution can be sampled in polynomial time, and yet reasonable polynomial time generative processes, e.g., all denoising diffusions in a broad cla

Key facts

NSF award ID
2501597
Awardee
Stanford University (CA)
SAM.gov UEI
HJD6G4D6TJY5
PI
Nima Anari
Primary program
01002526DB NSF RESEARCH & RELATED ACTIVIT
All programs
Artificial Intelligence (AI), Machine Learning Theory
Estimated total
$900,000
Funds obligated
$900,000
Transaction type
Standard Grant
Period
09/01/2025 → 08/31/2028