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

Shuxi Zeng

dblp:267/5354 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2021
—ORCID · unresolved

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 first-author · 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
Trustworthy machine learning · 50% Transfer learning and domain adaptation · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › knowledge transfer
causal transfer
0.512021
Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust Prediction · WSDM 2021
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift
0.512021
Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust Prediction · WSDM 2021
Computational social science and digital humanities › marketing
advertising
0.512021
Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust Prediction · WSDM 2021

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

random forest · 1.0counterfactual optimization · 1.0causal inference · 1.0
YearPublicationVenuePosition
2021 Counterfactual Representation Learning with Balancing Weights
abstract
A key to causal inference with observational data is achieving balance in predictive features associated with each treatment type. Recent literature has explored representation learning to achieve this goal. In this work, we discuss the pitfalls of these strategies – such as a steep trade-off between achieving balance and predictive power – and present a remedy via the integration of balancing weights in causal learning. Specifically, we theoretically link balance to the quality of propensity estimation, emphasize the importance of identifying a proper target population, and elaborate on the complementary roles of feature balancing and weight adjustments. Using these concepts, we then develop an algorithm for flexible, scalable and accurate estimation of causal effects. Finally, we show how the learned weighted representations may serve to facilitate alternative causal learning procedures with appealing statistical features. We conduct an extensive set of experiments on both synthetic examples and standard benchmarks, and report encouraging results relative to state-of-the-art baselines.
Serge Assaad, Shuxi Zeng, Chenyang Tao, Shounak Datta, Nikhil Mehta 0002, Ricardo Henao, Lawrence Carin
AISTATS2
2021 Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust Prediction
abstract
It is often critical for prediction models to be robust to distributional shifts between training and testing data. From a causal perspective, the challenge is to distinguish the stable causal relationships from the unstable spurious correlations across shifts. We describe a causal transfer random forest (CTRF) that combines existing training data with a small amount of data from a randomized experiment to train a model which is robust to the feature shifts and therefore transfers to a new targeting distribution. Theoretically, we justify the robustness of the approach against feature shifts with the knowledge from causal learning. Empirically, we evaluate the CTRF using both synthetic data experiments and real-world experiments in the Bing Ads platform, including a click prediction task and in the context of an end-to-end counterfactual optimization system. The proposed CTRF produces robust predictions and outperforms most baseline methods compared in the presence of feature shifts.
Shuxi Zeng, Murat Ali Bayir, Joseph J. Pfeiffer III, Denis Charles, Emre Kiciman
WSDM1