VLDB 2026 Research / reviewers in the wild / expert
Qinghua Si
dblp:402/2667
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 62% Trustworthy machine learning · 19% Learning paradigms · 19% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network training
continual graph learning |
0.9 | 1 | 2025 | Exploring Rationale Learning for Continual Graph Learning · AAAI 2025 |
Machine learning › Learning paradigms › continual learning
catastrophic forgetting |
0.3 | 1 | 2025 | Exploring Rationale Learning for Continual Graph Learning · AAAI 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.3 | 1 | 2025 | Exploring Rationale Learning for Continual Graph Learning · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
rationale learning · 0.9invariant learning · 0.9graph neural network · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Exploring Rationale Learning for Continual Graph LearningabstractCatastrophic forgetting poses a significant challenge for graph neural networks in continuously updating their knowledge base with data streams. To address this issue, much of the research has focused on node-level continual learning using parameter regularization or rehearsal-based strategies, while little attention given to graph-level tasks. Furthermore, current paradigms for continual graph learning may inadvertently capture spurious correlations for specific tasks through shortcuts, thereby exacerbating the forgetting of previous knowledge when new tasks are introduced. To tackle these challenges, we propose a novel paradigm, Rationale Learning GNN (RL-GNN), for graph-level continual graph learning. Specifically, we harness the invariant learning principle to incorporate environmental interventions into both the current and historical distributions, aiming to uncover rationales by minimizing empirical risk across all environments. The rationale serves as the sole factor guiding the learning process. Therefore, continual graph learning is redefined as capturing these invariant rationales within task sequences, alleviating catastrophic forgetting caused by spurious features. Extensive experiments on real-world datasets with varying task lengths demonstrate the effectiveness of our RL-GNN in continuous knowledge assimilation and reduction of catastrophic forgetting. Lei Song 0013, Qinghua Si, Shihan Guan, Youyong Kong |
AAAI | 3 |