NSF-BSF:CIF: localization theories for modern quickest detection

The National Science Foundation Division of Computing and Communication Foundations awarded New York University $326,288 on October 1, 2026, under the Computer and Information Science and Engineering program (CFDA 47.070) to develop localization theories for modern quickest detection.

The project establishes information-theoretic bounds and statistical performance of quickest detection algorithms—also known as sequential change-point detection—in modern asymptotic regimes and complex data structures. Quickest detection has applications in biosurveillance, environmental monitoring, disaster response, homeland security, manufacturing quality control, and threat detection. The research employs a divide-and-conquer approach partitioning global detection problems into local sub-problems investigated through localization theorems. Specific research aims include information bounds on sparse change detection, federated quickest detection over networks, and quickest detection with differential privacy. Graduate students receive training through project involvement. The work will provide rigorous foundations for future sensing and monitoring systems and help practitioners assess when improvements in data quality or sensing techniques are necessary to meet application-specific requirements.

Performance occurs at New York University in New York, New York, with a period of performance from October 1, 2026, through September 30, 2029.

Abstract

Quickest detection, also known as sequential change-point detection, has many important real-world applications, including biosurveillance, environmental monitoring, disaster response, homeland security, manufacturing quality control, and threat detection. The goal of quickest detection is to detect change in the area (e.g., a sensor) as quickly as possible, subject to a global constraint on the rate of false alarms. While the classical quickest detection theory is well developed for systems involving a single sensor or a small number of sensors, the fundamental information bounds and optimal design principles for modern data-rich environments remain largely unknown. This project will develop a general theoretical framework to characterize the information-theoretic limits of quickest detection and develop efficient online algorithms for modern settings involving high-dimensional data, distributed sensor networks, and/or privacy constraints. The results will provide rigorous foundations for future sensing and monitoring systems, and help practitioners assess when improvements in data quality or sensing techniques are necessary to meet application-specific requirements. Graduate students will also receive training through their involvement in the project's research. This project develops general localization theories for establishing information-theoretic bounds and statistical performance of quickest detection algorithms under modern asymptotic regimes and complex data structures. The central idea is a divide-and-conquer approach that partitions a global detection problem into a sequence of local sub-problems that can be investigated using localization theorems. The specific research aims are: (1) information bounds on sparse change detection; (2) federated quickest detection over networks; and (3) quickest detection with differential privacy. In addition, real-world case studies in engineering and health will be investigated. Results of the project are expected to advance the state of the art in sequential analysis, change-point detection, streaming data analysis, online learning, and large-scale statistical inference. 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.- subawards are not planned for this award.