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

Achal Bassamboo

dblp:12/485 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0001-7758-4751ORCID · verified

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

Artificial intelligence and machine learning · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Learning theory · 33%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › hypothesis testing
a/b testing
0.812024
Asymptotically Optimal and Computationally Efficient Average Treatment Effect Estimation in A/B testing · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation
average treatment effect estimation
0.812024
Asymptotically Optimal and Computationally Efficient Average Treatment Effect Estimation in A/B testing · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning
experimental design
0.812024
Asymptotically Optimal and Computationally Efficient Average Treatment Effect Estimation in A/B testing · ICML 2024
Algorithms and data structures › randomized algorithms › sampling
adaptive sampling
0.812024
Asymptotically Optimal and Computationally Efficient Average Treatment Effect Estimation in A/B testing · ICML 2024

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

max-min optimization · 1.5confidence intervals · 1.5adaptive policy · 1.5
YearPublicationVenuePosition
2024 Asymptotically Optimal and Computationally Efficient Average Treatment Effect Estimation in A/B testing
abstract
Motivated by practical applications in clinical trials and online platforms, we study A/B testing with the aim of estimating a confidence interval (CI) for the average treatment effect (ATE) using the minimum expected sample size. This CI should have a width at most $\epsilon$ while ensuring that the probability of the CI not containing the true ATE is at most $\delta$. To answer this, we first establish a lower bound on the expected sample size needed for any adaptive policy which constructs a CI of ATE with desired properties. Specifically, we prove that the lower bound is based on the solution to a max-min non-convex optimization problem for small $\delta$. Tailoring the “plug-in” approach for the ATE problem, we construct an adaptive policy that is asymptotically optimal, i.e., matches the lower bound on the expected sample size for small $\delta$. Interestingly, we find that, for small $\epsilon$ and $\delta$, the asymptotically optimal fraction of treatment assignment for A and B is proportional to the standard deviation of the outcome distributions of treatments A and B, respectively. However, as the proposed approach can be computationally intensive, we propose an alternative adaptive policy. This new policy, informed by insights from our lower bound analysis, is computationally efficient while remaining asymptotically optimal for small values of $\epsilon$ and $\delta$. Numerical comparisons demonstrate that both policies perform similarly across practical values of $\epsilon$ and $\delta$, offering efficient solutions for A/B testing.
Vikas Deep, Achal Bassamboo, Sandeep Juneja 0001
ICML2