Papers › Adaptive Supergeo Design: A Scalable Framework for Geographic Marketing Experiments
Adaptive Supergeo Design: A Scalable Framework for Geographic Marketing Experiments
Charles Shaw
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Geographic experiments are a widely-used methodology for measuring incremental return on ad spend (iROAS) at scale, yet their design presents significant challenges. The unit count is small, heterogeneity is large, and the optimal Supergeo partitioning problem is NP-hard. We introduce Optimized Supergeo Design (OSD), a two-stage framework that renders Supergeo designs practical for large-scale markets. Principal Component Analysis (PCA) first reduces the covariate space to create interpretable geo-embeddings. A Mixed-Integer Linear Programming (MILP) solver then selects a partition that balances both baseline outcomes and pre-treatment covariates. We provide theoretical arguments that OSD's objective value is within (1+ε) of the global optimum under community-structure assumptions. Rigorous ablation analysis on synthetic data shows that PCA- and random-embedding Supergeo designs match unit-level randomisation in estimation error while delivering tighter covariate balance, whereas spectral embeddings substantially worsen both RMSE and balance. Crucially, OSD solves the scalability bottleneck. For N=210 markets, OSD completes in a fraction of a second, while exact Supergeo covering MIPs described in prior work are projected to require orders of magnitude longer, on the order of weeks. Scalability experiments up to N=1 000 units show that OSD remains fast without trimming markets. In our main synthetic setting with N=200 units, PCA- and random-embedding designs keep covariate imbalance at only a few percentage points while preserving every media dollar, establishing a scalable framework that matches the statistical efficiency of randomisation with the operational practicality of Supergeos.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections