skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Award ID contains: 2430224

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).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available August 16, 2026
  2. Graph Neural Networks (GNNs) have shown superb performance in handling networked data, mainly attributed to their message passing and convolution process across neighbors. For most literature, the performance of GNNs is mainly reported based on noise-free data environments. No study has systematically evaluated GNNs’ performance under noise. In this article, we carry out an empirical study and theoretical analysis of four types of GNNs, including Graph Convolutional Networks (GCNs), Graph Attention Networks (GATs), Graph Contrastive Networks (GCL), and graph UniFilter under three types of noise, including attribute noise, structure noise, and label noise. Our study shows that GNNs behave tremendously differently in response to different types of noise. Overall, GAT is the most noise vulnerable and sensitive, whereas GCL is the most noise resilient. We further carry out theoretical analysis to explain the reason causing GAT to be sensitive to noise, and propose a solution to enhance its noise resilience. Our study brings in-depth firsthand knowledge of GNNs under noise for researchers and practitioners to better utilize GNNs in real-world applications. 
    more » « less
    Free, publicly-accessible full text available July 31, 2026
  3. Free, publicly-accessible full text available July 17, 2026
  4. Free, publicly-accessible full text available July 13, 2026
  5. Free, publicly-accessible full text available December 11, 2025
  6. Free, publicly-accessible full text available December 11, 2025
  7. Globersons, Amir; Mackey, Lester; Belgrave, Danielle; Fan, Angela; Paquet, Ulrich; Tomczak, Jakub M; Zhang, Cheng (Ed.)
    Free, publicly-accessible full text available December 10, 2025
  8. Free, publicly-accessible full text available December 9, 2025
  9. Free, publicly-accessible full text available December 9, 2025