EDBT 2026 Demo / reviewers in the wild / expert
Eytan Bakshy
dblp:58/2226
· DBLP profile ↗
13ranked-venue papers in the field
6as first author
4since 2021 · last 2026
0009-0007-6480-9879ORCID · corroborated
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 7 (2 first)Information Retrieval & Web Search · 6 (4 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Case Study: Learning Robust, Long-run Surrogate Metrics with Modeling and Instrumental VariablesabstractWhen developing product changes to improve long-run user outcomes, surrogate metrics are a powerful tool to help accelerate decision making. Randomized, online A/B testing has become the gold standard for measuring long-run outcomes, but waiting for long-run outcomes to materialize in a test greatly reduces iteration speed. To accelerate decision making, we instead can use surrogate metrics that predict the long-run outcome more quickly. However, finding accurate, robust surrogate metrics is challenging in practice. Existing methods propose finding candidate surrogate metrics in various ways, such as re-analyzing past A/B experiments where candidates strongly correlate with the long-run outcome. However, these methods face practical limitations such as being affected by hidden confounders or needing to rely on outdated, historical data. We developed a new approach where we learned user-level surrogate metrics with non-parametric machine learning and instrumental variable (IV) analysis. We trained surrogate metrics for two key, long-run business metrics, BV1 and BV2, in classification and regression settings, respectively. We deployed each surrogate model such that it would be available as a metric to use in all A/B tests in the target product surface. Our surrogate models predicted each user's long-run outcomes more accurately than baseline heuristics (e.g., our BV1 surrogate model's AUC was 0.93 vs. 0.79 for the baseline heuristic). At the A/B test level, our surrogate metrics showed greater than 0.9 Pearson correlation with the long-run outcome across A/B tests and achieved at least a 50% improvement in accuracy over other baselines. Our surrogate metrics were >30x more predictive of whether an A/B test's had consistent post-launch effects. Finally, we provide evidence of surrogacy for our metrics where we show in multiple independent A/B tests that directly optimizing for our surrogate metrics drove changes in the long-run target outcome. Our results demonstrate that combining machine learning and causal inference leads not only to accurate surrogate metrics but also evidence they can act like true surrogates in practice. Daniel Day, Matthew Dalton, Samuel Daulton, Benjamin Letham, Aojia Zhao, Eytan Bakshy |
KDD (1) | 7 |
| 2025 | Experimenting, Fast and Slow: Bayesian Optimization of Long-term Outcomes with Online ExperimentsabstractOnline experiments in internet systems, also known as A/B tests, are used for a wide range of system tuning problems, such as optimizing recommender system ranking policies and learning adaptive streaming controllers. Decision-makers generally wish to optimize for long-term treatment effects of the system changes, which often requires running experiments for a long time as short-term measurements can be misleading due to non-stationarity in treatment effects over time. The sequential experimentation strategies--which typically involve several iterations--can be prohibitively long in such cases. We describe a novel approach that combines fast experiments (e.g., biased experiments run only for a few hours or days) and/or offline proxies (e.g., off-policy evaluation) with long-running, slow experiments to perform sequential, Bayesian optimization over large action spaces in a short amount of time. Samuel Daulton, Benjamin Letham, Maximilian Balandat, Eytan Bakshy |
KDD (1) | 5 |
| 2022 | Looper: An End-to-End ML Platform for Product DecisionsabstractModern software systems and products increasingly rely on machine learning models to make data-driven decisions based on interactions with users, infrastructure and other systems. For broader adoption, this practice must (i) accommodate product engineers without ML backgrounds, (ii) support finegrain product-metric evaluation and (iii) optimize for product goals. To address shortcomings of prior platforms, we introduce general principles for and the architecture of an ML platform, Looper, with simple APIs for decision-making and feedback collection. Looper covers the end-to-end ML lifecycle from collecting training data and model training to deployment and inference, and extends support to personalization, causal evaluation with heterogenous treatment effects, and Bayesian tuning for product goals. During the 2021 production deployment, Looper simultaneously hosted 440-1,000 ML models that made 4-6 million real-time decisions per second. We sum up experiences of platform adopters and describe their learning curve. Igor L. Markov, Hanson Wang, Nitya Kasturi, Shaun Singh, Mia Garrard, Sze Wai Yuen, Sarah Tran, Igor Glotov, Tanvi Gupta, Boshuang Huang, Xiaowen Xie, Michael Belkin, Sal Uryasev, Sam Howie, Eytan Bakshy, Norm Zhou |
KDD | 18 |
| 2022 | Interpretable Personalized ExperimentationabstractBlack-box heterogeneous treatment effect (HTE) models are increasingly being used to create personalized policies that assign individuals to their optimal treatments. However, they are difficult to understand, and can be burdensome to maintain in a production environment. In this paper, we present a scalable, interpretable personalized experimentation system, implemented and deployed in production at Meta. The system works in a multiple treatment, multiple outcome setting typical at Meta to: (1) learn explanations for black-box HTE models; (2) generate interpretable personalized policies. We evaluate the methods used in the system on publicly available data and Meta use cases, and discuss lessons learnt during the development of the system. Sarah Tan, Weiwei Li 0006, Mia Garrard, Adam Obeng, Drew Dimmery, Shaun Singh, Hanson Wang, Daniel R. Jiang, Eytan Bakshy |
KDD | 10 |
| 2019 | Shrinkage Estimators in Online ExperimentsabstractWe develop and analyze empirical Bayes Stein-type estimators for use in the estimation of causal effects in large-scale online experiments. While online experiments are generally thought to be distinguished by their large sample size, we focus on the multiplicity of treatment groups. The typical analysis practice is to use simple differences-in-means (perhaps with covariate adjustment) as if all treatment arms were independent. In this work we develop consistent, small bias, shrinkage estimators for this setting. In addition to achieving lower mean squared error these estimators retain important frequentist properties such as coverage under most reasonable scenarios. Modern sequential methods of experimentation and optimization such as multi-armed bandit optimization (where treatment allocations adapt over time to prior responses) benefit from the use of our shrinkage estimators. Exploration under empirical Bayes focuses more efficiently on near-optimal arms, improving the resulting decisions made under uncertainty. We demonstrate these properties by examining seventeen routine experiments conducted on Facebook from April to June 2017. Drew Dimmery, Eytan Bakshy, Jasjeet S. Sekhon |
KDD | 2 |
| 2015 | Design and Analysis of Benchmarking Experiments for Distributed Internet ServicesabstractThe successful development and deployment of large-scale Internet services depends critically on performance. Even small regressions in processing time can translate directly into significant energy and user experience costs. Despite the widespread use of distributed server infrastructure (e.g., in cloud computing and Web services), there is little research on how to benchmark such systems to obtain valid and precise inferences with minimal data collection costs. Correctly A/B testing distributed Internet services can be surprisingly difficult because interdependencies between user requests (e.g., for search results, social media streams, photos) and host servers violate assumptions required by standard statistical tests. We develop statistical models of distributed Internet service performance based on data from Perflab, a production system used at Facebook which vets thousands of changes to the company's codebase each day. We show how these models can be used to understand the tradeoffs between different benchmarking routines, and what factors must be taken into account when performing statistical tests. Using simulations and empirical data from Perflab, we validate our theoretical results, and provide easy-to-implement guidelines for designing and analyzing such benchmarks. Eytan Bakshy, Eitan Frachtenberg |
WWW | 1 |
| 2014 | Designing and deploying online field experimentsabstractOnline experiments are widely used to compare specific design alternatives, but they can also be used to produce generalizable knowledge and inform strategic decision making. Doing so often requires sophisticated experimental designs, iterative refinement, and careful logging and analysis. Few tools exist that support these needs. We thus introduce a language for online field experiments called PlanOut. PlanOut separates experimental design from application code, allowing the experimenter to concisely describe experimental designs, whether common "A/B tests" and factorial designs, or more complex designs involving conditional logic or multiple experimental units. These latter designs are often useful for understanding causal mechanisms involved in user behaviors. We demonstrate how experiments from the literature can be implemented in PlanOut, and describe two large field experiments conducted on Facebook with PlanOut. For common scenarios in which experiments are run iteratively and in parallel, we introduce a namespaced management system that encourages sound experimental practice. Eytan Bakshy, Dean Eckles, Michael S. Bernstein |
WWW | 1 |
| 2013 | Uncertainty in online experiments with dependent data: an evaluation of bootstrap methodsabstractMany online experiments exhibit dependence between users and items. For example, in online advertising, observations that have a user or an ad in common are likely to be associated. Because of this, even in experiments involving millions of subjects, the difference in mean outcomes between control and treatment conditions can have substantial variance. Previous theoretical and simulation results demonstrate that not accounting for this kind of dependence structure can result in confidence intervals that are too narrow, leading to inaccurate hypothesis tests. Eytan Bakshy, Dean Eckles |
KDD | 1 |
| 2012 | The role of social networks in information diffusionabstractOnline social networking technologies enable individuals to simultaneously share information with any number of peers. Quantifying the causal effect of these mediums on the dissemination of information requires not only identification of who influences whom, but also of whether individuals would still propagate information in the absence of social signals about that information. We examine the role of social networks in online information diffusion with a large-scale field experiment that randomizes exposure to signals about friends' information sharing among 253 million subjects in situ. Those who are exposed are significantly more likely to spread information, and do so sooner than those who are not exposed. We further examine the relative role of strong and weak ties in information propagation. We show that, although stronger ties are individually more influential, it is the more abundant weak ties who are responsible for the propagation of novel information. This suggests that weak ties may play a more dominant role in the dissemination of information online than currently believed. Eytan Bakshy, Itamar Rosenn, Cameron Marlow, Lada A. Adamic |
WWW | 1 |
| 2011 | Center of Attention: How Facebook Users Allocate Attention across Friends
Lars Backstrom, Eytan Bakshy, Jon M. Kleinberg, Thomas M. Lento, Itamar Rosenn |
ICWSM | 2 |
| 2011 | Everyone's an influencer: quantifying influence on twitterabstractIn this paper we investigate the attributes and relative influence of 1.6M Twitter users by tracking 74 million diffusion events that took place on the Twitter follower graph over a two month interval in 2009. Unsurprisingly, we find that the largest cascades tend to be generated by users who have been influential in the past and who have a large number of followers. We also find that URLs that were rated more interesting and/or elicited more positive feelings by workers on Mechanical Turk were more likely to spread. In spite of these intuitive results, however, we find that predictions of which particular user or URL will generate large cascades are relatively unreliable. We conclude, therefore, that word-of-mouth diffusion can only be harnessed reliably by targeting large numbers of potential influencers, thereby capturing average effects. Finally, we consider a family of hypothetical marketing strategies, defined by the relative cost of identifying versus compensating potential "influencers." We find that although under some circumstances, the most influential users are also the most cost-effective, under a wide range of plausible assumptions the most cost-effective performance can be realized using "ordinary influencers"---individuals who exert average or even less-than-average influence. Eytan Bakshy, Jake M. Hofman, Winter A. Mason, Duncan J. Watts |
WSDM | 1 |
| 2010 | The Social Dynamics of Economic Activity in a Virtual World
Eytan Bakshy, Matthew P. Simmons, David A. Huffaker, Chun-Yuen Cheng, Lada A. Adamic |
ICWSM | 1 |
| 2008 | Knowledge sharing and yahoo answers: everyone knows somethingabstractYahoo Answers (YA) is a large and diverse question-answer forum, acting not only as a medium for sharing technical knowledge, but as a place where one can seek advice, gather opinions, and satisfy one's curiosity about a countless number of things. In this paper, we seek to understand YA's knowledge sharing and activity. We analyze the forum categories and cluster them according to content characteristics and patterns of interaction among the users. While interactions in some categories resemble expertise sharing forums, others incorporate discussion, everyday advice, and support. With such a diversity of categories in which one can participate, we find that some users focus narrowly on specific topics, while others participate across categories. This not only allows us to map related categories, but to characterize the entropy of the users' interests. We find that lower entropy correlates with receiving higher answer ratings, but only for categories where factual expertise is primarily sought after. We combine both user attributes and answer characteristics to predict, within a given category, whether a particular answer will be chosen as the best answer by the asker. Lada A. Adamic, Jun Zhang 0008, Eytan Bakshy, Mark S. Ackerman |
WWW | 3 |