activity
20232026
most citedOrdered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing

18 citations · 37 across the 11 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2026

Towards Compressive and Scalable Recurrent Memory

Yunchong Song, Jushi Kai, Liming Lu +2

Transformers face a quadratic bottleneck in attention when scaling to long contexts. Recent approaches introduce recurrent memory to extend context beyond the current window, yet t…

cs.LG2025

FlowRL: Matching Reward Distributions for LLM Reasoning

Xuekai Zhu, Daixuan Cheng, Dinghuai Zhang +20

We propose FlowRL: matching the full reward distribution via flow balancing instead of maximizing rewards in large language model (LLM) reinforcement learning (RL). Recent advanced…

cs.LG2024

Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention

Siyuan Huang, Yunchong Song, Jiayue Zhou +1

In the realm of graph learning, there is a category of methods that conceptualize graphs as hierarchical structures, utilizing node clustering to capture broader structural informa…

cs.LG2024

Graph Parsing Networks

Yunchong Song, Siyuan Huang, Xinbing Wang +2

Graph pooling compresses graph information into a compact representation. State-of-the-art graph pooling methods follow a hierarchical approach, which reduces the graph size step-b…

cs.LG2023★ 2 cited

Tailoring Self-Attention for Graph via Rooted Subtrees

Siyuan Huang, Yunchong Song, Jiayue Zhou +1

Attention mechanisms have made significant strides in graph learning, yet they still exhibit notable limitations: local attention faces challenges in capturing long-range informati…

cs.LG2023★ 18 cited

Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing

Yunchong Song, Chenghu Zhou, Xinbing Wang +1

Most graph neural networks follow the message passing mechanism. However, it faces the over-smoothing problem when multiple times of message passing is applied to a graph, causing…