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

Ye Tu

dblp:234/8858 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2023
0009-0009-7509-4746ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1

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.

Databases, data mining, and information retrieval
2 papers
Data mining · 28% Information retrieval · 28% Recommender systems · 22%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Theoretical computer science
2 papers
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
causal inference
0.512021
Personalized Treatment Selection using Causal Heterogeneity · WWW 2021
Information retrieval › user interaction
personalization
0.512021
Personalized Treatment Selection using Causal Heterogeneity · WWW 2021
Computational social science and digital humanities
causal inference
0.412020
A/B Testing in Dense Large-Scale Networks: Design and Inference · NeurIPS 2020
Computational social science and digital humanities › causal inference
network interference
0.412020
A/B Testing in Dense Large-Scale Networks: Design and Inference · NeurIPS 2020
Mathematical optimization
experimental design
0.412020
A/B Testing in Dense Large-Scale Networks: Design and Inference · NeurIPS 2020
Web and social media mining
social media analysis
0.412019
Feedback Shaping: A Modeling Approach to Nurture Content Creation · KDD 2019
Mathematical optimization
constrained optimization
0.112021
Personalized Treatment Selection using Causal Heterogeneity · WWW 2021

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

a/b testing · 1.4causal inference · 1.0randomized controlled experiment · 0.9importance sampling · 0.9feedback modeling · 0.4
YearPublicationVenuePosition
2023 Generalized Causal Tree for Uplift Modeling
abstract
Uplift modeling is crucial in various applications ranging from marketing and policy-making to personalized recommendations. The main objective is to learn optimal treatment allocations for a heterogeneous population. A primary line of existing work modifies the loss function of the decision tree algorithm to identify cohorts with heterogeneous treatment effects. Another line of work estimates the individual treatment effects separately for the treatment group and the control group using off-the-shelf supervised learning algorithms. The former approach that directly models the heterogeneous treatment effect is known to outperform the latter in practice. However, the existing tree-based methods are mostly limited to a single treatment and a single control use case, except for a handful of extensions to multiple discrete treatments. In this paper, we propose a generalization of tree-based approaches to tackle multiple discrete and continuous-valued treatments. We focus on a generalization of the well-known causal tree algorithm due to its desirable statistical properties, but our generalization technique can be applied to other tree-based approaches as well. The efficacy of our proposed method is demonstrated using experiments and real data examples.
Preetam Nandy, Xiufan Yu, Wanjun Liu, Ye Tu, Kinjal Basu 0001, Shaunak Chatterjee
IEEE Big Data4
2021 Personalized Treatment Selection using Causal Heterogeneity
abstract
Randomized experimentation (also known as A/B testing or bucket testing) is widely used in the internet industry to measure the metric impact obtained by different treatment variants. A/B tests identify the treatment variant showing the best performance, which then becomes the chosen or selected treatment for the entire population. However, the effect of a given treatment can differ across experimental units and a personalized approach for treatment selection can greatly improve upon the usual global selection strategy. In this work, we develop a framework for personalization through (i) estimation of heterogeneous treatment effect at either a cohort or member-level, followed by (ii) selection of optimal treatment variants for cohorts (or members) obtained through (deterministic or stochastic) constrained optimization.
Ye Tu, Kinjal Basu 0001, Cyrus DiCiccio, Romil Bansal, Preetam Nandy, Padmini Jaikumar, Shaunak Chatterjee
WWW1
2020 A/B Testing in Dense Large-Scale Networks: Design and Inference
abstract
Design of experiments and estimation of treatment effects in large-scale networks, in the presence of strong interference, is a challenging and important problem. Most existing methods' performance deteriorates as the density of the network increases. In this paper, we present a novel strategy for accurately estimating the causal effects of a class of treatments in a dense large-scale network. First, we design an approximate randomized controlled experiment by solving an optimization problem to allocate treatments in the presence of competition among neighboring nodes. Then we apply an importance sampling adjustment to correct for any leftover bias (from the approximation) in estimating average treatment effects. We provide theoretical guarantees, verify robustness in a simulation study, and validate the scalability and usefulness of our procedure in a real-world experiment on a large social network.
Preetam Nandy, Kinjal Basu 0001, Shaunak Chatterjee, Ye Tu
NeurIPS4
2019 The trails of Just Cause 2: spatio-temporal player profiling in open-world games
abstract
Behavioral profiling of players in digital games is a key challenge in game analytics, representing a particular challenge in Open-World Games. These games are characterized by large virtual worlds and few restrictions on player affordances. In these games, incorporating the spatial and temporal dimensions of player behavior is necessary when profiling behavior, as these dimensions are important to the playing experience. We present analyses that apply cluster analysis and the DEDICOM decompositional model to profile the behavior of more than 5,000 players of the major commercial title Just Cause 2 integrating both spatio-temporal trails and behavioral metrics. The application of DEDICOM to profile the spatio-temporal behavior of players is demonstrated for the purpose of analysing the entire play history of Just Cause 2 players, but also for the more detailed analysis of a single mission. This showcases the applicability of spatio-temporal profiling to condense player behavior across large sample sizes, across different scales of investigation. The method presented here provides a means to build profiles of player activity in game environments with high degrees of freedom across different scales of analysis - from a small segment to the entire game.
Myat Aung, Simon Demediuk, Ye Tu, Yu Ang, Siva Nekkanti, Shantanu Raghav, Diego Klabjan, Rafet Sifa, Anders Drachen
FDG4
2019 Feedback Shaping: A Modeling Approach to Nurture Content Creation
abstract
Social media platforms bring together content creators and content consumers through recommender systems like newsfeed. The focus of such recommender systems has thus far been primarily on modeling the content consumer preferences and optimizing for their experience. However, it is equally critical to nurture content creation by prioritizing the creators' interests, as quality content forms the seed for sustainable engagement and conversations, bringing in new consumers while retaining existing ones. In this work, we propose a modeling approach to predict how feedback from content consumers incentivizes creators. We then leverage this model to optimize the newsfeed experience for content creators by reshaping the feedback distribution, leading to a more active content ecosystem. Practically, we discuss how we balance the user experience for both consumers and creators, and how we carry out online A/B tests with strong network effects. We present a deployed use case on the LinkedIn newsfeed, where we used this approach to improve content creation significantly without compromising the consumers' experience.
Ye Tu, Chun Lo, Shaunak Chatterjee
KDD1