arXiv:2610.34917v1 Announce Type: new
Abstract: Diffusion models enable multiple advertisers to compete for exposure within a shared generated image. Yet existing approaches are computationally costl...
By Yijie Su, Ruiyang Si, Tonghan Wang
Diffusion models enable multiple advertisers to compete for exposure within a shared generated image. Yet existing approaches are computationally costly when generating images under varying target-sha...
arXiv:2607. 27265v1 Announce Type: new Abstract: Real-time bidding is central to computational advertising, comprising three elements: Supply Side Platform (SSP) selling ad impressions, Demand Side Platform (DSP) bidding for advertisers, and Ad Exchange conducting auctions between them.
By Shengtian Yang, Yewen Li, Peng Jiang, Zhiyi Lyu, Bo An, Peng Jiang, Qingpeng Cai, Lei Feng
arXiv:2412.06167v2 Announce Type: replace
Abstract: In digital advertising, demand-side platforms (DSPs) allow advertisers to create multiple ad creatives from a single photo for real-time bidding. W...
By Ruizhi Wang, Yu Rong, Kai Liu, Bingjie Li, Qingpeng Cai, Fei Pan, Peng Jiang
The paper introduces LLM‑Auction, a learning‑based generative auction mechanism that integrates ad allocation with large language model (LLM) generation. It redefines the auction object from discrete ad slots to distributions over LLM outputs, aligning allocation with advertiser value and user experience while inherently modeling allocation externalities without extra inference cost. The authors prove allocation monotonicity and continuity, show a first‑price payment rule has favorable incentive properties, and demonstrate state‑of‑the‑art allocation efficiency in a simulated LLM‑as‑a‑judge environment.
By Chujie Zhao, Qun Hu, Shiping Song, Dagui Chen, Han Zhu, Jian Xu, Bo Zheng
arXiv:2608. 00123v1 Announce Type: cross Abstract: LLM-native advertising embeds sponsored content directly into model-generated responses, shifting the unit of sale from a fixed slot to a moment within an evolving conversation.
By Yan Fang, Jialin Chen, Chun Gan, Hang Yu, Mingjun Nie, Yeyu Zhang, Fengxiang He, Ching Law
Generative AI assistants are becoming an advertising medium, embedding sponsored content in their answers. This setting departs from classical position auctions in two ways: an ad's click-through rate...
arXiv:2604. 05845v2 Announce Type: replace-cross Abstract: Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints such as target return on investment and budget.
By Linghui Meng, Chun Gan, Shengsheng Niu, Chengcheng Zhang, Chenchen Li, Chuan Yang, Yi Mao, Xin Zhu, Jie He, Zhangang Lin, Ching Law
arXiv:2510. 15238v2 Announce Type: replace-cross Abstract: Optimizing a single advertising campaign across heterogeneous channels is a central challenge in industrial autobidding.
By Qi Li, Wendong Huang, Qichen Ye, Wutong Xu, Cheems Wang, Wei Yuan, Miao Xu, Zhiyu Mou, Guan Wang, Rongquan Bai, Chuan Yu, Jian Xu
arXiv:2606. 09896v1 Announce Type: cross Abstract: In modern online advertising platforms, Guaranteed Delivery (GD) contracts coexist and bid with Real-Time Bidding (RTB) auctions.
By Tianxing Bu, Zhaoqi Zhang, Linyou Cai, Miao Xie, Shengri Xue, Tan Qu, Qianlong Xie, Xingxing Wang, Siqiang Luo, Gao Cong
The paper introduces Diffusion LAIR, a listwise preference optimization technique that leverages continuous reward scores instead of binary pairwise comparisons to align text‑to‑image diffusion models. LAIR transforms reward scores into centered advantage weights and optimizes an advantage‑weighted regression objective on an implicit reward defined by denoising‑loss improvement over a reference model, with a quadratic penalty to regulate reward magnitude. Experiments demonstrate that Diffusion LAIR surpasses strong baseline methods on SD1.5 and SDXL across generation, compositional, and editing tasks.
By Austin Wang, Jiaqi Han, Stefano Ermon, Yisong Yue
arXiv:2610.20587v1 Announce Type: cross
Abstract: An agentic market is a decentralized serving-time market where AI agents bid to claim each user prompt. An agent's bid is based on its expected value...
By Shubhendu Trivedi, Jacob Eisenstein, Alekh Agarwal, Ian Gemp, Michael Kaisers, Adam Fisch