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

Ted Tao Yuan

dblp:52/9908 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 5 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 3 · 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.

Databases, data mining, and information retrieval
3 papers
Information retrieval · 81% Recommender systems · 10% Data mining · 9%
Human-computer interaction and pervasive computing
1 paper
Usability and user experience research · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
retrieval evaluation
0.712023
Examining User Heterogeneity in Digital Experiments · ACM Trans. Inf. Syst. 2023
Usability and user experience research
user modeling
0.712023
Examining User Heterogeneity in Digital Experiments · ACM Trans. Inf. Syst. 2023
Information retrieval › query reformulation
query expansion
0.312018
Merchandise Recommendation for Retail Events with Word Embedding Weighted Tf-idf and Dynamic Query Expansion · SIGIR 2018
Information retrieval › retrieval models
ranked retrieval
0.312018
Merchandise Recommendation for Retail Events with Word Embedding Weighted Tf-idf and Dynamic Query Expansion · SIGIR 2018
Information retrieval › ranking › text ranking
tf-idf ranking
0.312018
Merchandise Recommendation for Retail Events with Word Embedding Weighted Tf-idf and Dynamic Query Expansion · SIGIR 2018
Data mining › causal inference
online controlled experiments
0.212023
Examining User Heterogeneity in Digital Experiments · ACM Trans. Inf. Syst. 2023
Recommender systems
conversion rate prediction
0.112011
Predicting eBay listing conversion · SIGIR 2011
Information retrieval › ranking
search ranking
0.112011
Predicting eBay listing conversion · SIGIR 2011

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

double machine learning · 1.3causal inference · 1.3a/b testing · 1.3word embedding similarity · 0.3tf-idf weighting · 0.3click-through data modeling · 0.1
YearPublicationVenuePosition
2023 Examining User Heterogeneity in Digital Experiments
abstract
Digital experiments are routinely used to test the value of a treatment relative to a status quo control setting — for instance, a new search relevance algorithm for a website or a new results layout for a mobile app. As digital experiments have become increasingly pervasive in organizations and a wide variety of research areas, their growth has prompted a new set of challenges for experimentation platforms. One challenge is that experiments often focus on the average treatment effect (ATE) without explicitly considering differences across major sub-groups — heterogeneous treatment effect (HTE). This is especially problematic because ATEs have decreased in many organizations as the more obvious benefits have already been realized. However, questions abound regarding the pervasiveness of user HTEs and how best to detect them. We propose a framework for detecting and analyzing user HTEs in digital experiments. Our framework combines an array of user characteristics with double machine learning. Analysis of 27 real-world experiments spanning 1.76 billion sessions and simulated data demonstrates the effectiveness of our detection method relative to existing techniques. We also find that transaction, demographic, engagement, satisfaction, and lifecycle characteristics exhibit statistically significant HTEs in 10% to 20% of our real-world experiments, underscoring the importance of considering user heterogeneity when analyzing experiment results, otherwise personalized features and experiences cannot happen, thus reducing effectiveness. In terms of the number of experiments and user sessions, we are not aware of any study that has examined user HTEs at this scale. Our findings have important implications for information retrieval, user modeling, platforms, and digital experience contexts, in which online experiments are often used to evaluate the effectiveness of design artifacts.
Sriram Somanchi, Ahmed Abbasi, Ken Kelley, David G. Dobolyi, Ted Tao Yuan
ACM Trans. Inf. Syst.5
2022 Ensure A/B Test Quality at Scale with Automated Randomization Validation and Sample Ratio Mismatch Detection
abstract
eBay's experimentation platform runs hundreds of A/B tests on any given day. The platform integrates with the tracking infrastructure and customer experience servers, provides the sampling service for experiments, and has the responsibility to monitor the progress of each A/B test. There are many challenges especially when it is required to ensure experiment quality at the large scale. We discuss two automated test quality monitoring processes and methodologies, namely randomization validation using population stability index (PSI) and sample ratio mismatch (a.k.a. sample delta) detection using sequential analysis. The automated processes assist the experimentation platform to run high quality and trustworthy tests not only effectively on a large scale, but also efficiently by minimizing false positive monitoring alarms to experimenters.
Keyu Nie, Bingquan Xu, Ted Tao Yuan
CIKM4
2020 Efficient Multivariate Bandit Algorithm with Path Planning
abstract
We solve the arms exponential exploding issues in the Multivariate-MAB when the arm dimension hierarchy is considered. We propose a framework called path planning, which utilizes paths in a graph to model reward success rate with m-way dimension interaction and adopts Thompson Sampling (TS) for a heuristic search. It is straightforward to combat the curse of dimensionality using a serial process that operates sequentially by focusing on one dimension per each process. Our proposed method utilizing tree models has advantages comparing with traditional models such as general linear regression. Real data and simulation studies validate our claim by achieving faster convergence speed, better efficient optimal arm allocation, and lower cumulative regret.
Keyu Nie, Ted Tao Yuan, Rong Song, Pauline Berry Burke
ICTAI3
2020 Dealing with Ratio Metrics in A/B Testing at the Presence of Intra-user Correlation and Segments
Keyu Nie, Yinfei Kong, Ted Tao Yuan, Pauline Berry Burke
WISE (2)3
2018 Merchandise Recommendation for Retail Events with Word Embedding Weighted Tf-idf and Dynamic Query Expansion
abstract
To recommend relevant merchandises for seasonal retail events, we rely on item retrieval from marketplace inventory. With feedback to expand query scope, we discuss keyword expansion candidate selection using word embedding similarity, and an enhanced tf-idf formula for expanded words in search ranking.
Ted Tao Yuan
SIGIR1
2016 Bayesian Inventory Planning with Imperfect Demand Estimation in Online Flash Sale
Ted Tao Yuan, Michelle Cai, Daniel Kao
ICORES1
2011 Predicting eBay listing conversion
abstract
At eBay Market Place, listing conversion rate can be measured by number of items sold divided by number of items in a sample set. For a given item, conversion rate can also be treated as the probability of sale. By investigating eBay listings' transactional patterns, as well as item attributes and user click-through data, we developed conversion models that allow us to predict a live listing's probability of sale. In this paper, we discuss the design and implementation of such conversion models. These models are highly valuable in analysis of inventory quality and ranking. Our work reveals the uniqueness of sales-oriented search at eBay and its similarity to general web search problems.
Ted Tao Yuan, Mike Mathieson
SIGIR1