VLDB 2026 Research / reviewers in the wild / expert
Ziyue Xu 0002
dblp:59/9160-2
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0003-2797-4596ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 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
2 papers |
Efficient and distributed learning · 46% Graph learning · 27% Trustworthy machine learning · 27% | |
| Computer networks
1 paper |
Edge and fog computing · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
1.0 | 1 | 2026 | FedBRB: A Solution to the Small-to-Large Scenario in Device-Heterogeneity Federated Learning · IEEE Trans. Mob. Comput. 2026 |
Machine learning › Efficient and distributed learning › distributed training
large model training |
1.0 | 1 | 2026 | FedBRB: A Solution to the Small-to-Large Scenario in Device-Heterogeneity Federated Learning · IEEE Trans. Mob. Comput. 2026 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.6 | 1 | 2022 | Robust Tensor Graph Convolutional Networks via T-SVD based Graph Augmentation · KDD 2022 |
Machine learning › Graph learning
graph augmentation |
0.6 | 1 | 2022 | Robust Tensor Graph Convolutional Networks via T-SVD based Graph Augmentation · KDD 2022 |
Machine learning › Graph learning
graph neural network |
0.6 | 1 | 2022 | Robust Tensor Graph Convolutional Networks via T-SVD based Graph Augmentation · KDD 2022 |
Machine learning › Trustworthy machine learning
robustness |
0.6 | 1 | 2022 | Robust Tensor Graph Convolutional Networks via T-SVD based Graph Augmentation · KDD 2022 |
Edge and fog computing
edge devices |
0.3 | 1 | 2026 | FedBRB: A Solution to the Small-to-Large Scenario in Device-Heterogeneity Federated Learning · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
weighted broadcast · 2.0block-wise rolling · 2.0tensor GCN · 0.6multi-view augmentation · 0.6T-SVD · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | FedBRB: A Solution to the Small-to-Large Scenario in Device-Heterogeneity Federated LearningabstractRecently, the success of large models has demonstrated the importance of scaling up model sizes. However, it is difficult to directly train large models locally on multiple mobile devices due to their intrinsic computational constraints. To address this challenge, it becomes a crucial need to train larger global models by training small local models on devices. As a distributed learning approach, federated learning (FL) allows multiple devices to train models locally and aggregate them to form the global model by sharing the updated parameters with the server, thus enabling the co-training of models. This promising feature has spurred an increasing interest in exploring the collaborative training of large models. Despite the advent of existing device-heterogeneity FL approaches, they still have limitations in fully covering the parameter space of the global model. To fill this gap, we propose a novel approach calledFedBRB(Block- wiseRolling and weightedBroadcast). The core idea of FedBRB is to utilize local models of small devices to train all modules of a large global model and broadcast the trained parameters to the entire space, thereby enabling faster information sharing. This approach not only improves training efficiency but also fully utilizes limited computational resources. Experiments demonstrate that FedBRB can produce significant performance gains, achieving state-of-the-art results. Additionally, this paper provides theoretical and experimental analyses of FedBRB convergence, thereby paving a theoretical ground and providing practical guidance for further research and application of the FedBRB method. Tianchi Liao, Ziyue Xu 0002, Qing Hu 0008, Hongning Dai, Huaiwei Huang, Zibin Zheng, Chuan Chen 0001 |
IEEE Trans. Mob. Comput. | 2 |
| 2024 | FedGL: Federated graph learning framework with global self-supervision
Chuan Chen 0001, Ziyue Xu 0002, Weibo Hu, Zibin Zheng |
Inf. Sci. | 2 |
| 2022 | Robust Tensor Graph Convolutional Networks via T-SVD based Graph AugmentationabstractGraph Neural Networks (GNNs) have exhibited their powerful ability of tackling nontrivial problems on graphs. However, as an extension of deep learning models to graphs, GNNs are vulnerable to noise or adversarial attacks due to the underlying perturbations propagating in message passing scheme, which can affect the ultimate performances dramatically. Thus, it's vital to study a robust GNN framework to defend against various perturbations. In this paper, we propose a Robust Tensor Graph Convolutional Network (RT-GCN) model to improve the robustness. On the one hand, we utilize multi-view augmentation to reduce the augmentation variance and organize them as a third-order tensor, followed by the truncated T-SVD to capture the low-rankness of the multi-view augmented graph, which improves the robustness from the perspective of graph preprocessing. On the other hand, to effectively capture the inter-view and intra-view information on the multi-view augmented graph, we propose tensor GCN (TGCN) framework and analyze the mathematical relationship between TGCN and vanilla GCN, which improves the robustness from the perspective of model architecture. Extensive experimental results have verified the effectiveness of RT-GCN on various datasets, demonstrating the superiority to the state-of-the-art models on diverse adversarial attacks for graphs. Zhebin Wu, Ziyue Xu 0002, Yaomin Chang, Chuan Chen 0001, Zibin Zheng |
KDD | 3 |