Award Abstract # 1925263
ATD: Algorithms for Point Processes on Networks for Threat Detection

NSF Org: DMS
Division Of Mathematical Sciences
Recipient: GEORGIA STATE UNIVERSITY RESEARCH FOUNDATION INC
Initial Amendment Date: July 8, 2019
Latest Amendment Date: August 14, 2019
Award Number: 1925263
Award Instrument: Standard Grant
Program Manager: Tomek Bartoszynski
tbartosz@nsf.gov
 (703)292-4885
DMS
 Division Of Mathematical Sciences
MPS
 Directorate for Mathematical and Physical Sciences
Start Date: September 1, 2019
End Date: August 31, 2023 (Estimated)
Total Intended Award Amount: $199,663.00
Total Awarded Amount to Date: $207,663.00
Funds Obligated to Date: FY 2019 = $207,663.00
History of Investigator:
  • Xiaojing Ye (Principal Investigator)
    xye@gsu.edu
Recipient Sponsored Research Office: Georgia State University Research Foundation, Inc.
58 EDGEWOOD AVE NE
ATLANTA
GA  US  30303-2921
(404)413-3570
Sponsor Congressional District: 05
Primary Place of Performance: Georgia State University
25 Park Place 14th Floor
Atlanta
GA  US  30302-5060
Primary Place of Performance
Congressional District:
05
Unique Entity Identifier (UEI): MNS7B9CVKDN7
Parent UEI:
NSF Program(s): ATD-Algorithms for Threat Dete
Primary Program Source: 01001920DB NSF RESEARCH & RELATED ACTIVIT
01001920RB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 6877
Program Element Code(s): 046Y00
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.049

ABSTRACT

We live in a world full of networks: contact and social networks connect us to our family, friends and colleagues; computer networks such as Internet allow us to access huge amount of data and information remotely; traffic and logistical networks deliver people, water/food, and all kinds of goods faster than ever before. While we enjoy the conveniences brought by these networks, we must also be aware of the threats and harms if they get jeopardized by, for example, infectious virus, cyber-attacks, etc. The goal of this project is to develop computational algorithms for automated early threat detection based on novel and rigorous mathematical modeling and data analysis concepts. In particular, the activities generated by human and other sources on these networks are modeled as the so-called interactive stochastic point processes. These dynamics are studied and inferred in a mathematical framework of jump stochastic differential equations, which is further extended to integrate mean-field approximation and deep learning techniques that fully leverage the existing big data for fast and accurate threat detection. This project will exploit three closely related computational problems in-depth: influence prediction, optimal sensor allocation, and source identification, all of which are fundamental in threat detection applications on large, heterogeneous, real-world networks.

This project will exploit two novel approaches to influence prediction based on a jump stochastic differential equation (JSDE) formulation and an integration of mean field approximation and deep learning techniques. The JSDE formulation yields a concise and exact mathematical formulation of the temporal point process that takes into account the known network structure and mechanism of epidemic spread; and the deep neural mean field approach deduced from JSDE formulation maps the classical difference method in numerical analysis into a structured multi-layer residual network, where the unknown bias of mean field approximation can be effectively learned from observed cascade data for rapid influence prediction. These prediction algorithms will be used in the optimal sensor allocation and epidemic source identification problems for threat detection and mitigation. The results produced in this project are expected to make significant contributions to our understanding of interdependent activities on large-scale heterogeneous networks and the development of new, efficient algorithms for threat detection. The outcomes of the project include novel computational techniques, rigorous mathematical theory and analysis, and efficient numerical algorithms for threat detection applications.

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 20)
Bao, Gang and Ye, Xiaojing and Zang, Yaohua and Zhou, Haomin "Numerical solution of inverse problems by weak adversarial networks" Inverse Problems , v.36 , 2020 https://doi.org/10.1088/1361-6420/abb447 Citation Details
Bian, Wanyu and Chen, Yunmei and Ye, Xiaojing "An optimal control framework for joint-channel parallel MRI reconstruction without coil sensitivities" Magnetic Resonance Imaging , v.89 , 2022 https://doi.org/10.1016/j.mri.2022.01.011 Citation Details
Bian, Wanyu and Chen, Yunmei and Ye, Xiaojing and Zhang, Qingchao "An Optimization-Based Meta-Learning Model for MRI Reconstruction with Diverse Dataset" Journal of Imaging , v.7 , 2021 https://doi.org/10.3390/jimaging7110231 Citation Details
Bian, Wanyu and Zhang, Qingchao and Ye, Xiaojing and Chen, Yunmei "A Learnable Variational Model for Joint Multimodal MRI Reconstruction and Synthesis" Medical Image Computing and Computer Assisted Intervention MICCAI 2022 , 2022 Citation Details
Bian, Wanyu and Zhang, Qingchao and Ye, Xiaojing and Chen, Yunmei "A Learnable Variational Model for Joint Multimodal MRI Reconstruction and Synthesis" , 2022 https://doi.org/10.1007/978-3-031-16446-0_34 Citation Details
Chen, Chenxi and Chen, Yunmei and Ye, Xiaojing "A randomized incremental primal-dual method for decentralized consensus optimization" Analysis and Applications , 2019 https://doi.org/10.1142/S0219530519410082 Citation Details
Chen, Yunmei and Liu, Hongcheng and Ye, Xiaojing and Zhang, Qingchao "Learnable descent algorithm for nonsmooth nonconvex image reconstruction" SIAM journal on imaging sciences , 2021 https://doi.org/10.1137/20M1353368 Citation Details
Chen, Yunmei and Ye, Xiaojing and Zhang, Wei "Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization" Computational Optimization and Applications , 2020 10.1007/s10589-020-00208-9 Citation Details
Ding, C. and Zhang, Q. and Wang, G. and Ye, X. and Chen, Y. "Learned Alternating Minimization Algorithm for Dual-Domain Sparse-View CT Reconstruction" International Conference on Medical Image Computing and Computer Assisted Intervention , 2023 Citation Details
Gaby, Nathan and Ye, Xiaojing "Approximation of solution operators for high-dimensional PDEs" Journal of Computational Physics , v.524 , 2025 https://doi.org/10.1016/j.jcp.2024.113709 Citation Details
Gaby, Nathan and Ye, Xiaojing and Zhou, Haomin "Neural Control of Parametric Solutions for High-Dimensional Evolution PDEs" SIAM Journal on Scientific Computing , v.46 , 2024 https://doi.org/10.1137/23M1549870 Citation Details
(Showing: 1 - 10 of 20)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

