VLDB 2026 Research / reviewers in the wild / expert
Jie Sun 0030
dblp:54/5330-30
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0006-2202-3272ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 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
2 papers |
Multi-agent systems · 33% Graph learning · 29% Trustworthy machine learning · 29% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems
autonomous agents |
1.0 | 1 | 2026 | AgencyBench: Benchmarking the Frontiers of Autonomous Agents in 1M-Token Real-World Contexts · ACL (1) 2026 |
Machine learning › Graph learning
graph classification |
0.9 | 1 | 2025 | A Unified Invariant Learning Framework for Graph Classification · KDD (1) 2025 |
Machine learning › Trustworthy machine learning › out-of-distribution generalization
invariant learning |
0.9 | 1 | 2025 | A Unified Invariant Learning Framework for Graph Classification · KDD (1) 2025 |
Natural language and speech › Language models and text generation
agent benchmarking |
0.3 | 1 | 2026 | AgencyBench: Benchmarking the Frontiers of Autonomous Agents in 1M-Token Real-World Contexts · ACL (1) 2026 |
Methods — techniques the papers use, named apart from their topics
benchmark construction · 1.0invariant learning · 0.9graph neural network · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | AgencyBench: Benchmarking the Frontiers of Autonomous Agents in 1M-Token Real-World ContextsabstractKeyu Li, Junhao Shi, Yang Xiao, Mohan Jiang, Jie Sun, Yunze Wu, Dayuan Fu, Shijie Xia, Xiaojie Cai, Tianze Xu, Weiye Si, Wenjie Li, Dequan Wang, Pengfei Liu. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Junhao Shi, Mohan Jiang, Jie Sun 0030, Yunze Wu, Dayuan Fu, Shijie Xia, Xiaojie Cai, Weiye Si, Wenjie Li 0002, Dequan Wang, Pengfei Liu 0003 |
ACL (1) | 5 |
| 2025 | A Unified Invariant Learning Framework for Graph Classification
Yongduo Sui, Jie Sun 0030, Shuyao Wang, Qing Cui, Xiang Wang 0010 |
KDD (1) | 2 |
| 2025 | A Simple Data Augmentation for Graph Classification: A Perspective of Equivariance and InvarianceabstractIn graph classification, the out-of-distribution (OOD) issue is attracting great attention. To address this issue, a prevailing idea is to learn stable features, on the assumption that they are substructures causally determining the label and that their relationship with the label is stable to the distributional uncertainty. In contrast, the complementary parts termed environmental features, fail to determine the label solely and hold varying relationships with the label, thus ascribed to the possible reason for the distribution shift. Existing generalization efforts mainly encourage the model’s insensitivity to environmental features. While the sensitivity to stable features is promising to distinguish the crucial clues from the distributional uncertainty but largely unexplored. A paradigm of simultaneously exploring the sensitivity to stable features and insensitivity to environmental features is until-now lacking to achieve the generalizable graph classification, to the best of our knowledge. In this work, we conjecture that generalizable models should be sensitive to stable features and insensitive to environmental features. To this end, we propose a simple yet effective augmentation strategy for graph classification: Equivariant and Invariant Cross-Data Augmentation (EI-CDA). By employing equivariance, given a pair of input graphs, we first estimate their stable and environmental features via masks. Then, we linearly mix the estimated stable features of two graphs and encourage the model predictions faithfully reflect their mixed semantics. Meanwhile, by using invariance, we swap the estimated environmental features of two graphs and keep the predictions invariant. This simple yet effective strategy endows the models with both sensitivity to stable features and insensitivity to environmental features. Extensive experiments show that EI-CDA significantly improves performance and outperforms leading baselines. Our codes are available at: https://github.com/yongduosui/EI-GNN . Yongduo Sui, Shuyao Wang, Jie Sun 0030, Zhiyuan Liu 0010, Qing Cui, Jun Zhou 0011, Xiang Wang 0010, Xiangnan He 0001 |
ACM Trans. Knowl. Discov. Data | 3 |