Mutian Hong

dblp:430/8448 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0005-1725-9347ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 56% Representation and self-supervised learning · 28% Trustworthy machine learning · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph tokenization
1.012026
VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention · WWW 2026
Machine learning › Graph learning › graph neural network
graph transformer
1.012026
VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention · WWW 2026
Machine learning › Representation and self-supervised learning
vector quantization
1.012026
VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention · WWW 2026
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.312026
VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention · WWW 2026
Machine learning › Trustworthy machine learning
robustness
0.312026
VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention · WWW 2026

Methods — techniques the papers use, named apart from their topics

codebook · 1.0attention mechanism · 1.0
YearPublicationVenuePosition
2026 VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention
abstract
Graph Transformer has demonstrated impressive capabilities in the field of graph representation learning. However, existing approaches face two critical challenges: (1) most models suffer from exponentially increasing computational complexity, making it difficult to scale to large graphs; (2) attention mechanisms based on node-level operations limit the flexibility of the model and result in poor generalization performance in out-of-distribution (OOD) scenarios. To address these issues, we propose VecFormer (the Vec tor Quantized Graph Transformer ), an efficient and highly generalizable model for node classification, particularly under OOD settings. VecFormer adopts a two-stage training paradigm. In the first stage, two codebooks are used to reconstruct the node features and the graph structure, aiming to learn the rich semantic Graph Codes. In the second stage, attention mechanisms are performed at the Graph Token level based on the transformed cross codebook, reducing computational complexity while enhancing the model's generalization capability. Extensive experiments on datasets of various sizes demonstrate that VecFormer outperforms the existing Graph Transformer in both performance and speed.
Jun Xia 0001, Siyuan Li 0002, Yunfan Liu 0002, Yufei Huang 0002, Changxi Chi, Mutian Hong, Zhuoli Ouyang, Chang Yu 0001, Stan Z. Li
WWW8