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:2610.14473v1 Announce Type: cross Abstract: We propose a new framework for banner ad auctions, leveraging diffusion models to allow for multiple bidders to co-win a single banner ad opportunity...
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.
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.
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.
arXiv:2605. 09448v2 Announce Type: replace Abstract: We study the operational problem of automated bidding in repeated first-price auctions under budget and return-on-spend (RoS) constraints.
UniPolicy is a multi-policy alignment framework for search advertising that jointly optimizes relevance, click propensity, and commercial value. It uses objective-specific prefix tokens, sparse MoE-LoRA routing, and residual FFNs to decouple parameters within a shared backbone, and builds pairwise preferences from multi-stage behavioral feedback to improve generation. In large-scale offline tests and a 7‑day online A/B test, UniPolicy achieved balanced gains across metrics, boosting CTR by 0.71%, RPS by 1.58%, and revenue by 1.32% while keeping latency stable.
UniPolicy is a unified objective‑specific policy framework for search advertising that jointly optimizes relevance, click propensity, and commercial value. It uses objective‑aware prefix tokens, sparse MoE‑LoRA routing, and residual FFNs to decouple parameters within a shared backbone, and constructs pairwise preferences from multi‑stage behavioral feedback to strengthen clicked candidates. In large‑scale offline tests and a 7‑day online A/B test, UniPolicy improves CTR by 0.71%, RPS by 1.58%, and advertising revenue by 1.32% while keeping serving latency stable.
The paper introduces the Latent Advertiser Mixture Auction (LAMA), a token‑level advertising framework that integrates advertiser influence directly into the text generation process. Advertisers provide local continuation values that shape next‑token policies, and the platform decodes these through a latent mixture while updating an allocation posterior. LAMA is shown to satisfy Markov DSIC and IR, achieve near‑optimal KL‑regularized welfare, and, in proof‑of‑concept experiments on commercial‑search queries, improve platform welfare and revenue without compromising user‑facing response quality.
AgenticGen is a reward‑guided framework for generating advertising videos that splits the task into strategy selection and draft generation, allowing online business feedback to supervise each stage. It learns performance‑based rewards from accumulated online metrics and rubric‑based rewards aligned with human quality standards, then applies DPO and GRPO to refine policies. Offline tests confirm the reward models, and online A/B tests on TikTok show significant gains in CTR, CVR, and advertising value over a baseline.
arXiv:2608. 04504v1 Announce Type: cross Abstract: Vision-language models excel in many multimodal tasks but remain prone to a subtle yet impactful failure mode: they tend to overestimate dominant visual-textual cues while underestimating sparse but decision-critical contextual variables.
The paper presents a reinforcement learning framework for training autonomous large language model agents to act as sellers in multi-product bargaining markets. It models the problem as a Partially Observable Markov Decision Process and introduces a structured message protocol to map natural language into a regulated decision space. Using Reinforcement Learning from Verifiable Rewards, the trained agents match limited inventory to buyers more effectively, achieving seller surplus extraction and allocation quality comparable to or better than trillion‑parameter models, and generalize to unseen market conditions.