Award Abstract # 2321504
III: Small: A New Machine Learning Paradigm Towards Effective yet Efficient Foundation Graph Learning Models

NSF Org: IIS
Division of Information & Intelligent Systems
Recipient: UNIVERSITY OF NOTRE DAME DU LAC
Initial Amendment Date: September 12, 2023
Latest Amendment Date: September 12, 2023
Award Number: 2321504
Award Instrument: Standard Grant
Program Manager: Raj Acharya
racharya@nsf.gov
 (703)292-7978
IIS
 Division of Information & Intelligent Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: October 1, 2023
End Date: September 30, 2026 (Estimated)
Total Intended Award Amount: $599,573.00
Total Awarded Amount to Date: $599,573.00
Funds Obligated to Date: FY 2023 = $599,573.00
History of Investigator:
  • Yanfang Ye (Principal Investigator)
    yye7@nd.edu
Recipient Sponsored Research Office: University of Notre Dame
940 GRACE HALL
NOTRE DAME
IN  US  46556-5708
(574)631-7432
Sponsor Congressional District: 02
Primary Place of Performance: University of Notre Dame
940 Grace Hall
NOTRE DAME
IN  US  46556-5708
Primary Place of Performance
Congressional District:
02
Unique Entity Identifier (UEI): FPU6XGFXMBE9
Parent UEI: FPU6XGFXMBE9
NSF Program(s): Info Integration & Informatics
Primary Program Source: 01002324DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7364, 7923
Program Element Code(s): 736400
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Inspired by the success of foundation language models in applications such as ChatGPT, one can envision the far-reaching impacts that can be brought by a pre-trained Foundation Graph Learning Model (FGLM) with broader applications in the areas such as scientific research, social network analysis, anomaly detection, drug discovery, and e-commerce. Despite the significant progress of pre-trained graph neural networks, there has not yet a FGLM that can achieve desired performance on various graph-learning-related tasks. To bridge this gap, the goal of this project is to design and develop a new machine-learning paradigm (techniques, methods, and models) towards effective yet efficient FGLMs, which will help researchers and practitioners advance their work in a wide range of real-world applications driven by the prevalent graph-structured data, thus helping to enhance national safety, public health, and welfare. The project outcomes (such as open-source code, benchmark data, and models) will be made publicly accessible and be broadly distributed through demos, publications, media presentations, and the like. This project will integrate research with education, including novel curriculum development, student mentoring, professional training and workforce development, and K-12 outreach activities aimed at women and underrepresented groups.

By developing a new machine-learning paradigm to jointly solve the multi-task, cross-graph, and cross-domain challenges in graph learning at the first attempt, this project includes three interconnected research components towards effective yet efficient FGLMs. First, to realize the strong and consistent task-generalization ability for FGLMs in an effective yet affordable way, given a graph, the team will design and develop a new multi-task self-supervised graph learning framework with a novel multi-gradient descent optimization algorithm coupled with adaptive data augmentation to learn each task equitably well. Second, as real-world graphs are always incomplete, to learn comprehensive knowledge for a specific domain, the team will develop a new multi-graph co-training framework, specifically a variational expectation-maximization framework with relational knowledge distillation, to jointly train the generated graphs in an effective yet efficient manner while tackling the challenge of diversified node attributes of different graphs. Third, to further enable cross-domain knowledge transfer for pre-trained FGLMs, the team will develop mixture-of-expert based meta-learning techniques to characterize the latent properties of graphs from different domains and adaptively utilize the knowledge learned from existing domains to infer on a rarely seen or unseen domain. The new machine-learning paradigm developed in this project will accelerate the development in the rapidly evolving area of pre-trained graph neural networks, advance the field of information integration and informatics, and help researchers and practitioners in different domains to advance their work in a variety of real-world applications driven by the ubiquitous graph data.

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.

Chen, Chaoran and Li, Weijun and Song, Wenxin and Ye, Yanfang and Yao, Yaxing and Li, Toby Jia-Jun "An Empathy-Based Sandbox Approach to Bridge the Privacy Gap among Attitudes, Goals, Knowledge, and Behaviors" , 2024 https://doi.org/10.1145/3613904.3642363 Citation Details
Chen, Chaoran and Yao, Bingsheng and Ye, Yanfang and Wang, Dakuo and Li, Toby Jia-Jun "Evaluating the LLM Agents for Simulating Humanoid Behavior" , 2024 Citation Details
Ju, Mingxuan and Zhao, Tong and Wen, Qianlong and Yu, Wenhao and Shah, Neil and Ye, Yanfang and Zhang, Chuxu "Multi-task Self-supervised Graph Neural Networks Enable Stronger Task Generalization" , 2023 Citation Details
Ju, Mingxuan and Zhao, Tong and Yu, Wenhao and Shah, Neil and Ye, Yanfang "GraphPatcher: Mitigating Degree Bias for Graph Neural Networks via Test-time Node Patching" , 2023 Citation Details
Liu, Zheyuan and Zhang, Chunhui and Tian, Yijun and Zhang, Erchi and Huang, Chao and Ye, Yanfang and Zhang, Chuxu "Fair Graph Representation Learning via Diverse Mixture-of-Experts" , 2023 https://doi.org/10.1145/3543507.3583207 Citation Details
Ma, Tianyi and Qian, Yiyue and Zhang, Chuxu and Ye, Yanfang "Hypergraph Contrastive Learning for Drug Trafficking Community Detection" , 2023 https://doi.org/10.1109/ICDM58522.2023.00149 Citation Details
Wen, Qianlong and Li, Jiazheng and Zhang, Chuxu and Ye, Yanfang "A Multi-Modality Framework for Drug-Drug Interaction Prediction by Harnessing Multi-source Data" , 2023 https://doi.org/10.1145/3583780.3614765 Citation Details
Yuan, Xiangchi and Tian, Yijun and Zhang, Chunhui and Ye, Yanfang and Chawla, Nitesh V and Zhang, Chuxu "Graph Cross Supervised Learning via Generalized Knowledge" , 2024 https://doi.org/10.1145/3637528.3671830 Citation Details
Zhang, Chunhui and Tian, Yijun and Ju, Mingxuan and Liu, Zheyuan and Ye, Yanfang and Chawla, Nitesh and Zhang, Chuxu "Chasing All-Round Graph Representation Robustness: Model, Training, and Optimization" , 2023 Citation Details
Zhao, Jianan and Wen, Qianlong and Ju, Mingxuan and Zhang, Chuxu and Ye, Yanfang "Self-Supervised Graph Structure Refinement for Graph Neural Networks" The 16th ACM International WSDM Conference (WSDM) , 2023 https://doi.org/10.1145/3539597.3570455 Citation Details

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

Print this page

Back to Top of page