通过分层掩码微调,高效实现多目标检索的灵活权重调节。
CSMF: Cascaded Selective Mask Fine-Tuning for Multi-Objective Embedding-Based Retrieval
- 分层选择性掩码微调,为各目标保留独立学习空间。
- 零参数增加下实现多目标概率线性加权融合,支持动态调整。
- 适合需快速适配多推荐场景的工业级检索系统。
多目标嵌入式检索(EBR)因用户行为与商业目标日益复杂而愈发重要。传统方法面临数据稀疏与目标间信息共享不足问题,虽有共享网络结合专用子网络的方法缓解部分局限,却显著增加模型参数,导致检索延迟上升且难以建模目标间的因果关系。为此,本文提出分层选择性掩码微调(CSMF),在不增加网络参数或在线检索开销的前提下,通过顺序微调中目标间的级联关系,选择性掩码模型参数,释放各目标独立学习空间。该方法支持对多个目标概率进行线性加权融合,并可灵活调节各目标权重以适应不同推荐场景。在真实数据集上的实验表明,CSMF性能优异;线上实验进一步验证其显著的实用价值。
原文摘要 · Abstract (English)
Multi-objective embedding-based retrieval (EBR) has become increasingly critical due to the growing complexity of user behaviors and commercial objectives. While traditional approaches often suffer from data sparsity and limited information sharing between objectives, recent methods utilizing a shared network alongside dedicated sub-networks for each objective partially address these limitations. However, such methods significantly increase the model parameters, leading to an increased retrieval latency and a limited ability to model causal relationships between objectives. To address these challenges, we propose the Cascaded Selective Mask Fine-Tuning (CSMF), a novel method that enhances both retrieval efficiency and serving performance for multi-objective EBR. The CSMF framework selectively masks model parameters to free up independent learning space for each objective, leveraging the cascading relationships between objectives during the sequential fine-tuning. Without increasing network parameters or online retrieval overhead, CSMF computes a linearly weighted fusion score for multiple objective probabilities while supporting flexible adjustment of each objective's weight across various recommendation scenarios. Experimental results on real-world datasets demonstrate the superior performance of CSMF, and online experiments validate its significant practical value.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。