Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yicong Lin
dblp:206/0880
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0005-0486-525XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › customer relationship management
customer retention |
0.2 | 1 | 2024 | Business Policy Experiments using Fractional Factorial Designs: Consumer Retention on DoorDash · KDD 2024 |
Methods — techniques the papers use, named apart from their topics
heterogeneous treatment effect estimation · 1.5factorial design · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Business Policy Experiments using Fractional Factorial Designs: Consumer Retention on DoorDashabstractThis paper investigates an approach to both speed up business decision-making and lower the cost of learning through experimentation by factorizing business policies and employing fractional factorial experimental designs for their evaluation. We illustrate how this method integrates with advances in the estimation of heterogeneous treatment effects, elaborating on its advantages and foundational assumptions. We empirically demonstrate the implementation and benefits of our approach and assess its validity in evaluating consumer promotion policies at DoorDash, which is one of the largest delivery platforms in the US. Our approach discovers a policy with 5% incremental profit at 67% lower implementation cost. Yixin Tang, Yicong Lin, Navdeep S. Sahni |
KDD | 2 |
| 2024 | Domain Adaptation with Cauchy-Schwarz DivergenceabstractDomain adaptation aims to use training data from one or multiple source domains to learn a hypothesis that can be generalized to a different, but related, target domain. As such, having a reliable measure for evaluating the discrepancy of both marginal and conditional distributions is crucial. We introduce Cauchy-Schwarz (CS) divergence to the problem of unsupervised domain adaptation (UDA). The CS divergence offers a theoretically tighter generalization error bound than the popular Kullback-Leibler divergence. This holds for the general case of supervised learning, including multi-class classification and regression. Furthermore, we illustrate that the CS divergence enables a simple estimator on the discrepancy of both marginal and conditional distributions between source and target domains in the representation space, without requiring any distributional assumptions. We provide multiple examples to illustrate how the CS divergence can be conveniently used in both distance metric- or adversarial training-based UDA frameworks, resulting in compelling performance. The code of our paper is available at \url{https://github.com/ywzcode/CS-adv}. Wenzhe Yin, Shujian Yu, Yicong Lin, Jie Liu 0043, Jan-Jakob Sonke, Efstratios Gavves |
UAI | 3 |