One Model, Two Markets: Bid-Aware Generative Recommendation

• URL: http://arxiv.org/abs/2603.22231v1
• Date: Mon, 23 Mar 2026 17:27:59 GMT
• Title: One Model, Two Markets: Bid-Aware Generative Recommendation
• Abstract summary: 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.
• Score: 7.863030229448138
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Generative Recommender Systems using semantic ids, such as TIGER (Rajput et al., 2023), have emerged as a widely adopted competitive paradigm in sequential recommendation. However, existing architectures are designed solely for semantic retrieval and do not address concerns such as monetization via ad revenue and incorporation of bids for commercial retrieval. We propose GEM-Rec, a unified framework that integrates commercial relevance and monetization objectives directly into the generative sequence. We introduce control tokens to decouple the decision of whether to show an ad from which item to show. This allows the model to learn valid placement patterns directly from interaction logs, which inherently reflect past successful ad placements. Complementing this, we 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. We prove that this approach guarantees allocation monotonicity, ensuring that higher bids weakly increase an ad's likelihood of being shown without requiring model retraining. Experiments demonstrate that GEM-Rec allows platforms to dynamically optimize for semantic relevance and platform revenue.

Related papers

• Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation [60.03046892817763]
  Generative recommendation is an emerging paradigm that has shown promise in industrial recommendation systems.<n>Existing methods often struggle to organize and inject complex user-behavioral and item-semantic contexts into recommendation models simultaneously.<n>We propose G2Rec, a scalable framework that unifies holistic graph-based user co-engagement modeling with semantic tokenization for industrial-scale generative recommendation.
  arXiv  Detail & Related papers  (2026-06-18T17:58:32Z)
• Model Monotonicity in Autobidding Auctions: When Do Better Predictions Lead to Better Outcomes? [1.2691047660244335]
  We study the interaction between recommender system model quality, auction format, and autobidder behavior.<n>We show that first-price auctions with uniform bidding guarantee revenue monotonicity for tCPA bidders without budgets.<n>Our findings have practical implications for advertising platforms seeking to align model improvements with business outcomes.
  arXiv  Detail & Related papers  (2026-05-29T09:09:06Z)
• LERA: LLM-Enhanced RAG for Ad Auction in Generative Chatbots [38.35931897144688]
  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.
  arXiv  Detail & Related papers  (2026-05-15T15:39:30Z)
• SoliReward: Mitigating Susceptibility to Reward Hacking and Annotation Noise in Video Generation Reward Models [53.19726629537694]
  Post-training alignment of video generation models with human preferences is a critical goal.<n>Current data collection paradigms, reliant on in-prompt pairwise annotations, suffer from labeling noise.<n>We propose SoliReward, a systematic framework for video RM training.
  arXiv  Detail & Related papers  (2025-12-17T14:28:23Z)
• 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)
• Towards Context-aware Reasoning-enhanced Generative Searching in E-commerce [61.03081096959132]
  We propose a context-aware reasoning-enhanced generative search framework for better textbfunderstanding the complicated context.<n>Our approach achieves superior performance compared with strong baselines, validating its effectiveness for search-based recommendation.
  arXiv  Detail & Related papers  (2025-10-19T16:46:11Z)
• OneRec-Think: In-Text Reasoning for Generative Recommendation [55.53292983432484]
  OneRec-Think is a unified framework that seamlessly integrates dialogue, reasoning, and personalized recommendation.<n>Our proposed "Think-Ahead" architecture enables effective industrial deployment on Kuaishou, achieving a 0.159% gain in APP Stay Time.
  arXiv  Detail & Related papers  (2025-10-13T17:20:13Z)
• 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)
• Act-With-Think: Chunk Auto-Regressive Modeling for Generative Recommendation [49.45822979879046]
  Generative recommendation (GR) typically encodes behavioral or semantic aspects of item information into discrete tokens.<n>We present Chunk AutoRegressive Modeling (CAR), a new generation paradigm following the decision pattern that users usually think semantic aspects of items.
  arXiv  Detail & Related papers  (2025-06-30T09:13:54Z)
• EGA-V2: An End-to-end Generative Framework for Industrial Advertising [19.927005856735445]
  We introduce End-to-End Generative Advertising (EGA-V2), the first unified framework that holistically models user interests, point-of-interest (POI) and creative generation, ad allocation, and payment optimization.<n>Our results highlight its potential as a pioneering fully generative advertising solution, paving the way for next-generation industrial ad systems.
  arXiv  Detail & Related papers  (2025-05-23T06:55:02Z)
• MMGRec: Multimodal Generative Recommendation with Transformer Model [81.61896141495144]
  MMGRec aims to introduce a generative paradigm into multimodal recommendation. We first devise a hierarchical quantization method Graph CF-RQVAE to assign Rec-ID for each item from its multimodal information. We then train a Transformer-based recommender to generate the Rec-IDs of user-preferred items based on historical interaction sequences.
  arXiv  Detail & Related papers  (2024-04-25T12:11:27Z)
• Advancing Ad Auction Realism: Practical Insights & Modeling Implications [2.8413290300628313]
  This paper shows that one can still gain useful insight into modern ad auctions by modeling advertisers as agents governed by an adversarial bandit algorithm. We find that soft floors yield lower revenues than suitably chosen reserve prices, even restricting attention to a single query.
  arXiv  Detail & Related papers  (2023-07-21T17:45:28Z)
• Online Learning under Budget and ROI Constraints via Weak Adaptivity [57.097119428915796]
  Existing primal-dual algorithms for constrained online learning problems rely on two fundamental assumptions. We show how such assumptions can be circumvented by endowing standard primal-dual templates with weakly adaptive regret minimizers. We prove the first best-of-both-worlds no-regret guarantees which hold in absence of the two aforementioned assumptions.
  arXiv  Detail & Related papers  (2023-02-02T16:30:33Z)

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.