VLDB 2026 Research / reviewers in the wild / expert
Trong-Binh Nguyen
dblp:398/4187
· DBLP profile ↗
1ranked-venue papers
1as 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 first-author · 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 |
Efficient and distributed learning · 50% Transfer learning and domain adaptation · 25% Representation and self-supervised learning · 25% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation
domain generalization |
0.9 | 1 | 2025 | Federated Domain Generalization with Data-free On-server Matching Gradient · ICLR 2025 |
Machine learning › Representation and self-supervised learning › representation learning › invariant representation learning
domain-invariant representation |
0.9 | 1 | 2025 | Federated Domain Generalization with Data-free On-server Matching Gradient · ICLR 2025 |
Machine learning › Efficient and distributed learning › federated learning › federated transfer learning
federated domain generalization |
0.9 | 1 | 2025 | Federated Domain Generalization with Data-free On-server Matching Gradient · ICLR 2025 |
Machine learning › Efficient and distributed learning
federated learning |
0.9 | 1 | 2025 | Federated Domain Generalization with Data-free On-server Matching Gradient · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
on-server matching gradient · 0.9gradient inner product maximization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Federated Domain Generalization with Data-free On-server Matching GradientabstractDomain Generalization (DG) aims to learn from multiple known source domains a model that can generalize well to unknown target domains. One of the key approaches in DG is training an encoder which generates domain-invariant representations. However, this approach is not applicable in Federated Domain Generalization (FDG), where data from various domains are distributed across different clients. In this paper, we introduce a novel approach, dubbed Federated Learning via On-server Matching Gradient (FedOMG), which can efficiently leverage domain information from distributed domains. Specifically, we utilize the local gradients as information about the distributed models to find an invariant gradient direction across all domains through gradient inner product maximization. The advantages are two-fold: 1) FedOMG can aggregate the characteristics of distributed models on the centralized server without incurring any additional communication cost, and 2) FedOMG is orthogonal to many existing FL/FDG methods, allowing for additional performance improvements by being seamlessly integrated with them. Extensive experimental evaluations on various settings demonstrate the robustness of FedOMG compared to other FL/FDG baselines. Our method outperforms recent SOTA baselines on four FL benchmark datasets (MNIST, EMNIST, CIFAR-10, and CIFAR-100), and three FDG benchmark datasets (PACS, VLCS, and OfficeHome). The reproducible code is publicly available~\footnote[1]{\url{https://github.com/skydvn/fedomg}}. Trong-Binh Nguyen, Duong Minh Nguyen, Jinsun Park, Viet Quoc Pham, Won-Joo Hwang |
ICLR | 1 |