中文
相关论文

相关论文: Analysis of Multivariate Scoring Functions for Aut…

200 篇论文

Unbiased Learning to Rank (ULTR) that learns to rank documents with biased user feedback data is a well-known challenge in information retrieval. Existing methods in unbiased learning to rank typically rely on click modeling or inverse…

信息检索 · 计算机科学 2023-02-09 Dan Luo , Lixin Zou , Qingyao Ai , Zhiyu Chen , Dawei Yin , Brian D. Davison

Learning to rank systems has become an important aspect of our daily life. However, the implicit user feedback that is used to train many learning to rank models is usually noisy and suffered from user bias (i.e., position bias). Thus,…

信息检索 · 计算机科学 2021-08-12 Anh Tran , Tao Yang , Qingyao Ai

Unbiased learning to rank (ULTR), which aims to learn unbiased ranking models from biased user behavior logs, plays an important role in Web search. Previous research on ULTR has studied a variety of biases in users' clicks, such as…

信息检索 · 计算机科学 2025-08-29 Zechun Niu , Lang Mei , Liu Yang , Ziyuan Zhao , Qiang Yan , Jiaxin Mao , Ji-Rong Wen

Unbiased learning to rank (ULTR) aims to mitigate various biases existing in user clicks, such as position bias, trust bias, presentation bias, and learn an effective ranker. In this paper, we introduce our winning approach for the…

信息检索 · 计算机科学 2023-02-16 Lulu Yu , Yiting Wang , Xiaojie Sun , Keping Bi , Jiafeng Guo

The goal of unbiased learning to rank (ULTR) is to leverage implicit user feedback for optimizing learning-to-rank systems. Among existing solutions, automatic ULTR algorithms that jointly learn user bias models (i.e., propensity models)…

信息检索 · 计算机科学 2023-07-11 Dan Luo , Lixin Zou , Qingyao Ai , Zhiyu Chen , Chenliang Li , Dawei Yin , Brian D. Davison

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…

人工智能 · 计算机科学 2026-01-12 Haoming Gong , Qingyao Ai , Zhihao Tao , Yongfeng Zhang

How to obtain an unbiased ranking model by learning to rank with biased user feedback is an important research question for IR. Existing work on unbiased learning to rank (ULTR) can be broadly categorized into two groups -- the studies on…

信息检索 · 计算机科学 2020-12-03 Qingyao Ai , Tao Yang , Huazheng Wang , Jiaxin Mao

Unbiased learning-to-rank (ULTR) is a well-established framework for learning from user clicks, which are often biased by the ranker collecting the data. While theoretically justified and extensively tested in simulation, ULTR techniques…

信息检索 · 计算机科学 2024-05-16 Philipp Hager , Romain Deffayet , Jean-Michel Renders , Onno Zoeter , Maarten de Rijke

The unbiased learning to rank (ULTR) problem has been greatly advanced by recent deep learning techniques and well-designed debias algorithms. However, promising results on the existing benchmark datasets may not be extended to the…

人工智能 · 计算机科学 2022-09-21 Lixin Zou , Haitao Mao , Xiaokai Chu , Jiliang Tang , Wenwen Ye , Shuaiqiang Wang , Dawei Yin

Although click data is widely used in search systems in practice, so far the inherent bias, most notably position bias, has prevented it from being used in training of a ranker for search, i.e., learning-to-rank. Recently, a number of…

信息检索 · 计算机科学 2019-02-28 Ziniu Hu , Yang Wang , Qu Peng , Hang Li

In learning-to-rank for information retrieval, a ranking model is automatically learned from the data and then utilized to rank the sets of retrieved documents. Therefore, an ideal ranking model would be a mapping from a document set to a…

信息检索 · 计算机科学 2020-05-08 Liang Pang , Jun Xu , Qingyao Ai , Yanyan Lan , Xueqi Cheng , Jirong Wen

Unbiased learning to rank (ULTR) aims to train an unbiased ranking model from biased user click logs. Most of the current ULTR methods are based on the examination hypothesis (EH), which assumes that the click probability can be factorized…

信息检索 · 计算机科学 2022-06-14 Mouxiang Chen , Chenghao Liu , Zemin Liu , Jianling Sun

Most existing unbiased learning-to-rank (ULTR) approaches are based on the user examination hypothesis, which assumes that users will click a result only if it is both relevant and observed (typically modeled by position). However, in…

信息检索 · 计算机科学 2025-02-19 Lulu Yu , Keping Bi , Jiafeng Guo , Shihao Liu , Dawei Yin , Xueqi Cheng

The page presentation biases in the information retrieval system, especially on the click behavior, is a well-known challenge that hinders improving ranking models' performance with implicit user feedback. Unbiased Learning to Rank~(ULTR)…

信息检索 · 计算机科学 2024-06-14 Haitao Mao , Lixin Zou , Yujia Zheng , Jiliang Tang , Xiaokai Chu , Jiashu Zhao , Qian Wang , Dawei Yin

Online learning to rank (OLTR) aims to learn a ranker directly from implicit feedback derived from users' interactions, such as clicks. Clicks however are a biased signal: specifically, top-ranked documents are likely to attract more clicks…

信息检索 · 计算机科学 2022-01-06 Shengyao Zhuang , Zhihao Qiao , Guido Zuccon

Implicit feedback (e.g., clicks, dwell times, etc.) is an abundant source of data in human-interactive systems. While implicit feedback has many advantages (e.g., it is inexpensive to collect, user centric, and timely), its inherent biases…

信息检索 · 计算机科学 2016-08-17 Thorsten Joachims , Adith Swaminathan , Tobias Schnabel

Learning to rank with biased click data is a well-known challenge. A variety of methods has been explored to debias click data for learning to rank such as click models, result interleaving and, more recently, the unbiased learning-to-rank…

信息检索 · 计算机科学 2018-04-25 Qingyao Ai , Keping Bi , Cheng Luo , Jiafeng Guo , W. Bruce Croft

Unbiased learning to rank (ULTR) studies the problem of mitigating various biases from implicit user feedback data such as clicks, and has been receiving considerable attention recently. A popular ULTR approach for real-world applications…

信息检索 · 计算机科学 2023-06-06 Yunan Zhang , Le Yan , Zhen Qin , Honglei Zhuang , Jiaming Shen , Xuanhui Wang , Michael Bendersky , Marc Najork

Learning-to-Rank (LTR) models trained from implicit feedback (e.g. clicks) suffer from inherent biases. A well-known one is the position bias -- documents in top positions are more likely to receive clicks due in part to their position…

信息检索 · 计算机科学 2020-07-21 Mucun Tian , Chun Guo , Vito Ostuni , Zhen Zhu

It is a well-known challenge to learn an unbiased ranker with biased feedback. Unbiased learning-to-rank(LTR) algorithms, which are verified to model the relative relevance accurately based on noisy feedback, are appealing candidates and…

信息检索 · 计算机科学 2023-03-09 Yi Ren , Hongyan Tang , Siwen Zhu
‹ 上一页 1 2 3 10 下一页 ›