Personalized Query Auto-Completion for Long and Short-Term Interests with Adaptive Detoxification Generation

Query auto-completion (QAC) plays a crucial role in modern search systems.However, in real-world applications, there are two pressing challenges that still need to be addressed.First, there is a need for hierarchical personalized representations for users.Previous approaches have typically used users' search behavior as a single, overall representation, which proves inadequate in more nuanced generative scenarios.Additionally, query prefixes are typically short and may contain typos or sensitive information, increasing the likelihood of generating toxic content compared to traditional text generation tasks.Such toxic content can degrade user experience and lead to public relations issues.Therefore, the second critical challenge is detoxifying QAC systems.Recent efforts to mitigate toxicity have involved generating queries unrelated to the given prefix, leading this approach still negatively impacts user experience.To address these two limitations, we propose a novel model (LaD) that captures personalized information from both long-term and short-term interests, incorporating adaptive detoxification.In LaD, personalized information is captured hierarchically at both coarse-grained and fine-grained levels.This approach preserves as much personalized information as possible while enabling online generation within time constraints.To move a further step, we propose an online training method based on Reject Preference Optimization (RPO).By incorporating a special token [Reject] during both the training and inference processes, the model achieves adaptive detoxification.Consequently, the generated text presented to users is both non-toxic and relevant to the given prefix.We conduct comprehensive experiments on industrial-scale datasets and perform online A/B tests, delivering the largest single-experiment metric improvement in nearly two years of our product.Our model has been deployed on Kuaishou search, driving the primary traffic

Authors

Institutions

Publication Details

Published
2025-08-03
DOI
https://doi.org/10.1145/3711896.3737256
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Personalized Query Auto-Completion for Long and Short-Term Interests with Adaptive Detoxification Generation

Xiaoze Jiang, Enyun Yu, Z. H. Qin, Zhibo Wang
Distributed systems and fault tolerance
article

Personalized Query Auto-Completion for Long and Short-Term Interests with Adaptive Detoxification Generation

Xiaoze Jiang, Enyun Yu, Z. H. Qin, Zhibo Wang
article en

Abstract

Query auto-completion (QAC) plays a crucial role in modern search systems.However, in real-world applications, there are two pressing challenges that still need to be addressed.First, there is a need for hierarchical personalized representations for users.Previous approaches have typically used users' search behavior as a single, overall representation, which proves inadequate in more nuanced generative scenarios.Additionally, query prefixes are typically short and may contain typos or sensitive information, increasing the likelihood of generating toxic content compared to traditional text generation tasks.Such toxic content can degrade user experience and lead to public relations issues.Therefore, the second critical challenge is detoxifying QAC systems.Recent efforts to mitigate toxicity have involved generating queries unrelated to the given prefix, leading this approach still negatively impacts user experience.To address these two limitations, we propose a novel model (LaD) that captures personalized information from both long-term and short-term interests, incorporating adaptive detoxification.In LaD, personalized information is captured hierarchically at both coarse-grained and fine-grained levels.This approach preserves as much personalized information as possible while enabling online generation within time constraints.To move a further step, we propose an online training method based on Reject Preference Optimization (RPO).By incorporating a special token [Reject] during both the training and inference processes, the model achieves adaptive detoxification.Consequently, the generated text presented to users is both non-toxic and relevant to the given prefix.We conduct comprehensive experiments on industrial-scale datasets and perform online A/B tests, delivering the largest single-experiment metric improvement in nearly two years of our product.Our model has been deployed on Kuaishou search, driving the primary traffic

Kuaishou (China)
Climate action
Openalex Percentile: Top 79%
Distributed systems and fault tolerance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Personalized Query Auto-Completion for Long and Short-Term Interests with Adaptive Detoxification Generation — Xiaoze Jiang, Enyun Yu, et al. · (2025) | TGRS Research Map | TGRS