Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Lvhua Wu

dblp:395/6077 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0009-0096-4559ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
Efficient and distributed learning · 46% Trustworthy machine learning · 46% 3D vision · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
1.012026
Representation Optimal Matching for Federated Learning With Noisy Labels in Remote Sensing · IEEE Trans. Mob. Comput. 2026
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
label noise robustness
1.012026
Representation Optimal Matching for Federated Learning With Noisy Labels in Remote Sensing · IEEE Trans. Mob. Comput. 2026
Machine learning › Efficient and distributed learning › federated learning › robust federated learning
noisy label federated learning
1.012026
Representation Optimal Matching for Federated Learning With Noisy Labels in Remote Sensing · IEEE Trans. Mob. Comput. 2026
Machine learning › Trustworthy machine learning
robustness
1.012026
Representation Optimal Matching for Federated Learning With Noisy Labels in Remote Sensing · IEEE Trans. Mob. Comput. 2026
Computer vision › 3D vision › remote sensing
remote sensing image analysis
0.312026
Representation Optimal Matching for Federated Learning With Noisy Labels in Remote Sensing · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

representation alignment · 1.0optimal transport · 1.0class centroid matching · 1.0
YearPublicationVenuePosition
2026 Representation Decorrelation Guided Robust Image Retrieval Against Label Noise
Xuefeng Jiang 0001, Tian Wen, Lvhua Wu, Yuwei Wang 0003, Min Liu 0001
IEEE Trans. Big Data4
2026 Representation Optimal Matching for Federated Learning With Noisy Labels in Remote Sensing
abstract
Remote sensing (RS) applications increasingly operate over distributed infrastructures that integrate space-airground- sea resources with edge intelligence, yet remains challenging to centralize due to geographic dispersion, cross-institution barriers and privacy regulations. Federated learning (FL), a promising privacy-preserving distributed learning paradigm, has garnered wide attention. However, the practical application of FL for RS encounters the issue of label noise stemming from inevitable annotation errors. In this work, we pioneer an early investigation of label noise in distributed RS tasks. We introduce the Federated Representation Optimal Matching (FedROM) framework, which guides robust representation alignment in the presence of noisy labels without requiring auxiliary data or transmitting extra sensitive information. Specifically, FedROM focuses on the robust local updating process, where clients first identify underlying noisy samples from the perspectives of both per-sample loss value and latent representation space. Subsequently, inspired by the optimal transport technique, we adaptively align the latent representations of identified noisy samples with their corresponding closest class centroids with the least representation matching distance, where class centroids are averaged by the latent representations of other relatively clean samples. This reduces the misleading effects caused by noisy samples and guides the model to capture more robust semantic features in the latent representation space. Theoretical analysis proves the robustness and convergence of FedROM. Extensive experiments on two real-world distributed RS datasets covering multi-source domains and varying label noise rates demonstrate the robustness of FedROM against eighteen baseline methods. Meanwhile, FedROM also surpasses its counterparts in conditions of no label noise, narrowing the gap with the centralized training. To facilitate related communities, our code is open-sourced athttps://github.com/Sprinter1999/ROM.
Xuefeng Jiang 0001, Tian Wen, Jinliang Yuan, Huashuo Liu, Lvhua Wu, Yuwei Wang 0003, Min Liu 0001
IEEE Trans. Mob. Comput.7