用语言模型提升广告自动出价的可控性与泛化能力
On the Role of Language Representations in Auto-Bidding: Findings and Implications

- 将语言语义作为令牌注入出价轨迹,实现语义与数值融合
- 在多种预算条件下,性能优于现有强化学习与生成模型方法
- 适合需要策略控制和跨场景泛化的广告投放场景
自动出价是实时广告市场中的关键任务,需在预算和目标成本(CPA)约束下优化长期价值。现有方法依赖紧凑的数值状态表示,虽能隐式捕捉投放动态,但难以显式表达高层意图、反馈变化及人工策略指导。大型语言模型(LLMs)具备编码语义信息的能力,但其何时有效以及如何集成而不损失数值精度仍不明确。通过系统性初步研究发现:(1)LLM嵌入包含相关出价线索,但无法替代数值特征;(2)仅通过精细的语义-数值融合才能带来收益,而非简单拼接。基于此,我们提出新框架SemBid,将LLM编码的语义以令牌形式注入离线出价轨迹。引入三种语义输入:任务(Task)、历史(History)与策略(Strategy),并与数值轨迹令牌一同输入,利用自注意力机制融合,显著提升策略可控性与多目标泛化能力。在多样场景与预算设置下,SemBid超越多个先进基线,在整体表现、约束满足率与鲁棒性上均有更稳定提升。
原文摘要 · Abstract (English)
Auto-bidding is a crucial task in real-time advertising markets, where policies must optimize long-horizon value under delivery constraints (e.g., budget and CPA). Existing methods for auto-bidding rely on compact numerical state representations: while they can implicitly capture delivery dynamics, they offer limited support for explicitly representing and controlling high-level intent, evolving feedback, and operator-style strategic guidance in real campaigns. Meanwhile, Large Language Models (LLMs) offer a powerful method for encoding semantic information, it remains unclear when LLMs help and how to integrate them without sacrificing numerical precision. Through systematic preliminary studies, we find that (1) LLM embeddings contain bidding-relevant cues yet cannot replace numerical features, and (2) gains emerge only with careful semantic--numeric integration rather than naive concatenation. Motivated by these findings, we propose \textit{SemBid}, a novel auto-bidding framework that injects LLM-encoded semantics into offline bidding trajectories at the token level. SemBid introduces three semantic inputs: \textit{Task}, \textit{History}, and \textit{Strategy}. It injects these semantics as tokens alongside numerical trajectory tokens and uses self-attention to integrate them, improving controllability and generalization across objectives. Across diverse scenarios and budget regimes, SemBid outperforms competitive baselines from offline RL and generative sequence modeling, with more consistent gains in overall performance, constraint satisfaction, and robustness. Our code is available at: \href{https://github.com/AlanYu04/SemBid-KDD2026}{\textcolor{blue}{here}}.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。