Related papers: Adaptive Ad Load Design for Sponsored Search Markets: Evidence, Theory, and Deployment

Adaptive Ad Load Design for Sponsored Search Markets: Evidence, Theory, and Deployment

URL: http://arxiv.org/abs/2607.14418v1
Date: Wed, 15 Jul 2026 23:12:26 GMT
Title: Adaptive Ad Load Design for Sponsored Search Markets: Evidence, Theory, and Deployment
Abstract summary: Ad-load design is a central supply-side decision in sponsored search.<n>We study this trade-off using a large-scale randomized field experiment on an Android app store.<n>We deploy a novel adaptive algorithm -- exploration-augmented Locally Adaptive Ad Load (e-LAAL)
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Ad-load design is a central supply-side decision in sponsored search: more sponsored slots can raise revenue, but may crowd out organic results and degrade user outcomes. We study this trade-off using a large-scale randomized field experiment on an Android app store, where over five million users are exposed to one through six sponsored slots. Increasing ad load raises revenue by up to 43%, but reduces total search conversions by up to 5% and daily engagement by up to 2.2%. These average effects mask substantial heterogeneity: additional slots generate large revenue gains for high-ad-conversion queries, but little or negative marginal revenue for low-conversion queries. The trade-off also shifts within query as advertiser composition changes, such as brand-advertiser presence. Motivated by these findings, we design and deploy a novel adaptive algorithm -- exploration-augmented Locally Adaptive Ad Load (e-LAAL). e-LAAL combines LAAL, a model-free query-level decision rule that updates ad-load recommendations using recent outcomes, with static exploration arms that maintain support and provide fixed-policy counterfactual benchmarks. We provide a finite-time dynamic-regret guarantee for the e-LAAL architecture. In a platform-level production deployment serving 22.3 million users and 77.6 million searches, e-LAAL improves the empirical revenue--conversion trade-off relative to deployed static benchmarks and outperforms uniform and historical query-dependent static benchmarks.

Related papers

Learning to Allocate Incentives for Incentivized Advertising via Offline Model-Based Reinforcement Learning [12.901979770261278]
In incentivized advertising, a platform promises users a bonus before observing downstream ad revenue, encouraging them to click and complete ads.<n>It must balance the incentive promised in advance against the revenue realized afterward.<n>We develop an offline model-based RL framework for cost-controllable sequential incentive allocation.
arXiv Detail & Related papers (2026-08-28T08:35:41Z)
Pandora's AI Model Routing Box: Efficient Allocation with Costly Value Estimation [64.51088225051959]
Heterogeneous AI systems can improve quality and efficiency by routing queries to the specialist who can answer most effectively at the lowest cost.<n>We formalize this tradeoff as an instance of Pandora's Box, the classical problem of optimal search with costly inspection.<n>Under a Gaussian signal model, the resulting policies have closed-form value-of-information expressions that determine, for each specialist and input, whether refining the value estimate is worth its cost.
arXiv Detail & Related papers (2026-08-20T17:54:37Z)
Next-Gen Sponsored Search: Crafting the Perfect Query with Inventory-Aware RAG (InvAwr-RAG) Based GenAI [1.3544447919445164]
We introduce the Inventory-Aware RAG-based Generative AI model (InvAwr-RAG), which integrates advanced semantic retrieval and real-time inventory data.<n>Preliminary results show a significant 68% increase in fill rate and balanced relevance metrics, indicating a strong potential for increased ad revenue.
arXiv Detail & Related papers (2026-07-04T13:53:45Z)
Beyond Single Slot: Joint Optimization for Multi-Slot Guaranteed Display Advertising [19.913909474194934]
We propose a novel joint optimization framework for multi-slot GD allocation, addressing key challenges such as slot-level redundancy, contract imbalance, and exposure concentration.<n>Our approach formulates the allocation as an offline bipartite matching problem with a contract roulette mechanism for slot exclusivity and Page View constraints.
arXiv Detail & Related papers (2026-05-20T13:32:47Z)
One Model, Two Markets: Bid-Aware Generative Recommendation [7.863030229448138]
We propose a unified framework that integrates commercial relevance and monetization objectives directly into the generative sequence.<n>We introduce control tokens to decouple the decision of whether to show an ad from which item to show.<n>We also devise a Bid-Aware Decoding mechanism that handles real-time pricing, injecting bids directly into the inference process to steer the generation toward high-value items.
arXiv Detail & Related papers (2026-03-23T17:27:59Z)
Large Foundation Model for Ads Recommendation [50.71446552453167]
We propose LFM4Ads, an All-Representation Multi-Granularity transfer framework for ads recommendation.<n>LFM4Ads has been successfully deployed in Tencent's industrial-scale advertising platform.
arXiv Detail & Related papers (2025-08-20T10:18:01Z)
Bidding-Aware Retrieval for Multi-Stage Consistency in Online Advertising [30.108437268612438]
Bidding-Aware Retrieval (BAR) is a model-based retrieval framework that addresses multi-stage inconsistency by incorporating ad bid value into the retrieval scoring function.<n>BAR's core innovation is Bidding-Aware Modeling, incorporating bid signals through monotonicity-constrained learning and multi-task distillation to ensure economically coherent representations.<n>Extensive offline experiments and full-scale deployment across Alibaba's display advertising platform validated BAR's efficacy.
arXiv Detail & Related papers (2025-08-07T09:43:34Z)
External Evaluation of Discrimination Mitigation Efforts in Meta's Ad Delivery [47.418845064441605]
We show that the Variance Reduction System (VRS) implemented by Meta does not meaningfully improve access to opportunities for individuals.<n>We then conduct experiments to evaluate VRS with real-world ads, and show that while VRS does reduce variance, it also raises advertiser costs.<n>We show our approach outperforms VRS by both increasing ad exposure for users from all groups and reducing cost to advertisers.
arXiv Detail & Related papers (2025-06-19T19:29:26Z)
Democratizing LLMs: An Exploration of Cost-Performance Trade-offs in Self-Refined Open-Source Models [53.859446823312126]
SoTA open source models of varying sizes from 7B - 65B, on average, improve 8.2% from their baseline performance. Strikingly, even models with extremely small memory footprints, such as Vicuna-7B, show a 11.74% improvement overall and up to a 25.39% improvement in high-creativity, open ended tasks.
arXiv Detail & Related papers (2023-10-11T15:56:00Z)
VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
arXiv Detail & Related papers (2022-05-31T17:45:30Z)
Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
arXiv Detail & Related papers (2020-06-29T18:50:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.