Network A/B Testing: From Sampling to Estimation

Slides:



Advertisements
Similar presentations
A General Framework for Mining Concept-Drifting Data Streams with Skewed Distributions Jing Gao Wei Fan Jiawei Han Philip S. Yu University of Illinois.
Advertisements

Size-estimation framework with applications to transitive closure and reachability Presented by Maxim Kalaev Edith Cohen AT&T Bell Labs 1996.
A Graph-based Recommender System Zan Huang, Wingyan Chung, Thian-Huat Ong, Hsinchun Chen Artificial Intelligence Lab The University of Arizona 07/15/2002.
CSE 5243 (AU 14) Graph Basics and a Gentle Introduction to PageRank 1.
Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69,
Community Detection Algorithm and Community Quality Metric Mingming Chen & Boleslaw K. Szymanski Department of Computer Science Rensselaer Polytechnic.
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
COLLABORATIVE FILTERING Mustafa Cavdar Neslihan Bulut.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
1 A Random-Surfer Web-Graph Model (Joint work with Avrim Blum & Hubert Chan) Mugizi Rwebangira.
1 Walking on a Graph with a Magnifying Glass Stratified Sampling via Weighted Random Walks Maciej Kurant Minas Gjoka, Carter T. Butts, Athina Markopoulou.
Chapter 1: Introduction to Accounting Theory
On Appropriate Assumptions to Mine Data Streams: Analyses and Solutions Jing Gao† Wei Fan‡ Jiawei Han† †University of Illinois at Urbana-Champaign ‡IBM.
Expertise Networks in Online Communities: Structure and Algorithms Jun Zhang Mark S. Ackerman Lada Adamic University of Michigan WWW 2007, May 8–12, 2007,
Computing Trust in Social Networks
Heterogeneous Consensus Learning via Decision Propagation and Negotiation Jing Gao † Wei Fan ‡ Yizhou Sun † Jiawei Han † †University of Illinois at Urbana-Champaign.
Heterogeneous Consensus Learning via Decision Propagation and Negotiation Jing Gao† Wei Fan‡ Yizhou Sun†Jiawei Han† †University of Illinois at Urbana-Champaign.
Chapter 28 Design of Experiments (DOE). Objectives Define basic design of experiments (DOE) terminology. Apply DOE principles. Plan, organize, and evaluate.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Models of Influence in Online Social Networks
Bayes Net Perspectives on Causation and Causal Inference
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
MGR: Multi-Level Global Router Yue Xu and Chris Chu Department of Electrical and Computer Engineering Iowa State University ICCAD
CHAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling
Fast Spectrum Allocation in Coordinated Dynamic Spectrum Access Based Cellular Networks Anand Prabhu Subramanian*, Himanshu Gupta*,
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
Purnamrita Sarkar (Carnegie Mellon) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.)
Graph Partitioning Donald Nguyen October 24, 2011.
 1  Outline  stages and topics in simulation  generation of random variates.
Modeling Relationship Strength in Online Social Networks Rongjing Xiang: Purdue University Jennifer Neville: Purdue University Monica Rogati: LinkedIn.
Machine Learning1 Machine Learning: Summary Greg Grudic CSCI-4830.
Network Aware Resource Allocation in Distributed Clouds.
Random Walks and Semi-Supervised Learning Longin Jan Latecki Based on : Xiaojin Zhu. Semi-Supervised Learning with Graphs. PhD thesis. CMU-LTI ,
WALKING IN FACEBOOK: A CASE STUDY OF UNBIASED SAMPLING OF OSNS junction.
Anindya Bhattacharya and Rajat K. De Bioinformatics, 2008.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Page 1 Ming Ji Department of Computer Science University of Illinois at Urbana-Champaign.
Hotspot Detection in a Service Oriented Architecture Pranay Anchuri,
DATA MINING LECTURE 13 Pagerank, Absorbing Random Walks Coverage Problems.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Palette: Distributing Tables in Software-Defined Networks Yossi Kanizo (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) and David Hay.
Networks Igor Segota Statistical physics presentation.
Paired Sampling in Density-Sensitive Active Learning Pinar Donmez joint work with Jaime G. Carbonell Language Technologies Institute School of Computer.
Jiafeng Guo(ICT) Xueqi Cheng(ICT) Hua-Wei Shen(ICT) Gu Xu (MSRA) Speaker: Rui-Rui Li Supervisor: Prof. Ben Kao.
Kruskal-Wallis H TestThe Kruskal-Wallis H Test is a nonparametric procedure that can be used to compare more than two populations in a completely randomized.
Measuring Behavioral Trust in Social Networks
Lecture 2: Statistical learning primer for biologists
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
Minas Gjoka, Emily Smith, Carter T. Butts
1 Identifying Differentially Regulated Genes Nirmalya Bandyopadhyay, Manas Somaiya, Sanjay Ranka, and Tamer Kahveci Bioinformatics Lab., CISE Department,
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
Graph Algorithms for Vision Amy Gale November 5, 2002.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs Maleq Khan September 9, 2014 Joint work with: Hasanuzzaman.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
1 Link Privacy in Social Networks Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar CIKM’08 Advisor: Dr. Koh, JiaLing Speaker: Li, HueiJyun Date: 2009/3/30.
Single Season Study Design. 2 Points for consideration Don’t forget; why, what and how. A well designed study will:  highlight gaps in current knowledge.
Semi-Supervised Clustering
Classification of unlabeled data:
Greedy Algorithm for Community Detection
Analysis of Link Reversal Routing Algorithms
Generative Model To Construct Blog and Post Networks In Blogosphere
Integrating Meta-Path Selection With User-Guided Object Clustering in Heterogeneous Information Networks Yizhou Sun†, Brandon Norick†, Jiawei Han†, Xifeng.
Effective Social Network Quarantine with Minimal Isolation Costs
Haim Kaplan and Uri Zwick
Department of Computer Science University of York
Jiawei Han Department of Computer Science
GANG: Detecting Fraudulent Users in OSNs
Presentation transcript:

