Ruizhi Pu

Ruizhi Pu

Auto-generated profile, based on publicly available information

Ruizhi Pu

Western University, London, Ontario, Canada

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 January 2025 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
GXGezheng Xu
Gezheng Xu
LYLi Yi
Li Yi
PXPengcheng Xu
Pengcheng Xu
JLJiaqi Li
Jiaqi Li
RPRuizhi Pu
Ruizhi Pu
CLCharles Ling
Charles Ling
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.

6 March 2025 in Neural Networks
Verified
Journal Article
Closed access
RPRuizhi Pu
Ruizhi Pu
LYLixing Yu
Lixing Yu
SZShaojie Zhan
Shaojie Zhan
GXGezheng Xu
Gezheng Xu
FZFan Zhou
Fan Zhou
BWBoyu Wang
Boyu Wang

13 April 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CSChangjian Shui
Changjian Shui
RPRuizhi Pu
Ruizhi Pu
GXGezheng Xu
Gezheng Xu
JWJun Wen
Jun Wen
FZFan Zhou
Fan Zhou
BWBoyu Wang
Boyu Wang
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.

18 May 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JLJiaqi Li
Jiaqi Li
Haojia KongHaojia Kong
Haojia Kong
GXGezheng Xu
Gezheng Xu
CSChangjian Shui
Changjian Shui
RPRuizhi Pu
Ruizhi Pu
BWBoyu Wang
Boyu Wang