A Survey of Trustworthy Graph Learning: Reliability, Explainability, and Privacy Protection

• URL: http://arxiv.org/abs/2205.10014v2
• Date: Mon, 23 May 2022 09:01:29 GMT
• Title: A Survey of Trustworthy Graph Learning: Reliability, Explainability, and Privacy Protection
• Authors: Bingzhe Wu, Jintang Li, Junchi Yu, Yatao Bian, Hengtong Zhang, CHaochao Chen, Chengbin Hou, Guoji Fu, Liang Chen, Tingyang Xu, Yu Rong, Xiaolin Zheng, Junzhou Huang, Ran He, Baoyuan Wu, GUangyu Sun, Peng Cui, Zibin Zheng, Zhe Liu, Peilin Zhao
• Abstract summary: Trustworthy graph learning (TwGL) aims to solve the above problems from a technical viewpoint. In contrast to conventional graph learning research which mainly cares about model performance, TwGL considers various reliability and safety aspects.
• Score: 136.71290968343826
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep graph learning has achieved remarkable progresses in both business and scientific areas ranging from finance and e-commerce, to drug and advanced material discovery. Despite these progresses, how to ensure various deep graph learning algorithms behave in a socially responsible manner and meet regulatory compliance requirements becomes an emerging problem, especially in risk-sensitive domains. Trustworthy graph learning (TwGL) aims to solve the above problems from a technical viewpoint. In contrast to conventional graph learning research which mainly cares about model performance, TwGL considers various reliability and safety aspects of the graph learning framework including but not limited to robustness, explainability, and privacy. In this survey, we provide a comprehensive review of recent leading approaches in the TwGL field from three dimensions, namely, reliability, explainability, and privacy protection. We give a general categorization for existing work and review typical work for each category. To give further insights for TwGL research, we provide a unified view to inspect previous works and build the connection between them. We also point out some important open problems remaining to be solved in the future developments of TwGL.

Related papers

• Resilience in Knowledge Graph Embeddings [1.90894751866253]
  We give a unified definition of resilience, encompassing several factors such as generalisation, performance consistency, distribution adaption, and robustness. Our survey results show that most of the existing works focus on a specific aspect of resilience, namely robustness.
  arXiv  Detail & Related papers  (2024-10-28T16:04:22Z)
• Continual Learning on Graphs: Challenges, Solutions, and Opportunities [72.7886669278433]
  We provide a comprehensive review of existing continual graph learning (CGL) algorithms. We compare methods with traditional continual learning techniques and analyze the applicability of the traditional continual learning techniques to forgetting tasks. We will maintain an up-to-date repository featuring a comprehensive list of accessible algorithms.
  arXiv  Detail & Related papers  (2024-02-18T12:24:45Z)
• A Survey of Data-Efficient Graph Learning [16.053913182723143]
  We introduce a novel concept of Data-Efficient Graph Learning (DEGL) as a research frontier. We systematically review recent advances on several key aspects, including self-supervised graph learning, semi-supervised graph learning, and few-shot graph learning.
  arXiv  Detail & Related papers  (2024-02-01T09:28:48Z)
• Continual Graph Learning: A Survey [4.618696834991205]
  Research on continual learning (CL) mainly focuses on data represented in the Euclidean space. Most graph learning models are tailored for static graphs. Catastrophic forgetting also emerges in graph learning models when being trained incrementally.
  arXiv  Detail & Related papers  (2023-01-28T15:42:49Z)
• Privacy-preserving Graph Analytics: Secure Generation and Federated Learning [72.90158604032194]
  We focus on the privacy-preserving analysis of graph data, which provides the crucial capacity to represent rich attributes and relationships. We discuss two directions, namely privacy-preserving graph generation and federated graph learning, which can jointly enable the collaboration among multiple parties each possessing private graph data.
  arXiv  Detail & Related papers  (2022-06-30T18:26:57Z)
• Recent Advances in Reliable Deep Graph Learning: Inherent Noise, Distribution Shift, and Adversarial Attack [56.132920116154885]
  Deep graph learning (DGL) has achieved remarkable progress in both business and scientific areas. Applying DGL to real-world applications faces a series of reliability threats including inherent noise, distribution shift, and adversarial attacks.
  arXiv  Detail & Related papers  (2022-02-15T00:55:16Z)
• Graph Learning based Recommender Systems: A Review [111.43249652335555]
  Graph Learning based Recommender Systems (GLRS) employ advanced graph learning approaches to model users' preferences and intentions as well as items' characteristics for recommendations. We provide a systematic review of GLRS, by discussing how they extract important knowledge from graph-based representations to improve the accuracy, reliability and explainability of the recommendations.
  arXiv  Detail & Related papers  (2021-05-13T14:50:45Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.