VLDB 2026 Research / reviewers in the wild / expert
Feifang Hu
dblp:81/3974
· DBLP profile ↗
5ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0002-9811-2910ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2
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 social science and digital humanities · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational social science and digital humanities › online controlled experiments › a/b testing
network a/b testing |
0.7 | 1 | 2023 | A/B Testing in Network Data with Covariate-Adaptive Randomization · ICML 2023 |
Mathematical optimization
experimental design |
0.7 | 1 | 2023 | A/B Testing in Network Data with Covariate-Adaptive Randomization · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
average treatment effect estimation · 1.3adaptive randomization · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Cluster-Adaptive Network A/B Testing: From Randomization to EstimationabstractThe performance of A/B testing in both online and offline experimental settings hinges on mitigating network interference and achieving covariate balancing. These experiments often involve an observable network with identifiable clusters, and measurable cluster-level and individual-level attributes. Exploiting these inherent characteristics holds potential for refining experimental design and subsequent statistical analyses. In this article, we propose a novel cluster-adaptive network A/B testing procedure, which contains a cluster-adaptive randomization (CLAR) and a cluster-adjusted estimator (CAE) to facilitate the design of the experiment and enhance the performance of ATE estimation. The CLAR sequentially assigns clusters to minimize the Mahalanobis distance, which further leads to the balance of the cluster-level covariates and the within-cluster-averaged individual-level covariates. The cluster-adjusted estimator (CAE) is tailored to offset biases caused by network interference. The proposed procedure has the following two folds of the desirable properties. First, we show that the Malanobis distance calculated for the two levels of covariates is $O_p(m^{-1})$, where $m$ represents the number of clusters. This result justifies the simultaneous balance of the cluster-level and individual-level covariates. Under mild conditions, we derive the asymptotic normality of CAE and demonstrate the benefit of covariate balancing on improving the precision for estimating ATE. The proposed A/B testing procedure is easy to calculate, consistent, and achieves higher accuracy. Extensive numerical studies are conducted to demonstrate the finite sample property of the proposed network A/B testing procedure. Ping Li 0001, Feifang Hu |
J. Mach. Learn. Res. | 4 |
| 2023 | A/B Testing in Network Data with Covariate-Adaptive RandomizationabstractUsers linked together through a network often tend to have similar behaviors. This phenomenon is usually known as network interaction. Users' characteristics, the covariates, are often correlated with their outcomes. Therefore, one should incorporate both the covariates and the network information in a carefully designed randomization to improve the estimation of the average treatment effect (ATE) in network A/B testing. In this paper, we propose a new adaptive procedure to balance both the network and the covariates. We show that the imbalance measures with respect to the covariates and the network are $O_p(1)$. We also demonstrate the relationships between the improved balances and the increased efficiency in terms of the mean square error (MSE). Numerical studies demonstrate the advanced performance of the proposed procedure regarding the greater comparability of the treatment groups and the reduction of MSE for estimating the ATE. Ping Li 0001, Feifang Hu |
ICML | 3 |
| 2022 | Adaptive A/B Test on Networks with Cluster StructuresabstractUnits in online A/B tests are often involved in social networks. Thus, their outcomes may depend on the treatment of their neighbors. Many of such networks exhibit certain cluster structures allowing the use of these features in the design to reduce the bias from network interference. When the average treatment effect (ATE) is considered from the individual perspective, conditions for the valid estimation restrict the use of these features in the design. We show that such restrictions can be alleviated if the ATE from the cluster perspective is considered. Using an illustrative example, we further show that the weights employed by the Horvitz-Thompson estimator may not appropriately accommodate the network structure, and purely relying on graph-cluster randomization may generate very unbalanced cluster-treated structures across the treatment arms. The measures of such structures for one cluster may depend on the treatment of other clusters and pose a great challenge for the design of A/B tests. To address these issues, we propose a rerandomized-adaptive randomization to balance the clusters and a cluster-adjusted estimator to alleviate the problem of the weights. Numerical studies are conducted to demonstrate the usage of the proposed procedure. Ping Li 0001, Feifang Hu |
AISTATS | 4 |
| 2001 | Efficiently Determining the Starting Sample Size for Progressive Sampling
Baohua Gu, Bing Liu 0001, Feifang Hu, Huan Liu 0001 |
ECML | 3 |
| 2001 | Modelling Classification Performance for Large Data Sets
Baohua Gu, Feifang Hu |
WAIM | 2 |