arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.06263cs.GTcs.AIcs.IRcs.LG
收藏

面向激励的多保真度优化用于大语言模型生成广告

Incentive-Aware Multi-Fidelity Optimization for Generative Advertising in Large Language Models

Carnegie Mellon University(卡内基梅隆大学);Adelaide University(阿德莱德大学);University of Oxford(牛津大学);Harvard University(哈佛大学)

Jiayuan Liu, Barry Wang, Jiarui Gan, Tonghan Wang, Leon Xie, Mingyu Guo, Vincent Conitzer

AI总结:

本文提出IAMFM框架,结合VCG激励与多保真度优化,解决生成广告中广告商策略行为和高成本的约束问题,通过主动反事实优化提升计算效率,实验表明其在不同预算下优于单保真度基线。

摘要:

在大语言模型(LLM)响应中生成广告需要在两个严格约束下优化赞助配置:广告商的战略行为和随机生成的高成本。为此,我们提出面向激励的多保真度机制(IAMFM),一种将维克利率克-克劳斯-格罗夫斯(VCG)激励与多保真度优化相结合的统一框架,以最大化预期社会福利。我们比较了两种算法实例(淘汰式和模型式),揭示了其预算依赖的性能权衡。关键在于为了使VCG计算可行,我们引入主动反事实优化,一种“热启动”方法,利用优化数据进行高效支付计算。我们为近似策略证明性和个体理性提供形式保证,建立了一种通用的激励对齐、预算约束的生成过程方法。实验表明,IAMFM在多样化的预算下均优于单保真度基线。

英文摘要:

Generative advertising in large language model (LLM) responses requires optimizing sponsorship configurations under two strict constraints: the strategic behavior of advertisers and the high cost of stochastic generations. To address this, we propose the Incentive-Aware Multi-Fidelity Mechanism (IAMFM), a unified framework coupling Vickrey-Clarke-Groves (VCG) incentives with Multi-Fidelity Optimization to maximize expected social welfare. We compare two algorithmic instantiations (elimination-based and model-based), revealing their budget-dependent performance trade-offs. Crucially, to make VCG computationally feasible, we introduce Active Counterfactual Optimization, a "warm-start" approach that reuses optimization data for efficient payment calculation. We provide formal guarantees for approximate strategy-proofness and individual rationality, establishing a general approach for incentive-aligned, budget-constrained generative processes. Experiments demonstrate that IAMFM outperforms single-fidelity baselines across diverse budgets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