VLDB 2026 Research / reviewers in the wild / expert
Hongbin Lai
dblp:421/0354
· 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 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 · 75% Efficient and distributed learning · 25% |
Topics — the 4 heaviest of 4, 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 | Efficient Graph Continual Learning via Lightweight Graph Neural Tangent Kernels-based Dataset Distillation · ICML 2025 |
Machine learning › Efficient and distributed learning
dataset distillation |
0.9 | 1 | 2025 | Efficient Graph Continual Learning via Lightweight Graph Neural Tangent Kernels-based Dataset Distillation · ICML 2025 |
Machine learning › Graph learning › graph neural network training › graph distillation
graph dataset distillation |
0.9 | 1 | 2025 | Efficient Graph Continual Learning via Lightweight Graph Neural Tangent Kernels-based Dataset Distillation · ICML 2025 |
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Efficient Graph Continual Learning via Lightweight Graph Neural Tangent Kernels-based Dataset Distillation · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
low-rank approximation · 0.9graph neural tangent kernel · 0.9bernoulli sampling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Efficient Graph Continual Learning via Lightweight Graph Neural Tangent Kernels-based Dataset DistillationabstractGraph Neural Networks (GNNs) have emerged as a fundamental tool for modeling complex graph structures across diverse applications.
However, directly applying pretrained GNNs to varied downstream tasks without fine-tuning-based continual learning remains challenging, as this approach incurs high computational costs and hinders the development of Large Graph Models (LGMs).
In this paper, we investigate an efficient and generalizable dataset distillation framework for Graph Continual Learning (GCL) across multiple downstream tasks, implemented through a novel Lightweight Graph Neural Tangent Kernel (LIGHTGNTK).
Specifically, LIGHTGNTK employs a low-rank approximation of the Laplacian matrix via Bernoulli sampling and linear association within the GNTK. This design enables efficient capture of both structural and feature relationships while supporting gradient-based dataset distillation.
Additionally, LIGHTGNTK incorporates a unified subgraph anchoring strategy, allowing it to handle graph-level, node-level, and edge-level tasks under diverse input structures.
Comprehensive experiments on several datasets show that LIGHTGNTK achieves state-of-the-art performance in GCL scenarios, promoting the development of adaptive and scalable LGMs. Rihong Qiu, Xinke Jiang, Yuchen Fang 0001, Hongbin Lai, Hao Miao 0001, Junfeng Zhao 0001, Yasha Wang |
ICML | 4 |