用因果模型和信息论消除搜索推荐中的点击偏见
A Causal Information-Flow Framework for Unbiased Learning-to-Rank
- 构建因果信息流框架,用结构因果模型解析点击生成机制
- 提出偏差泄漏度量,训练时加入正则化使模型更少受偏见影响
- 支持多源偏见联合建模,适合真实场景下高偏差数据的排名学习
在网页搜索和推荐系统中,用户点击数据广泛用于训练排序模型。然而点击数据存在严重偏见:用户更可能点击靠前的结果(位置偏见)、只选择被展示的项目(选择偏见)以及更信任顶部结果(信任偏见)。若不显式建模这些偏见,就无法从点击数据中正确学习项目的真实相关性。现有无偏学习排序(ULTR)方法主要纠正位置偏见并依赖倾向性估计,但无法衡量剩余偏见、提供风险保障,也无法联合处理多种偏见来源。本文提出一种基于因果学习的新框架,结合结构因果模型(SCMs)与信息论工具。SCMs 揭示点击生成机制,帮助识别真实相关性信号;条件互信息用于度量偏见泄露到相关性估计中的程度。我们利用该度量定义严格的解耦概念,并作为正则项引入训练过程以降低偏见。此外,引入双重稳健估计器,确保更可靠的损失评估。在标准学习排序基准上的实验表明,该方法能持续减少测得的偏见泄漏,并提升排序性能,尤其在位置偏见与信任偏见等多重偏见强烈交互的真实场景中表现优异。
原文摘要 · Abstract (English)
In web search and recommendation systems, user clicks are widely used to train ranking models. However, click data is heavily biased, i.e., users tend to click higher-ranked items (position bias), choose only what was shown to them (selection bias), and trust top results more (trust bias). Without explicitly modeling these biases, the true relevance of ranked items cannot be correctly learned from clicks. Existing Unbiased Learning-to-Rank (ULTR) methods mainly correct position bias and rely on propensity estimation, but they cannot measure remaining bias, provide risk guarantees, or jointly handle multiple bias sources. To overcome these challenges, this paper introduces a novel causal learning-based ranking framework that extends ULTR by combining Structural Causal Models (SCMs) with information-theoretic tools. SCMs specify how clicks are generated and help identify the true relevance signal from click data, while conditional mutual information, measures how much bias leaks into the learned relevance estimates. We use this leakage measure to define a rigorous notion of disentanglement and include it as a regularizer during model training to reduce bias. In addition, we incorporate a causal inference estimator, i.e., doubly robust estimator, to ensure more reliable risk estimation. Experiments on standard Learning-to-Rank benchmarks show that our method consistently reduces measured bias leakage and improves ranking performance, especially in realistic scenarios where multiple biases-such as position and trust bias-interact strongly.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。