This research is on the quantitative study of information propagation formed by stochastic processes on large complex networks and its applications in threat detection. It includes both theoretical analysis and algorithmic developments of inference, optimization and control of these processes based on rigorous mathematical concepts and advanced deep learning techniques. This research is motivated and has extensive applications in many important real-world problems that involve vast amounts of random events on large complex networks, such as user interactions and news spreads on social networks (e.g., Twitter and Facebook), cyberattacks on the Internet, and epidemical spreads in a population consisting of diverse communities.

In the above problems, the fundamental element is a viral signal (e.g., a commercial advertisement, a piece of news, a tweet, or an infectious disease) originated from one or multiple source nodes propagates to their neighbors, then to the neighbors of these neighbors, and so on, over the network. This is a highly random process since it is unknown whether and when each individual node would be affected by its neighbor, and all the randomness at these individual nodes is further complicated with the heterogeneous structure of the large network. Therefore, it is important to answer these questions: (a) If there is an outbreak of a viral signal, how to accurately predict the number of nodes that will be affected in the future? (b) how to quickly identify the source of the outbreak? and (c) How to optimally deploy detectors at a limited amount of node (due to budget constraint) on the network such that random outbreaks in the future can be detected in shortest time?

In this project, the PI and his students made several major contributions to answer the above questions by developing rigorous mathematical analysis and efficient numerical algorithms. They developed a novel learning framework using neural mean-field (NMF) dynamics for inference and estimation to answer the question (a). This new framework leverages the Mori-Zwanzig formalism to obtain an exact evolution equation of the individual node infection probabilities (infection here refers to the adoption of the viral signal under consideration, such as a piece of news or an infectious virus). They also show that such phenomenon can be described by a delay differential equation where the memory integral can be approximated by time-convolution operators learned from data. Using only historical information propagation data, this new framework can simultaneously learn the structure of the network and predict the evolution of node infection probabilities for new outbreaks. To answer questions (b) and (c), they developed an optimal control approach to solve the source identification and outbreak detection problems, respectively. For source identification, the source nodes identities are considered as the control variable and the true source can be found as the optimal control which yields an information propagation closest to the observed one. For outbreak detection, the source outbreak probabilities are the control, and the optimal control is found by minimizing the expected first detection time. The results generated by this project provide deep understanding of the mathematical properties of information propagation in networks. These led to adaptive optimization and control strategies to harness the propagations processes and control the risks of new threat.

The research completed in this project also motivated a few works related to the proposed topic. In particular, the work on inverse optimal transport and mean-field dynamics explores new ways to understand and learn the mechanism of diffusion networks and its direct applications in threat detection. The work on solving Wasserstein Hamiltonian flows and approximating solution operators of evolution PDEs provide new approaches to generate samples and optimally control points in high-dimensional spaces.

This project supported two graduate students, including one female, to work on the research problems under the supervision of the PI. The female student has graduated with a PhD degree in mathematics in 2021 and became an R&D scientist to work on information propagations on networks at CareerBuilder Inc., an employment website company based in Chicago. The other student is conducting research in the same line and expected to earn his PhD degree in 2025.


Last Modified: 10/09/2023
Modified by: Xiaojing Ye

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

Print this page

Back to Top of page