LLM Advertisement based on Neuron Auctions

• URL: http://arxiv.org/abs/2605.08326v1
• Date: Fri, 08 May 2026 16:54:39 GMT
• Title: LLM Advertisement based on Neuron Auctions
• Abstract summary: generative advertising emerges as a crucial monetization strategy.<n>Existing methods, such as prompt injection or rigid position slots, disrupt semantic coherence.<n>We introduce Neuron Auctions, a novel paradigm that shifts the auction object from the surface text space to the LLM's internal representations.
• Score: 16.15577957062828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As Large Language Models (LLMs) transition into conversational agents, generative advertising emerges as a crucial monetization strategy. However, embedding advertisements within unstructured LLM outputs introduces a critical trilemma: balancing advertiser payoffs, platform revenue, and user experience. Existing methods, such as prompt injection or rigid position slots, disrupt semantic coherence and lack a parametric framework for independent control, rendering rigorous mechanism design intractable. To bridge this gap, we introduce Neuron Auctions, a novel paradigm that shifts the auction object from the surface text space to the LLM's internal representations. Leveraging mechanistic interpretability, we identify brand-specific feed-forward network (FFN) neurons and demonstrate that competing brands activate within approximately orthogonal subspaces. This near-perfect independence allows us to define continuous, disentangled intervention budgets (specifically, neuron counts and amplification factors) as auctionable commodities. Building on this computational carrier, we design a continuous menu-based auction mechanism that naturally guarantees strategy-proofness and optimizes revenue for the platform. By explicitly incorporating a user utility penalty into the platform's optimization objective, our framework dynamically prices out overly aggressive interventions. Extensive experiments demonstrate that Neuron Auctions effectively preserve natural discourse quality while achieving an optimal alignment between commercial incentives and user satisfaction.

Related papers

• Strategy-Aware Parameter-Efficient Adaptation for LLM-based Auto-Bidding [16.834816807572757]
  SAGE is a novel Strategy-aware Auto-bidding framework guided by LLMs for efficient bidding.<n>We show that SAGE consistently achieves superior performance while tuning less than 10% of the trainable parameters required by full fine-tuning.
  arXiv  Detail & Related papers  (2026-07-27T10:08:43Z)
• Learning to Watch: Active Video Anomaly Understanding via Interleaved Policy Optimization [56.150184676745205]
  Video anomaly understanding (VAU) relies on sparse, context-dependent cues.<n>We propose $Anomtext-$, a closed-loop framework that reconceptualizes video understanding as an active sequential decision-making process.<n>Inspired by human video-reviewing behavior, this framework unifies internal cognitive reasoning and strategic evidence acquisition into an interleaved policy.
  arXiv  Detail & Related papers  (2026-07-01T08:41:49Z)
• Latent Action Reparameterization for Efficient Agent Inference [56.42014061367112]
  We propose a framework that learns a compact latent action space in which each latent action corresponds to a multi-step semantic behavior.<n>Unlike hand-crafted macros or hierarchical controllers, latent actions are learned from agent trajectories and integrated directly into the model.
  arXiv  Detail & Related papers  (2026-05-18T16:07:44Z)
• Beyond Text-Dominance: Understanding Modality Preference of Omni-modal Large Language Models [73.89069781682032]
  We quantify modality preference of Native Omni-modal Large Language Models (OLLMs)<n>Unlike the text-dominance'' of traditional VLMs, most OLLMs exhibit a pronounced visual preference.<n>Our work provides both a mechanistic understanding and a practical tool for building more trustworthy OLLMs.
  arXiv  Detail & Related papers  (2026-04-18T08:25:52Z)
• Large Language Models as Bidding Agents in Repeated HetNet Auction [4.305340565419997]
  This paper investigates the integration of large language models (LLMs) as reasoning agents in repeated spectrum auctions within heterogeneous networks (HetNets)<n>We propose a distributed auction-based framework in which each base station (BS) independently conducts its own multi-channel auction, and user equipments (UEs) strategically decide both their association and bid values.<n> Simulation results reveal that the LLM-empowered UE achieves consistently higher channel access frequency and improved budget efficiency compared to benchmarks.
  arXiv  Detail & Related papers  (2026-03-02T07:30:01Z)
• Instruction Anchors: Dissecting the Causal Dynamics of Modality Arbitration [41.64118238383843]
  Modality following serves as the capacity of multimodal large language models to selectively utilize multimodal contexts based on user instructions.<n>We show that instruction tokens function as structural anchors for modality arbitration.<n>We identify a sparse set of specialized attention heads that drive this arbitration.
  arXiv  Detail & Related papers  (2026-02-03T15:59:24Z)
• Ad Insertion in LLM-Generated Responses [16.434649348378706]
  We propose a practical framework that resolves tensions through two decoupling strategies.<n>First, we decouple ad insertion from response generation to ensure safety and explicit disclosure.<n>Second, we decouple bidding from specific user queries by using genres'' (high-level semantic clusters) as a proxy.
  arXiv  Detail & Related papers  (2026-01-27T10:16:03Z)
• LLM-Auction: Generative Auction towards LLM-Native Advertising [10.695066036409274]
  We propose a learning-based generative auction mechanism that integrates auction and LLM generation for LLM-native advertising.<n>We introduce Iterative Reward-Preference Optimization (IRPO) algorithm that alternately optimize the reward model and the LLM.<n>We show that LLM-Auction significantly outperforms existing baselines in allocation efficiency, while achieving the desired mechanism properties.
  arXiv  Detail & Related papers  (2025-12-11T11:31:20Z)
• Finding the Sweet Spot: Trading Quality, Cost, and Speed During Inference-Time LLM Reflection [0.0]
  This paper compares self-reflection and budget tuning across mathematical reasoning and translation tasks.<n>Our analysis reveals substantial domain dependent variation in self-reflection effectiveness, with performance gains up to 220% in mathematical reasoning.<n>To validate our findings in a real-world setting, we deploy a self-reflection enhanced marketing content localisation system at Lounge by Zalando.
  arXiv  Detail & Related papers  (2025-10-23T15:26:18Z)
• Attention Illuminates LLM Reasoning: The Preplan-and-Anchor Rhythm Enables Fine-Grained Policy Optimization [56.083511902353365]
  Reinforcement learning (RL) typically applies uniform credit across an entire generation of Large language models.<n>This work positions attention as a privileged substrate that renders the internal logic of LLMs as a mechanistic blueprint of reasoning itself.<n>We introduce three novel RL strategies that dynamically perform targeted credit assignment to critical nodes.
  arXiv  Detail & Related papers  (2025-10-15T13:49:51Z)
• Explaining multimodal LLMs via intra-modal token interactions [55.27436637894534]
  Multimodal Large Language Models (MLLMs) have achieved remarkable success across diverse vision-language tasks, yet their internal decision-making mechanisms remain insufficiently understood.<n>We propose enhancing interpretability by leveraging intra-modal interaction.
  arXiv  Detail & Related papers  (2025-09-26T14:39:13Z)
• Tuning-Free Accountable Intervention for LLM Deployment -- A Metacognitive Approach [55.613461060997004]
  Large Language Models (LLMs) have catalyzed transformative advances across a spectrum of natural language processing tasks. We propose an innovative textitmetacognitive approach, dubbed textbfCLEAR, to equip LLMs with capabilities for self-aware error identification and correction.
  arXiv  Detail & Related papers  (2024-03-08T19:18:53Z)

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.