Skip to content

Strategy-Aware Parameter-Efficient Adaptation for LLM-based Auto-Bidding

Jul 2026 · arXiv.org · Vol abs/2607.24232 · 1 citation · 58 references
Computer Science

TL;DR

SAGE introduces a parameter-efficient multi-modal alignment framework for constrained auto-bidding with Large Language Models, demonstrating that SAGE consistently achieves superior performance while tuning less than 10% of the trainable parameters required by full fine-tuning.

Abstract

Advertising bidding has evolved from manual strategies to auto-bidding systems better adapted for large-scale, dynamic auction environments. While recent advances in Large Language Models (LLMs) offer strong reasoning for auto-bidding, existing methods suffer from shallow trajectory-text interactions and require costly fine-tuning, hindering the efficient use of pretrained knowledge under diverse constraints. To address these challenges, we propose SAGE, a novel Strategy-aware Auto-bidding framework Guided by LLMs for Efficient bidding. SAGE introduces a parameter-efficient multi-modal alignment framework for constrained auto-bidding with LLMs. Specifically, SAGE comprises three key components: (i) the position augmentation module adopts temporal-semantic positional embeddings to effectively capture the intrinsic dynamics and semantic structures; (ii) the text alignment module leverages gated cross-attention to align the embedding spaces of trajectory and text modalities, enabling effective multi-modal fusion while alleviating the computational overhead caused by long trajectories; (iii) the constraint-gated LoRA module employs constraints as routing signals, activating only a small subset of experts to adapt the behavior of a frozen LLM efficiently. Extensive experiments on large-scale auto-bidding benchmark demonstrate that SAGE consistently achieves superior performance while tuning less than 10% of the trainable parameters required by full fine-tuning. Ablation studies further validate the critical contribution of each component to the framework's overall performance.

View source

Similar papers

Book Open access Aug 2026

GRB: A Generative Reinforcement Bidding Framework for Multi-Channel Online Advertising

GRB (Generative Reinforcement Bidding) is introduced, a large-scale generative bidding framework with an Offline-to-On-Policy (O2P) training paradigm that consistently outperforms strong online and offline baselines and incorporates an adaptive constrained exploration module to mitigate reward hacking.

Hongchang Wu, Weitong Ou, Heng-Quan Guo et al. · 0 citations
Book Open access Aug 2026

CES: Combinatorial Experts Selection via Contextual Linear Bandits

This work proposes an offline-to-online combinatorial experts selection (CES) framework that leverages offline evaluation to warm-start model capability estimation and employs online learning to adapt to capability shifts and correct offline inaccuracies.

Jinkun Xu, Minghan Wang, Zhiyong Wang et al. · 0 citations
Preprint Aug 2026

LangBP: Language-Guided Reasoning and Acting for Joint Bidding and Pricing

LangBP is proposed, a hierarchical framework for language-guided joint bidding and pricing that outperforms strong baselines, and online A/B tests further demonstrate business gains in real-world deployment on a large-scale e-commerce platform.

Jian-Qing Ding, Chuan Yang, Linghui Meng et al. · 0 citations
Preprint Aug 2026

Beyond the Vacuum: Combinatorial Strategy Selection for Competitor-Aware Generative Engine Optimization

This work formalizes GEO as a competitor-aware strategy selection problem and proposes a two-phase pipeline to solve it, which achieves state-of-the-art performance across several impression metrics over existing agentic and single-heuristic methods on both geo-bench and the authors' synthetically augmented competitive...

Vaibhav Sourirajan, Yao Zhang, Himanshu Kumar et al. · 0 citations
Preprint Aug 2026

Empowering Compact LLMs with Fusion of Layer-wise Exits for Recommendation

The Fusion of Layer-wise Exits for Sequential Recommendation (FLEXRec), a discriminative framework that enhances compact LLMs while retaining scalable full-corpus ranking and achieves state-of-the-art accuracy among competing methods while remaining highly efficient.

Xurong Liang, Tong Chen, Q. Nguyen et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Difficulty-Adaptive Tree-Structured Policy Optimization for Expanding Reasoning Coverage in RLVR

DATPO (Difficulty-Adaptive Sentence-entropy-guided Tree-structured Policy Optimization) integrates difficulty-adaptive tree search with a sibling-diversity advantage term, explicitly promoting semantic diversity to expand reasoning coverage during training.

Young Kyu Yu, Sanghwan Jang, Hwanjo Yu · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.