paper-with-me

Papers

A Message Passing Perspective on Learning Dynamics of Contrastive Learning

2023-03-08 · Yifei Wang, Qi Zhang, Tianqi Du, Jiansheng Yang, Zhouchen Lin, Yisen Wang

In recent years, contrastive learning achieves impressive results on self-supervised visual representation learning, but there still lacks a rigorous understanding of its learning dynamics. In this paper, we show that if we cast a contrastive objective equivalently into the feature space, then its learning dynamics admits an interpretable form. Specifically, we show that its gradient descent corresponds to a specific message passing scheme on the corresponding augmentation graph. Based on this perspective, we theoretically characterize how contrastive learning gradually learns discriminative features with the alignment update and the uniformity update. Meanwhile, this perspective also establishes an intriguing connection between contrastive learning and Message Passing Graph Neural Networks (MP-GNNs). This connection not only provides a unified understanding of many techniques independently developed in each community, but also enables us to borrow techniques from MP-GNNs to design new contrastive learning variants, such as graph attention, graph rewiring, jumpy knowledge techniques, etc. We believe that our message passing perspective not only provides a new theoretical understanding of contrastive learning dynamics, but also bridges the two seemingly independent areas together, which could inspire more interleaving studies to benefit from each other. The code is available at https://github.com/PKU-ML/Message-Passing-Contrastive-Learning.

📄 PDF Abstract BibTeX arXiv:2303.04435

Code (1)

pku-ml/message-passing-contrastive-learning 공식 구현 pytorch

Tasks

Contrastive LearningGraph AttentionRepresentation Learning

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음

Similar Papers 제목 키워드 기반

Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing

2026-06-09 · Lianze Shan, Ningchong Wang, Jitao Zhao, Di Jin 외 arxiv

Graph Contrastive Learning (GCL), which trains graph encoders by maximizing similarity between positive samples and minimizing it between negative ones, has emerged as a mainstream graph pre-training paradigm. It is wide…

Contrastive Learning

Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages

2021-06-16 · Yi Luo, Aiguo Chen, Ke Yan, Ling Tian

Nowadays, Graph Neural Networks (GNNs) following the Message Passing paradigm become the dominant way to learn on graphic data. Models in this paradigm have to spend extra space to look up adjacent nodes with adjacency m…

Node ClassificationNode Property Prediction

Learning over Positive and Negative Edges with Contrastive Message Passing

2026-05-18 · Peter Pao-Huang, Charilaos I. Kanatsoulis, Michael Bereket, Jure Leskovec arxiv

Conventional approaches to learning on graphs involve message passing along existing (i.e., positive) edges to update node features. However, these approaches often disregard the potentially valuable information containe…

Graph Neural Network

How Particle System Theory Enhances Hypergraph Message Passing

2025-05-24 · Yixuan Ma, Kai Yi, Pietro Lio, Shi Jin 외

Hypergraphs effectively model higher-order relationships in natural phenomena, capturing complex interactions beyond pairwise connections. We introduce a novel hypergraph message passing framework inspired by interacting…

Node Classification

Exact solution to the random sequential dynamics of a message passing algorithm

2021-01-05 · Burak Çakmak, Manfred Opper

We analyze the random sequential dynamics of a message passing algorithm for Ising models with random interactions in the large system limit. We derive exact results for the two-time correlation functions and the speed o…