LERA: LLM-Enhanced RAG for Ad Auction in Generative Chatbots

• URL: http://arxiv.org/abs/2605.16474v1
• Date: Fri, 15 May 2026 15:39:30 GMT
• Title: LERA: LLM-Enhanced RAG for Ad Auction in Generative Chatbots
• Abstract summary: We propose LERA, a two-stage retrieve-then-generate auction framework for large language model (LLM)-based chatbots.<n>In the first stage, embedding-based coarse filtering pre-selects a small set of candidate advertisers.<n>In the second stage, the LLM itself is queried with a carefully designed prompt to produce logits over candidates, which serve as refined organic relevance scores.
• Score: 38.35931897144688
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The integration of advertising auction mechanisms into large language model (LLM)-based chatbots presents a significant opportunity for commercialization, yet poses unique challenges in balancing relevance, efficiency, and user experience. Recently, Feizi et al.~\citep{feizi2023online} and Hajiaghayi et al.~\citep{hajiaghayi2024ad} outlined a retrieve-then-generate paradigm that decouples retrieval and generation, offering lightweight ad insertion and payment determination. However, current retrieval relies solely on text embedding similarity, which may lead to commercial misinterpretation and issues such as repetitive insertions. In this paper, we propose LERA, a two-stage retrieve-then-generate auction framework tailored for LLM chatbots. In the first stage, embedding-based coarse filtering pre-selects a small set of candidate advertisers. In the second stage, the LLM itself is queried with a carefully designed prompt to produce logits over candidates, which serve as refined organic relevance scores. These scores are combined with bids, and a critical-value payment rule accounts for both the coarse-filtering and fine-ranking thresholds, ensuring truthfulness for utility-maximizing advertisers. The framework naturally extends to multiple ad insertions within dynamic dialogue flows and long responses. Experiments on a synthetic advertiser-query benchmark show that LERA substantially improves ad selection accuracy and insertion diversity while incurring only controllable latency overhead.

Related papers

• Unified Supervision for Walmart's Sponsored Search Retrieval via Joint Semantic Relevance and Behavioral Engagement Modeling [5.167327964319347]
  We propose a bi-encoder training framework for Walmart's sponsored search retrieval in e-commerce.<n>We use semantic relevance as the primary supervision signal, with engagement used only as a preference signal among relevant items.<n>Our approach outperforms the current production system in both offline evaluation and online AB tests.
  arXiv  Detail & Related papers  (2026-04-09T07:49:41Z)
• 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)
• Sponsored Questions and How to Auction Them [48.75306452169514]
  A key challenge is that a user's search query often leaves their true intent ambiguous.<n>The shift from traditional search to conversational AI provides a new approach.<n>We show that the VCG mechanism can be adopted to jointly optimize the sponsored suggestion and the ads that follow.
  arXiv  Detail & Related papers  (2025-12-03T17:06:27Z)
• LLMs as Sparse Retrievers:A Framework for First-Stage Product Search [103.70006474544364]
  Product search is a crucial component of modern e-commerce platforms, with billions of user queries every day.<n>Sparse retrieval methods suffer from severe vocabulary mismatch issues, leading to suboptimal performance in product search scenarios.<n>With their potential for semantic analysis, large language models (LLMs) offer a promising avenue for mitigating vocabulary mismatch issues.<n>We propose PROSPER, a framework for PROduct search leveraging LLMs as SParsE Retrievers.
  arXiv  Detail & Related papers  (2025-10-21T11:13:21Z)
• 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)
• Multi-objective Aligned Bidword Generation Model for E-commerce Search Advertising [16.8420671443003]
  Retrieval systems primarily address the challenge of matching user queries with the most relevant advertisements.<n>We propose a Multi-objective aligned Bidword Generation Model (MoBGM), which is composed of a discriminator, generator, and preference alignment module.<n>Our proposed algorithm significantly outperforms the state of the art in offline and online experiments.
  arXiv  Detail & Related papers  (2025-06-04T10:57:18Z)
• DistinctAD: Distinctive Audio Description Generation in Contexts [62.58375366359421]
  We propose DistinctAD, a framework for generating Audio Descriptions that emphasize distinctiveness to produce better narratives.<n>To address the domain gap, we introduce a CLIP-AD adaptation strategy that does not require additional AD corpora.<n>In Stage-II, DistinctAD incorporates two key innovations: (i) a Contextual Expectation-Maximization Attention (EMA) module that reduces redundancy by extracting common bases from consecutive video clips, and (ii) an explicit distinctive word prediction loss that filters out repeated words in the context.
  arXiv  Detail & Related papers  (2024-11-27T09:54:59Z)
• Self-Calibrated Listwise Reranking with Large Language Models [137.6557607279876]
  Large language models (LLMs) have been employed in reranking tasks through a sequence-to-sequence approach. This reranking paradigm requires a sliding window strategy to iteratively handle larger candidate sets. We propose a novel self-calibrated listwise reranking method, which aims to leverage LLMs to produce global relevance scores for ranking.
  arXiv  Detail & Related papers  (2024-11-07T10:31:31Z)
• RAR: Retrieving And Ranking Augmented MLLMs for Visual Recognition [78.97487780589574]
  Multimodal Large Language Models (MLLMs) excel at classifying fine-grained categories. This paper introduces a Retrieving And Ranking augmented method for MLLMs. Our proposed approach not only addresses the inherent limitations in fine-grained recognition but also preserves the model's comprehensive knowledge base.
  arXiv  Detail & Related papers  (2024-03-20T17:59:55Z)
• Detecting Generated Native Ads in Conversational Search [33.5694271503764]
  Conversational search engines such as YouChat and Microsoft Copilot use large language models (LLMs) to generate responses to queries. It is only a small step to also let the same technology insert ads within the generated responses. Inserted ads would be reminiscent of native advertising and product placement.
  arXiv  Detail & Related papers  (2024-02-07T14:22:51Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.