Award Abstract # 2402816
Collaborative Research: CIF-Medium: Privacy-preserving Machine Learning on Graphs

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: GEORGIA TECH RESEARCH CORP
Initial Amendment Date: March 29, 2024
Latest Amendment Date: March 29, 2024
Award Number: 2402816
Award Instrument: Standard Grant
Program Manager: Alfred Hero
ahero@nsf.gov
 (703)292-0000
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: May 1, 2024
End Date: April 30, 2028 (Estimated)
Total Intended Award Amount: $400,000.00
Total Awarded Amount to Date: $400,000.00
Funds Obligated to Date: FY 2024 = $400,000.00
History of Investigator:
  • Pan Li (Principal Investigator)
    panli@gatech.edu
Recipient Sponsored Research Office: Georgia Tech Research Corporation
926 DALNEY ST NW
ATLANTA
GA  US  30318-6395
(404)894-4819
Sponsor Congressional District: 05
Primary Place of Performance: Georgia Tech Research Corporation
926 DALNEY ST NW
ATLANTA
GA  US  30332-0415
Primary Place of Performance
Congressional District:
05
Unique Entity Identifier (UEI): EMW9FC8J3HN4
Parent UEI: EMW9FC8J3HN4
NSF Program(s): Comm & Information Foundations
Primary Program Source: 01002425DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 079Z, 7924
Program Element Code(s): 779700
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Graph-structured data captures intricate interactions between diverse agents, and is widespread in various scientific and engineering applications such as communication theory and computer science, medical research, computational biology, and social sciences. In many scenarios, graph information is sensitive and has to be kept private. Additionally, it often necessitates updates to accommodate changes in permissions, leading to the need to retrain sophisticated large-scale machine learning models from the ground up. To simultaneously ensure that the data is kept private and easily removable without complete relearning, and that its utility for making inference and predictions remains uncompromised, innovative, and efficient privacy-preserving machine learning algorithms for graph data are essential. In addition to establishing a framework for novel graph-learning method development, the project will also provide unique cross-disciplinary training opportunities for students in biological, physics, and financial graph data analysis; broaden the participation of women and other under-represented groups in STEM research via targeted recruiting and specialized student exchange programs; and, in the process, establish new collaborations among various machine learning, data acquisition and modeling centers/institutes housed at the participating institutions.

This project aims to address fundamental challenges in designing privacy-preserving and efficiently updatable graph neural network models by leveraging interdisciplinary techniques from machine learning, data security, information theory, theoretical computer science and statistics. The main difficulties encountered are that (i) the graph attributes and topology are heterogeneous, yet highly correlated data types; (ii) privatization reduces utility; (iii) inference attacks that aim to determine how much information is leaking for sub-optimally privatized graph learners are generally unreliable. To resolve these issues, the team will devise novel non-uniform privatization protocols that trade accuracy for varied degrees of privacy protection; implement provably efficient methods to remove graph information from graph neural network models without retraining; and in, the process, implement a new cohort of membership inference approaches that can accurately measure information retention and leakage of machine learning models.

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.

Chien, E and Li, P "Convergent Privacy Loss of Noisy-SGD without Convexity and Smoothness" , 2025 Citation Details
Chien, E and Wang, H and Chen, Z and Li, P "Certified Machine Unlearning via Noisy Stochastic Gradient Descent E Chien, H Wang, Z Chen, P Li" , 2024 Citation Details
Chien, E and Wang, H and Chen, Z and Li, P "Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning" , 2024 Citation Details
Wei, R and Chien, E and Li, P "Differentially Private Graph Diffusion with Applications in Personalized PageRanks" , 2024 Citation Details

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

Print this page

Back to Top of page