Network A/B Testing: From Sampling to Estimation Ya Xu‡ Joint work with Huan Gui† Anmol Bhasin‡ Jiawei Han† † University of Illinois at Urbana-Champaign, Urbana ‡ LinkedIn Corporation

introduction

A/B Testing Uniformly Random Control Treatment Average Treatment Effect

A/B Testing – Two parallel universes Assumption Two parallel universes Parallel Universe 1 (control, ) Real World (Observations, ) Parallel Universe 2 (treatment, )

Network A/B Testing Interactions between nodes in networks

Examples Experiment on feed ranking algorithms Treatment feed algorithm ranks more relevant items higher Adam (treatment) clicks on a feed update(X) X shows up higher for Adam’s friend Ben (control) Ben (control) clicks on X Experiment on People You May Know recommendations …

Assumption: SUTVA SUTVA (Stable Unit Treatment Value Assumption) Treatment Assignment Vector Response function Each individual’s response is affected only by their own treatment assignments.

Network A/B Testing Framework

Framework Experimental Design Experimental Analysis Randomize assignment to minimize interactions Experimental Analysis Adjust for network effect post experiment

Experimental Design Partition the network/graph Randomize at cluster level Minimize the links between clusters Minimize the interactions between treatment and control Minimize information leakage Smaller bias for ATE

Balanced Graph Partition If the cluster sizes are the same for all clusters No matter what users’ responses are, the covariance is zero, leading to non-biased estimator. See Middleton and Aronow 2011 for derivation

Clustering Real Network Heterogeneous & large scale (350MM+) An employee network from LinkedIn 3-net clustering (Ugander et. al.,KDD’13)

Randomized Balanced Graph Partition Random Shuffling on Label Propagation Randomly initialize clusters (equal size) Select two nodes and swap their labels if it results in fewer edges between clusters. Randomly Shuffle x% of labels Repeat until convergence. Break local optimal

Clustering Results Network Statistics Edges # within each clusters Nodes # Edges # Max Degree Avg. Degree 7.26e4 2.88e6 3997 39.67 Method LP RSLP MM # of edges(1e6) 2.161 2.355 2.359 RSLP can be easily distributed as Label Propagation Algorithm, while achieves comparable performance as Modularity Maximization.

Experimental Analysis Exposure Models SUTVA Neighborhood Exposure (Ugander et. al., KDD’13) Definition: i is neighborhood exposed to treatment if (1) i is in treatment, and (2) At least θ% of i’s neighbors are in treatment Assumption: i’s response under neighborhood exposure is the same as if everyone receives treatment.

Bias-Variance Tradeoff θ = 0.9 θ = 0.3 About 80% of data points would be invalid (high variance) Stronger assumption Yi(θ= 0.3) = Yi(θ= 1) (large bias)

Fraction Neighborhood Exposure Users’ responses are determined by the treatment assignment the fraction of neighbors having the same treatment assignment. E.g., Additive Models can be arbitrary function

Example Additive Model I ATE

Example Additive Model II ATE

Simulations & real experiments

Simulations Real network graph Generation model (Eckles et al. 2014) Compare bias & variance of five estimators

Increasing treatment% Increasing treatment% Bias Variance

Increasing Network Effect Increasing Network Effect Bias Variance

Real Online Experiment Select a country Apply randomized balanced graph partitioning to assign treatment/control Apply two Feed ranking algorithms to treatment/control Estimate ATE using various approaches

Real Online Experiment Picked Netherlands 600 clusters  300/300 in treatment/control Conducted A/A test to ensure no bias

Real Online Experiments Results Method ATE for social gesture SUTVA 0.168 Network Exposure θ = 0.75 0.264 Network Exposure θ = 0.9 0.520 Hajek. Network Exposure θ = 0.75 0.625 0.133 Fraction Exposure (Additive I) 0.687 Fraction Exposure (Additive II) 0.714

Key Takeaways Network effect in A/B Testing Experimental Design: Balanced Graph Partition Experimental Analysis: Fraction Neighborhood Exposure Model Experiments Simulation Real Online Experiments Lots of future work!

Percentage of Units in Treatment The distribution of changes with percentage of units in treatment. is not representative.

Graph Cluster Randomization (Ugander et. al., KDD’13) Partition the social network How to cluster? Any constraints? Randomization on the cluster level Users in the same cluster receive the same treatment assignment (treatment/control). Estimate Average Treatment Effect Any assumptions?