用字典树引导大模型生成视频相关搜索词,提升推荐精准度。
GREAT: Guiding Query Generation with a Trie for Recommending Related Search about Video at Kuaishou

- 基于高曝光点击词构建查询字典树,指导大模型生成
- 在快手真实数据集上显著提升查询相关性与点击率
- 适合做视频平台搜索推荐的算法研发人员参考
短视频平台已成为用户获取信息和分享体验的主要渠道。为满足用户浏览视频时的信息获取需求,部分应用在视频底部引入搜索入口,并推荐相关查询词,这被称为视频相关搜索中的查询推荐,核心任务是物品到查询(I2Q)推荐。由于该场景近年才出现,学术研究与公开数据集均十分匮乏。为此,本文首次系统分析该场景挑战,并发布基于快手真实数据的大型数据集KuaiRS。现有方法依赖嵌入向量计算相似度,缺乏语义内容与查询间的深度交互。本文提出一种基于大语言模型的新型框架GREAT,通过查询导向的字典树(trie)引导查询生成。首先,收集高曝光、高点击率的优质查询构建查询字典树;训练阶段,利用该字典树增强大模型生成高质量查询的能力;推理阶段,字典树作为生成过程的引导机制;最后,通过后处理模块进一步优化物品与查询间的相关性与表达质量。大量离线与在线实验验证了方法的有效性。
原文摘要 · Abstract (English)
Currently, short video platforms have become the primary place for individuals to share experiences and obtain information. To better meet users' needs for acquiring information while browsing short videos, some apps have introduced a search entry at the bottom of videos, accompanied with recommended relevant queries. This scenario is known as query recommendation in video-related search, where core task is item-to-query (I2Q) recommendation. As this scenario has only emerged in recent years, there is a notable scarcity of academic research and publicly available datasets in this domain. To address this gap, we systematically examine the challenges associated with this scenario for the first time. Subsequently, we release a large-scale dataset derived from real-world data pertaining to the query recommendation in video-\textit{\textbf{r}}elated \textit{\textbf{s}}earch on the \textit{\textbf{Kuai}}shou app (\textbf{KuaiRS}). Presently, existing methods rely on embeddings to calculate similarity for matching short videos with queries, lacking deep interaction between the semantic content and the query. In this paper, we introduce a novel LLM-based framework named \textbf{GREAT}, which \textit{\textbf{g}}uides que\textit{\textbf{r}}y g\textit{\textbf{e}}ner\textit{\textbf{a}}tion with a \textit{\textbf{t}}rie to address I2Q recommendation in related search. Specifically, we initially gather high-quality queries with high exposure and click-through rate to construct a query-based trie. During training, we enhance the LLM's capability to generate high-quality queries using the query-based trie. In the inference phase, the query-based trie serves as a guide for the token generation. Finally, we further refine the relevance and literal quality between items and queries via a post-processing module. Extensive offline and online experiments demonstrate the effectiveness of our proposed method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。