VALUE: Value-Aware Large Language Model for Query Rewriting via Weighted Trie in Sponsored Search
Not on the map. Why?
Abstract (arXiv)
Query-to-bidword(i.e., bidding keyword) rewriting is fundamental to sponsored search, transforming noisy user queries into semantically relevant and commercially valuable keywords. Recent advances in large language models (LLMs) improve semantic relevance through generative retrieval frameworks, but they rarely encode the commercial value of keywords. As a result, rewrites are often semantically correct yet economically suboptimal, and a reinforcement learning from human feedback (RLHF) stage is usually added after supervised fine-tuning(SFT) to mitigate this deficiency. However, conventional preference alignment frequently overemphasize the ordering of bidword values and is susceptible to overfitting, which degrades rewrite quality. In addition, bidword value changes rapidly, while existing generative methods do not respond to these fluctuations. To address this shortcoming, we introduce VALUE(Value-Aware Large language model for qUery rewriting via wEighted trie), a framework that integrates value awareness directly into generation and enhances value alignment during training. VALUE employs the Weighted Trie, a novel variant of the classical trie that stores real-time value signals for each token. During decoding, the framework adjusts the LLM's token probabilities with these signals, constraining the search space and steering generation toward high-value rewrites. The alignment stage uses a fine-grained preference learning strategy that emphasizes stable, high-value differences and down-weights noisy or transient fluctuations, thereby improving robustness and reducing overfitting. Offline experiments show that VALUE significantly outperforms baselines in both semantic matching and value-centric metrics. VALUE has been deployed on our advertising system since October 2024 and served the Double Eleven promotions, the biggest shopping carnival in China.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 33 of its 72 references that are in the map. First posted on arXiv 25 Feb 2025.
Builds on
33 of 72 references.
References · 33
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2017Deep reinforcement learning from human preferencescited by 3,912
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2023LIMA: Less Is More for Alignmentcited by 1,100
- 2022Scaling Laws for Reward Model Overoptimizationcited by 1,095
- 2021GLM: General Language Model Pretraining with Autoregressive Blank Infillingcited by 1,031
- 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 839
- 2023Safe RLHF: Safe Reinforcement Learning from Human Feedbackcited by 656
21 more
- 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 578
- 2024ORPO: Monolithic Preference Optimization without Reference Modelcited by 562
- 2018Scalable agent alignment via reward modeling: a research directioncited by 447
- 2023How Far Can Camels Go? Exploring the State of Instruction Tuning on Open Resourcescited by 408
- 2023A Long Way to Go: Investigating Length Correlations in RLHFcited by 291
- 2023Preference Ranking Optimization for Human Alignmentcited by 285
- 2024KTO: Model Alignment as Prospect Theoretic Optimizationcited by 264
- 2017Thinking Fast and Slow with Deep Learning and Tree Searchcited by 252
- 2024Teaching Large Language Models to Reason with Reinforcement Learningcited by 160
- 2024ODIN: Disentangled Reward Mitigates Hacking in RLHFcited by 136
- 2024Direct Preference Optimization with an Offsetcited by 122
- 2024GLoRe: When, Where, and How to Improve LLM Reasoning via Global and Local Refinementscited by 103
- 2018An Improved Text Sentiment Classification Model Using TF-IDF and Next Word Negationcited by 16
- 2021Diversity driven Query Rewriting in Search Advertisingcited by 15
- 2016Scalable Semantic Matching of Queries to Ads in Sponsored Search Advertisingcited by 12
- 2020ProphetNet-Ads: A Looking Ahead Strategy for Generative Retrieval Models in Sponsored Search Enginecited by 11
- 2021Query Rewriting via Cycle-Consistent Translation for E-Commerce Searchcited by 10
- 2019Domain-Constrained Advertising Keyword Generationcited by 8
- 2022Unified Generative & Dense Retrieval for Query Rewriting in Sponsored Searchcited by 6
- 2019RPM-Oriented Query Rewriting Framework for E-commerce Keyword-Based Sponsored Searchcited by 5
- 2025IterQR: An Iterative Framework for LLM-based Query Rewrite in e-Commercial Search Systemcited by 4
Built on by
Citing papers per year: 2025: 4; 2026: 1.
5 papers.
- 2025GEM-Bench: A Benchmark for Ad-Injected Response Generation within Generative Engine Marketingcited by 7
- 2025Test-time Corpus Feedback: From Retrieval to RAGcited by 3
- 2025CardRewriter: Leveraging Knowledge Cards for Long-Tail Query Rewriting on Short-Video Platformscited by 2
- 2025When & How to Write for Personalized Demand-aware Query Rewriting in Video Searchcited by 0
- 2026CASI: Credit Assignment via Set Intervention for Agentic Retrievalcited by 0
- 2026CASI: Credit Assignment via Set Intervention for Agentic Retrieval14 Oct 2026
- 2025When & How to Write for Personalized Demand-aware Query Rewriting in Video Search17 Dec 2025
- 2025CardRewriter: Leveraging Knowledge Cards for Long-Tail Query Rewriting on Short-Video Platforms11 Oct 2025
- 2025GEM-Bench: A Benchmark for Ad-Injected Response Generation within Generative Engine Marketing17 Sep 2025
- 2025Test-time Corpus Feedback: From Retrieval to RAG21 Aug 2025
Similar, not cited
Close in wording, no citation either way
- 2026VC-Soup: Value-Consistency Guided Multi-Value Alignment for Large Language Models
- 2026Aligning Large Language Models with Searcher Preferences
- 2025QueStER: Query Specification for Generative keyword-based Retrieval
- 2026VISA: Value Injection via Shielded Adaptation for Personalized LLM Alignment
- 2025Annotation-Free Reinforcement Learning Query Rewriting via Verifiable Search Reward
- 2024RaFe: Ranking Feedback Improves Query Rewriting for RAG
- 2025Rethinking On-policy Optimization for Query Augmentation
- 2023Query Rewriting for Retrieval-Augmented Large Language Models