Zhaoqing Tian

dblp:397/6230 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Reinforcement learning · 75% Transfer learning and domain adaptation · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › domain shift
covariate shift
0.912025
Optimal Policy Adaptation Under Covariate Shift · IJCAI 2025
Machine learning › Reinforcement learning › off-policy evaluation
doubly robust estimation
0.912025
Optimal Policy Adaptation Under Covariate Shift · IJCAI 2025
Machine learning › Reinforcement learning
policy learning
0.912025
Optimal Policy Adaptation Under Covariate Shift · IJCAI 2025
Machine learning › Reinforcement learning
semiparametric efficient estimation
0.912025
Optimal Policy Adaptation Under Covariate Shift · IJCAI 2025

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

sensitivity analysis · 0.9semiparametric efficiency bound · 0.9efficient influence function · 0.9
YearPublicationVenuePosition
2025 Optimal Policy Adaptation Under Covariate Shift
abstract
Transfer learning of prediction models has been extensively studied, while the corresponding policy learning approaches are rarely discussed. In this paper, we propose principled approaches for learning the optimal policy in the target domain by leveraging two datasets: one with full information from the source domain and the other from the target domain with only covariates. First, in the setting of covariate shift, we formulate the problem from a perspective of causality and present the identifiability assumptions for the reward induced by a given policy. Then, we derive the efficient influence function and the semiparametric efficiency bound for the reward. Based on this, we construct a doubly robust and semiparametric efficient estimator for the reward and then learn the optimal policy by optimizing the estimated reward. Moreover, we theoretically analyze the bias and the generalization error bound for the learned policy. Furthermore, in the presence of both covariate and concept shifts, we propose a novel sensitivity analysis method to evaluate the robustness of the proposed policy learning approach. Extensive experiments demonstrate that the approach not only estimates the reward more accurately but also yields a policy that closely approximates the theoretically optimal policy.
Qinwei Yang, Zhaoqing Tian, Ruocheng Guo, Peng Wu 0012
IJCAI3