Ruizhi Pu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ruizhi Pu has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Boyu Wang
Western University
4 shared publications - Charles X. Ling
Western University
4 shared publications - Gezheng Xu
Western University, Department of Computer Science, London, N6A 5B7, Ontario, Canada
4 shared publications - Changjian Shui
Vector Institute, Toronto, ON, Canada
3 shared publications - Fan Zhou
Beihang University, Department of Automotive Engineering, Beijing, 100191, China
2 shared publications - Jiaqi Li
Department of Computer Science, Western University, Ontario, London, ON, Canada
2 shared publications
Latest Publications
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3312-3322
FedFMD: Fairness-Driven Adaptive Aggregation in Federated Learning via Mahalanobis Distance
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3312-3322
Open AccessFedFMD: Fairness-Driven Adaptive Aggregation in Federated Learning via Mahalanobis Distance
- 6 March 2025
- Published by Elsevier in Neural Networks
- Vol. 187, 107275
FedELR: When federated learning meets learning with noisy labels
- 6 March 2025
- Published by Elsevier in Neural Networks
- Vol. 187, 107275
FedELR: When federated learning meets learning with noisy labels
- 30 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 47 (5) , 4007-4023
Unraveling the Mysteries of Label Noise in Source-Free Domain Adaptation: Theory and Practice
Recent source-free domain adaptation (SFDA) methods have focused on learning meaningful cluster structures in feature space, successfully adapting the knowledge from the source domain to the unlabeled target domain without accessing the private source data. However, existing methods rely on pseudo-labels generated by source models that can be noisy due to domain shift, presenting a significant challenge to their efficacy. In this paper, we study SFDA from the perspective of learning with label noise (LLN) and prove that the label noise in SFDA, unlike in conventional LLN scenarios, follows a different distribution assumption. This discrepancy renders some existing LLN methods less effective in SFDA. To address this issue and comprehensively improve adaptation performance, we tackle label noise in SFDA from two perspectives. First, we demonstrate that the early-time training phenomenon (ETP), previously observed in LLN settings, still exists in SFDA. Hence, we introduce a simple yet effective approach to leveraging ETP to improve current SFDA algorithms. Second, we propose a noise and variance control module, mitigating the label noise discrepancy between SFDA and LLN and enhancing the effectiveness of LLN methods in SFDA. Extensive empirical evaluation and analysis of four benchmarks show that our methods substantially outperform existing baselines.
- 30 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 47 (5) , 4007-4023
Unraveling the Mysteries of Label Noise in Source-Free Domain Adaptation: Theory and Practice
Recent source-free domain adaptation (SFDA) methods have focused on learning meaningful cluster structures in feature space, successfully adapting the knowledge from the source domain to the unlabeled target domain without accessing the private source data. However, existing methods rely on pseudo-labels generated by source models that can be noisy due to domain shift, presenting a significant challenge to their efficacy. In this paper, we study SFDA from the perspective of learning with label noise (LLN) and prove that the label noise in SFDA, unlike in conventional LLN scenarios, follows a different distribution assumption. This discrepancy renders some existing LLN methods less effective in SFDA. To address this issue and comprehensively improve adaptation performance, we tackle label noise in SFDA from two perspectives. First, we demonstrate that the early-time training phenomenon (ETP), previously observed in LLN settings, still exists in SFDA. Hence, we introduce a simple yet effective approach to leveraging ETP to improve current SFDA algorithms. Second, we propose a noise and variance control module, mitigating the label noise discrepancy between SFDA and LLN and enhancing the effectiveness of LLN methods in SFDA. Extensive empirical evaluation and analysis of four benchmarks show that our methods substantially outperform existing baselines.
- 18 May 2023
- Published by Elsevier in Knowledge-Based Systems
- Vol. 274, 110616
Label shift conditioned hybrid querying for deep active learning
- 18 May 2023
- Published by Elsevier in Knowledge-Based Systems
- Vol. 274, 110616
Label shift conditioned hybrid querying for deep active learning
- 13 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (10) , 10140-10150
Towards More General Loss and Setting in Unsupervised Domain Adaptation
In this article, we present an analysis of unsupervised domain adaptation with a series of theoretical and algorithmic results. We derive a novel Rényi-$\alpha$ divergence-based generalization bound, which is tailored to domain adaptation algorithms with arbitrary loss functions in a stochastic setting. Moreover, our theoretical results provide new insights into the assumptions for successful domain adaptation: the closeness between the conditional distributions of the domains and the Lipschitzness on the source domain. With these assumptions, we reveal the following: if their conditional generation distributions are close, the Lipschitzness property of the target domain can be transferred from the Lipschitzness on the source domain, without knowing the exact target distribution. Motivated by our analysis and assumptions, we further derive practical principles for deep domain adaptation: 1) Rényi-2 adversarial training for marginal distributions matching and 2) Lipschitz regularization for the classifier. Our experimental results on both synthetic and real-world datasets support our theoretical findings and the practical efficiency of the proposed principles.- 13 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (10) , 10140-10150
Towards More General Loss and Setting in Unsupervised Domain Adaptation
In this article, we present an analysis of unsupervised domain adaptation with a series of theoretical and algorithmic results. We derive a novel Rényi-$\alpha$ divergence-based generalization bound, which is tailored to domain adaptation algorithms with arbitrary loss functions in a stochastic setting. Moreover, our theoretical results provide new insights into the assumptions for successful domain adaptation: the closeness between the conditional distributions of the domains and the Lipschitzness on the source domain. With these assumptions, we reveal the following: if their conditional generation distributions are close, the Lipschitzness property of the target domain can be transferred from the Lipschitzness on the source domain, without knowing the exact target distribution. Motivated by our analysis and assumptions, we further derive practical principles for deep domain adaptation: 1) Rényi-2 adversarial training for marginal distributions matching and 2) Lipschitz regularization for the classifier. Our experimental results on both synthetic and real-world datasets support our theoretical findings and the practical efficiency of the proposed principles.