Table of Contents
Fetching ...

Ad Insertion in LLM-Generated Responses

Shengwei Xu, Zhaohua Chen, Xiaotie Deng, Zhiyi Huang, Grant Schoenebeck

TL;DR

This paper tackles sustainable monetization of LLMs by embedding ads into responses in a way that preserves contextual coherence and minimizes latency while respecting privacy and disclosure rules. It introduces a two-layer decoupled framework: (i) insertion is decoupled from response generation, ensuring explicit ads; (ii) bidding is decoupled from specific queries via a fixed set of genres, enabling offline bids and online slot-coherence estimation. The core mechanism is a VCG auction over $L$ genres that assigns $K$ ads per response using proxy genre-values $\tilde{v}_{i,g}$ and a coherence vector $\tilde{c}_{j}$, with theoretical guarantees of approximately DSIC and IR (error bounded by $\varepsilon = \varepsilon_V + \varepsilon_C$) and near-optimal social welfare; the welfare gap is bounded by $2K \cdot \varepsilon \cdot \bar{v}$. To estimate coherence, the authors propose two methods (sentence embeddings and LLM-as-a-Judge) and validate them against human judgments, finding that LLM-as-a-Judge (e.g., GPT-5) achieves a Spearman correlation of about $\rho \approx 0.66$ with human ratings, outperforming most humans. Prototypes demonstrate real-time viability: VCG runs within seconds even for large advertiser pools and abundant slots, supporting practical deployment. Altogether, the work offers a scalable, privacy-aware path to monetizing LLM services with coherent, explicitly disclosed ads and robust welfare guarantees.

Abstract

Sustainable monetization of Large Language Models (LLMs) remains a critical open challenge. Traditional search advertising, which relies on static keywords, fails to capture the fleeting, context-dependent user intents--the specific information, goods, or services a user seeks--embedded in conversational flows. Beyond the standard goal of social welfare maximization, effective LLM advertising imposes additional requirements on contextual coherence (ensuring ads align semantically with transient user intents) and computational efficiency (avoiding user interaction latency), as well as adherence to ethical and regulatory standards, including preserving privacy and ensuring explicit ad disclosure. Although various recent solutions have explored bidding on token-level and query-level, both categories of approaches generally fail to holistically satisfy this multifaceted set of constraints. We propose a practical framework that resolves these tensions through two decoupling strategies. First, we decouple ad insertion from response generation to ensure safety and explicit disclosure. Second, we decouple bidding from specific user queries by using ``genres'' (high-level semantic clusters) as a proxy. This allows advertisers to bid on stable categories rather than sensitive real-time response, reducing computational burden and privacy risks. We demonstrate that applying the VCG auction mechanism to this genre-based framework yields approximately dominant strategy incentive compatibility (DSIC) and individual rationality (IR), as well as approximately optimal social welfare, while maintaining high computational efficiency. Finally, we introduce an "LLM-as-a-Judge" metric to estimate contextual coherence. Our experiments show that this metric correlates strongly with human ratings (Spearman's $ρ\approx 0.66$), outperforming 80% of individual human evaluators.

Ad Insertion in LLM-Generated Responses

TL;DR

This paper tackles sustainable monetization of LLMs by embedding ads into responses in a way that preserves contextual coherence and minimizes latency while respecting privacy and disclosure rules. It introduces a two-layer decoupled framework: (i) insertion is decoupled from response generation, ensuring explicit ads; (ii) bidding is decoupled from specific queries via a fixed set of genres, enabling offline bids and online slot-coherence estimation. The core mechanism is a VCG auction over genres that assigns ads per response using proxy genre-values and a coherence vector , with theoretical guarantees of approximately DSIC and IR (error bounded by ) and near-optimal social welfare; the welfare gap is bounded by . To estimate coherence, the authors propose two methods (sentence embeddings and LLM-as-a-Judge) and validate them against human judgments, finding that LLM-as-a-Judge (e.g., GPT-5) achieves a Spearman correlation of about with human ratings, outperforming most humans. Prototypes demonstrate real-time viability: VCG runs within seconds even for large advertiser pools and abundant slots, supporting practical deployment. Altogether, the work offers a scalable, privacy-aware path to monetizing LLM services with coherent, explicitly disclosed ads and robust welfare guarantees.

Abstract

Sustainable monetization of Large Language Models (LLMs) remains a critical open challenge. Traditional search advertising, which relies on static keywords, fails to capture the fleeting, context-dependent user intents--the specific information, goods, or services a user seeks--embedded in conversational flows. Beyond the standard goal of social welfare maximization, effective LLM advertising imposes additional requirements on contextual coherence (ensuring ads align semantically with transient user intents) and computational efficiency (avoiding user interaction latency), as well as adherence to ethical and regulatory standards, including preserving privacy and ensuring explicit ad disclosure. Although various recent solutions have explored bidding on token-level and query-level, both categories of approaches generally fail to holistically satisfy this multifaceted set of constraints. We propose a practical framework that resolves these tensions through two decoupling strategies. First, we decouple ad insertion from response generation to ensure safety and explicit disclosure. Second, we decouple bidding from specific user queries by using ``genres'' (high-level semantic clusters) as a proxy. This allows advertisers to bid on stable categories rather than sensitive real-time response, reducing computational burden and privacy risks. We demonstrate that applying the VCG auction mechanism to this genre-based framework yields approximately dominant strategy incentive compatibility (DSIC) and individual rationality (IR), as well as approximately optimal social welfare, while maintaining high computational efficiency. Finally, we introduce an "LLM-as-a-Judge" metric to estimate contextual coherence. Our experiments show that this metric correlates strongly with human ratings (Spearman's ), outperforming 80% of individual human evaluators.
Paper Structure (50 sections, 3 theorems, 30 equations, 8 figures, 2 tables)

This paper contains 50 sections, 3 theorems, 30 equations, 8 figures, 2 tables.

Key Result

Proposition 3.1

If a mechanism is DSIC and IR in the proxy setting, it is $(2\varepsilon)$-DSIC and $\varepsilon$-IR in the ground truth setting, with $\varepsilon = \varepsilon_{\mathrm{V}} + \varepsilon_{\mathrm{C}}$.

Figures (8)

  • Figure 1: Word cloud of reported concerns about LLM Ads.
  • Figure 2: Our framework for ad insertion in LLM-generated responses.
  • Figure 3: An illustration of how genres work under the matrix decomposition perspective.
  • Figure 4: Our model for advertisers' valuation and platform's coherence with genres. A genre acts as a bucket for multiple intents. The platform uses the average value $\tilde{v}_{i, g}$ as a static proxy, since the true value ${v}_{i, t}$ is impossible to process due to the extremely large intent space $\mathcal{T}$. Relying on the static proxy averages over various intents, introducing an estimation error (See \ref{['eg:genre_proxy_error']}). This error decreases as the granularity of the genre set $\mathcal{G}$ increases; in the extreme limit where genres equal intents, the proxy perfectly matches the true value.
  • Figure 5: Distribution of individual-to-group Spearman's correlation coefficient.
  • ...and 3 more figures

Theorems & Definitions (13)

  • Example 2.1
  • Example 2.2
  • Definition 2.3: Valuation Error
  • Definition 2.4: Coherence Error
  • Definition 3.1: DSIC and IR in the proxy setting
  • Definition 3.2: Approximate DSIC and IR in the ground truth setting
  • Proposition 3.1
  • proof : Proof of \ref{['prop:DSIC and IR transfer']}
  • Proposition 3.2
  • proof : Proof of \ref{['prop:welfare gap']}
  • ...and 3 more