School of Life Sciences, Tiangong University(天津工大学生命科学学院);School of Electronics and Information Engineering, Tiangong University(天津工业大学电子与信息工程学院);School of Software, Beihang University(北京航空航天大学软件学院)
Yanbei Liu, Yu Zhao, Xiao Wang, Lei Geng, Zhitao Xiao
Graph-level contrastive learning, aiming to learn the representations for each graph by contrasting two augmented graphs, has attracted considerable attention. Previous studies usually simply assume that a graph and its augmented graph as a positive pair, otherwise as a negative pair. However, it is well known that graph structure is always complex and multi-scale, which gives rise to a fundamental question: after graph augmentation, will the previous assumption still hold in reality? By an experimental analysis, we discover the semantic information of an augmented graph structure may be not consistent as original graph structure, and whether two augmented graphs are positive or negative pairs is highly related with the multi-scale structures. Based on this finding, we propose a multi-scale subgraph contrastive learning architecture which is able to characterize the fine-grained semantic information. Specifically, we generate global and local views at different scales based on subgraph sampling, and construct multiple contrastive relationships according to their semantic associations to provide richer self-supervised signals. Extensive experiments and parametric analyzes on eight graph classification real-world datasets well demonstrate the effectiveness of the proposed method.
A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning
LTCI, Télécom Paris Institut Polytechnique de Paris(巴黎理工学院电信高等学院LTCI实验室);École des Mines de Saint-Étienne(圣埃蒂安矿业学院);Université Paris Dauphine-PSL(巴黎多芬大学-PSL大学);Université Paris-Saclay CentraleSupélec(巴黎萨克雷大学中央高等电力学院);Inria(法国国家信息与自动化研究所)
Graph Contrastive Learning with Cohesive Subgraph Awareness
Key Lab of High Confidence Software Technologies (Peking University)(高可信软件技术重点实验室(北京大学));School of Computer Science, Peking University(北京大学计算机学院);School of Information Management and Engineering, Shanghai University of Finance and Economics(上海财经大学信息管理与工程学院);National Key Laboratory for Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室);School of Artificial Intelligence, Nanjing University(南京大学人工智能学院)
MemAdapter: Fast Alignment across Agent Memory Paradigms via Generative Subgraph Retrieval
The University of Manchester(曼彻斯特大学);Stanford University(斯坦福大学);Imperial College London(伦敦帝国理工学院);National Institute of Advanced Industrial Science(国家先进工业科学与技术研究院)
Global Concept Explanations for Graphs by Contrastive Learning
Institute of Theoretical Informatics, Karlsruhe Insitute of Technology, Kaiserstr. 12, 76131 Karlsruhe, Germany Institute of Nanotechnology, Karlsruhe Insitute of Technology, Kaiserstr. 12, 76131 Karlsruhe, Germany
Improving the Modality Representation with Multi-View Contrastive Learning for Multimodal Sentiment Analysis
University of Chinese Academy of Sciences(中国科学院大学);Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);Henan University(河南大学)
Beyond Objective Expressivity: Geometry Preservation in Multimodal Contrastive Learning
Berlin Institute of Health, Charité - Universitätsmedizin Berlin(柏林健康研究院,柏林夏里特大学医学中心);Department of Mathematics and Computer Science, Freie Universität Berlin(柏林自由大学数学与计算机科学系);Intelligent Medicine Institute, Fudan University(复旦大学智能医学研究院)
PEARL: Path-Entity Aligned Relational Learning with Contextual Subgraphs for Inductive Knowledge Graph Completion
School of Mathematics, Shandong University(山东大学数学学院);School of Physical and Mathematical Sciences, Nanyang Technological University(南洋理工大学物理与数学科学学院);Data Science Institute, Shandong University(山东大学数据科学研究院)
ViSR-KGC: Visual Subgraph Reasoning with Vision-Language Models for Multimodal Knowledge Graph Completion
Institute of Software, Chinese Academy of Sciences(中国科学院软件研究所);University of Chinese Academy of Sciences(中国科学院大学);CITIC Securities(中信证券);School of Artificial Intelligence, Beijing Normal University(北京师范大学人工智能学院)
Subgraph Retrieval Enhanced by Graph-Text Alignment for Commonsense Question Answering
School of Intelligence Science and Technology, Peking University(北京大学智能科学与技术学院);Ant Group(蚂蚁集团);School of Artificial Intelligence, Beijing Normal University(北京师范大学人工智能学院)
MDGMIX: Boundary-Aware Subgraph Mixing for Multi-Domain Graph Pre-Training
School of Computer Science(计算机科学学院);Technology, Xidian University, Xi’an, China(技术学院,西安电子科技大学);School of Artificial Intelligence, Xidian University, Xi’an, China(人工智能学院,西安电子科技大学)