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

Shuangning Li

dblp:341/1499 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0002-6272-4798ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Theory of computation · 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
Probabilistic and Bayesian machine learning · 46% Transfer learning and domain adaptation · 46% Learning theory · 7%
Theoretical computer science
2 papers
Mathematical optimization · 36% Information theory · 32% Algorithms and data structures · 32%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › conditional independence
conditional independence testing
0.812024
Covariate Shift Corrected Conditional Randomization Test · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › conditional independence › conditional independence testing
conditional randomization test
0.812024
Covariate Shift Corrected Conditional Randomization Test · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation › domain shift
covariate shift
0.812024
Covariate Shift Corrected Conditional Randomization Test · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation › instance weighting
importance weighting
0.812024
Covariate Shift Corrected Conditional Randomization Test · NeurIPS 2024
Mathematical optimization
experimental design
0.812024
Experimenting under Stochastic Congestion · EC 2024
Computational social science and digital humanities
online controlled experiments
0.712023
Detecting Interference in Online Controlled Experiments with Increasing Allocation · KDD 2023
Information theory
hypothesis testing
0.712023
Detecting Interference in Online Controlled Experiments with Increasing Allocation · KDD 2023
Algorithms and data structures
permutation test
0.712023
Detecting Interference in Online Controlled Experiments with Increasing Allocation · KDD 2023
Machine learning › Learning theory › hypothesis testing
type-i error control
0.212024
Covariate Shift Corrected Conditional Randomization Test · NeurIPS 2024
Performance modeling and evaluation
queueing models
0.212024
Experimenting under Stochastic Congestion · EC 2024

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

queueing theory · 1.5causal inference · 1.5permutation test · 1.3a/b testing · 1.3pearson chi-squared test · 0.8importance weighting · 0.8control variates · 0.8
YearPublicationVenuePosition
2024 Covariate Shift Corrected Conditional Randomization Test
abstract
Conditional independence tests are crucial across various disciplines in determining the independence of an outcome variable $Y$ from a treatment variable $X$, conditioning on a set of confounders $Z$. The Conditional Randomization Test (CRT) offers a powerful framework for such testing by assuming known distributions of $X \mid Z$; it controls the Type-I error exactly, allowing for the use of flexible, black-box test statistics. In practice, testing for conditional independence often involves using data from a source population to draw conclusions about a target population. This can be challenging due to covariate shift---differences in the distribution of $X$, $Z$, and surrogate variables, which can affect the conditional distribution of $Y \mid X, Z$---rendering traditional CRT approaches invalid. To address this issue, we propose a novel Covariate Shift Corrected Pearson Chi-squared Conditional Randomization (csPCR) test. This test adapts to covariate shifts by integrating importance weights and employing the control variates method to reduce variance in the test statistics and thus enhance power. Theoretically, we establish that the csPCR test controls the Type-I error asymptotically. Empirically, through simulation studies, we demonstrate that our method not only maintains control over Type-I errors but also exhibits superior power, confirming its efficacy and practical utility in real-world scenarios where covariate shifts are prevalent. Finally, we apply our methodology to a real-world dataset to assess the impact of a COVID-19 treatment on the 90-day mortality rate among patients.
Chuan Hong, Shuangning Li, Molei Liu
NeurIPS4
2024 Experimenting under Stochastic Congestion
abstract
We study randomized experiments in a service system when stochastic congestion can arise from temporarily limited supply or excess demand. Such congestion gives rise to cross-unit interference between the waiting customers, and analytic strategies that do not account for this interference may be biased. In current practice, one of the most widely used ways to address stochastic congestion is to use switchback experiments that alternatively turn a target intervention on and off for the whole system. We find, however, that under a queueing model for stochastic congestion, the standard way of analyzing switchbacks is inefficient, and that estimators that leverage the queueing model can be materially more accurate. We also consider a new experimental design, which we refer to as the length-0 switchback, that can be used to estimate a policy gradient of the dynamic system using only unit-level randomization. This design avoids needing to pre-commit to a switchback length before data collection, and can thus be easier to deploy in settings with nonstationarity.
Shuangning Li, Ramesh Johari, Kuang Xu, Stefan Wager
EC1
2023 Detecting Interference in Online Controlled Experiments with Increasing Allocation
abstract
In the past decade, the technology industry has adopted online controlled experiments (a.k.a. A/B testing) to guide business decisions. In practice, A/B tests are often implemented with increasing treatment allocation: the new treatment is gradually released to an increasing number of units through a sequence of randomized experiments. In scenarios such as experimenting in a social network setting or in a bipartite online marketplace, interference among units may exist, which can harm the validity of simple inference procedures. In this work, we introduce a widely applicable procedure to test for interference in A/B testing with increasing allocation. Our procedure can be implemented on top of an existing A/B testing platform with a separate flow and does not require a priori a specific interference mechanism. In particular, we introduce two permutation tests that are valid under different assumptions. Firstly, we introduce a general statistical test for interference requiring no additional assumption. Secondly, we introduce a testing procedure that is valid under a time fixed effect assumption. The testing procedure is of very low computational complexity, it is powerful, and it formalizes a heuristic algorithm implemented already in industry. We demonstrate the performance of the proposed testing procedure through simulations on synthetic data. Finally, we discuss one application at LinkedIn, where a screening step is implemented to detect potential interference in all their marketplace experiments with the proposed methods in the paper.
Kevin Han, Shuangning Li, Jialiang Mao
KDD2