EDBT 2026 Demo / reviewers in the wild / expert
Shu Ding
dblp:168/7429
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers |
Efficient and distributed learning · 91% Optimization for machine learning · 9% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
0.9 | 1 | 2025 | Enhancing the Performance of Global Model by Improving the Adaptability of Local Models in Federated Learning · IJCAI 2025 |
Machine learning › Efficient and distributed learning › federated learning
client clustering |
0.6 | 1 | 2022 | Collaborative Learning by Detecting Collaboration Partners · NeurIPS 2022 |
Machine learning › Efficient and distributed learning
collaborative learning |
0.6 | 1 | 2022 | Collaborative Learning by Detecting Collaboration Partners · NeurIPS 2022 |
Machine learning › Efficient and distributed learning
federated and distributed training |
0.6 | 1 | 2022 | Collaborative Learning by Detecting Collaboration Partners · NeurIPS 2022 |
Machine learning › Optimization for machine learning
distributed optimization |
0.3 | 1 | 2025 | Enhancing the Performance of Global Model by Improving the Adaptability of Local Models in Federated Learning · IJCAI 2025 |
Methods — techniques the papers use, named apart from their topics
local training objective · 0.9constraint optimization · 0.9model approximation · 0.6collaboration partner detection · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Enhancing the Performance of Global Model by Improving the Adaptability of Local Models in Federated LearningabstractFederated learning enables the clients to collaboratively train a global model, which is aggregated from local models. Due to the heterogeneous data distributions over clients and data privacy in federated learning, it is difficult to train local models to achieve a well-performed global model. In this paper, we introduce the adaptability of local models, i.e., the average performance of local models on data distributions over clients, and enhance the performance of the global model by improving the adaptability of local models. Since each client does not know the data distributions over other clients, the adaptability of the local model cannot be directly optimized. First, we provide the property of an appropriate local model which has good adaptability on the data distributions over clients. Then, we formalize the property into the local training objective with a constraint and propose a feasible solution to train the local model. Extensive experiments on federated learning benchmarks demonstrate that our method significantly improves the adaptability of local models and achieves a well-performed global model that consistently outperforms the baseline methods. Wujun Zhou, Shu Ding |
IJCAI | 2 |
| 2022 | Collaborative Learning by Detecting Collaboration PartnersabstractMassive amounts of data are naturally dispersed over different clients in many real-world applications, collaborative learning has been a promising paradigm that allows to learn models through collaboration among the clients. However, leveraging these dispersed data to learn good models is still challenging since data over different clients are heterogeneous. Previous works mainly focus on learning the centralized model for all clients or learning a personalized model for each client. When there are numerous clients, the centralized model performs badly on some clients, while learning a personalized model for each client costs unaffordable computational resources. In this paper, we propose the collaborative learning method to detect collaboration partners and adaptively learn $K$ models for numerous heterogeneous clients. We theoretically prove that the model learned for each client is a good approximation of its personalized model. Experimental results on real-world datasets verify the effectiveness of our method. Shu Ding |
NeurIPS | 1 |