arXiv:2412.19069cs.LGcs.CR2024-12

联邦在线排序提升隐私保护下的推荐效果

Effective and secure federated online learning to rank

  • 在联邦学习框架下实现在线排序模型持续更新
  • 解决跨客户端数据分布不均与攻击脆弱性问题
  • 适合关注隐私安全与可撤销训练的推荐系统开发者

在线学习排序(OLTR)利用点击等隐式用户反馈持续优化排序模型,克服了传统学习排序依赖人工标注、难以反映真实用户偏好和响应意图变化的缺陷。然而,传统OLTR需收集用户查询与点击数据,引发隐私担忧。联邦在线学习排序(FOLTR)将OLTR嵌入联邦学习框架,避免原始数据共享,提升隐私保护。但现有FOLTR方法在排序效果、跨客户端数据分布鲁棒性、抗攻击能力以及客户交互数据可撤销性方面仍存在不足。本文对联邦在线学习排序进行系统研究,全面提升其有效性、鲁棒性、安全性和可遗忘能力,拓展了该领域的技术边界。

原文摘要 · Abstract (English)

Online Learning to Rank (OLTR) optimises ranking models using implicit user feedback, such as clicks. Unlike traditional Learning to Rank (LTR) methods that rely on a static set of training data with relevance judgements to learn a ranking model, OLTR methods update the model continually as new data arrives. Thus, it addresses several drawbacks such as the high cost of human annotations, potential misalignment between user preferences and human judgments, and the rapid changes in user query intents. However, OLTR methods typically require the collection of searchable data, user queries, and clicks, which poses privacy concerns for users. Federated Online Learning to Rank (FOLTR) integrates OLTR within a Federated Learning (FL) framework to enhance privacy by not sharing raw data. While promising, FOLTR methods currently lag behind traditional centralised OLTR due to challenges in ranking effectiveness, robustness with respect to data distribution across clients, susceptibility to attacks, and the ability to unlearn client interactions and data. This thesis presents a comprehensive study on Federated Online Learning to Rank, addressing its effectiveness, robustness, security, and unlearning capabilities, thereby expanding the landscape of FOLTR.

联邦学习在线排序隐私保护

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。