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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiangkun Wu

dblp:384/0420 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0009-3999-2135ORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Reinforcement learning · 63% Deep learning architectures and training · 28% Probabilistic and Bayesian machine learning · 10%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › offline reinforcement learning
pessimistic policy learning
0.912025
Pessimistic Data Integration for Policy Evaluation · NeurIPS 2025
Machine learning › Reinforcement learning
policy learning
0.912025
Pessimistic Data Integration for Policy Evaluation · NeurIPS 2025
Computational social science and digital humanities
causal inference
0.912025
Pessimistic Data Integration for Policy Evaluation · NeurIPS 2025
Computational social science and digital humanities › public policy
policy evaluation
0.912025
Pessimistic Data Integration for Policy Evaluation · NeurIPS 2025
Machine learning › Deep learning architectures and training
feature interaction
0.812024
Rotative Factorization Machines · KDD 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal effect estimation
0.312025
Pessimistic Data Integration for Policy Evaluation · NeurIPS 2025
Recommender systems
click-through rate prediction
0.212024
Rotative Factorization Machines · KDD 2024

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

weighted estimator · 1.7pessimistic policy learning · 1.7mean squared error minimization · 1.7factorization machines · 1.5
YearPublicationVenuePosition
2025 Pessimistic Data Integration for Policy Evaluation
abstract
This paper studies how to integrate historical control data with experimental data to enhance A/B testing, while addressing the distributional shift between historical and experimental datasets. We propose a pessimistic data integration method that combines two causal effect estimators constructed based on experimental and historical datasets. Our main idea is to conceptualize the weight function for this combination as a policy so that existing pessimistic policy learning algorithms are applicable to learn the optimal weight that minimizes the resulting weighted estimator's mean squared error. Additionally, we conduct comprehensive theoretical and empirical analyses to compare our method against various baseline estimators across five scenarios. Both our theoretical and numerical findings demonstrate that the proposed estimator achieves near-optimal performance across all scenarios.
Xiangkun Wu, Gholamali Aminian, Armin Behnamnia, Hamid R. Rabiee 0001, Chengchun Shi
NeurIPS1
2024 Rotative Factorization Machines
abstract
Feature interaction learning (FIL) focuses on capturing the complex relationships among multiple features for building predictive models, which is widely used in real-world tasks. Despite the research progress, existing FIL methods suffer from two major limitations. Firstly, they mainly model the feature interactions within a bounded order (e.g., small integer order) due to the exponential growth of the interaction terms. Secondly, the interaction order of each feature is often independently learned, which lacks the flexibility to capture the feature dependencies in varying contexts.
Zhen Tian 0001, Xiangkun Wu, Wayne Xin Zhao, Ji-Rong Wen
KDD3