English
Related papers

Related papers: Multi-Feature Integration for Perception-Dependent…

200 papers

Most typical click models assume that the probability of a document to be examined by users only depends on position, such as PBM and UBM. It works well in various kinds of search engines. However, in a search engine where massive candidate…

Artificial Intelligence · Computer Science 2021-01-08 Ningxin Xu , Cheng Yang , Yixin Zhu , Xiaowei Hu , Changhu Wang

Accurate estimates of examination bias are crucial for unbiased learning-to-rank from implicit feedback in search engines and recommender systems, since they enable the use of Inverse Propensity Score (IPS) weighting techniques to address…

Information Retrieval · Computer Science 2019-05-27 Zhichong Fang , Aman Agarwal , Thorsten Joachims

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…

Information Retrieval · Computer Science 2025-02-19 Lulu Yu , Keping Bi , Jiafeng Guo , Shihao Liu , Dawei Yin , Xueqi Cheng

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…

Information Retrieval · Computer Science 2016-08-17 Thorsten Joachims , Adith Swaminathan , Tobias Schnabel

Leveraging biased click data for optimizing learning to rank systems has been a popular approach in information retrieval. Because click data is often noisy and biased, a variety of methods have been proposed to construct unbiased learning…

Information Retrieval · Computer Science 2020-08-21 Tao Yang , Shikai Fang , Shibo Li , Yulan Wang , Qingyao Ai

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…

Information Retrieval · Computer Science 2023-02-09 Dan Luo , Lixin Zou , Qingyao Ai , Zhiyu Chen , Dawei Yin , Brian D. Davison

An effective ranking model usually requires a large amount of training data to learn the relevance between documents and queries. User clicks are often used as training data since they can indicate relevance and are cheap to collect, but…

Information Retrieval · Computer Science 2023-02-21 Xiaojie Sun , Lulu Yu , Yiting Wang , Keping Bi , Jiafeng Guo

The purpose of modeling document relevance for search engines is to rank better in subsequent searches. Document-specific historical click-through rates can be important features in a dynamic ranking system which updates as we accumulate…

Information Retrieval · Computer Science 2024-02-06 Richard Demsyn-Jones

Learning-to-rank (LTR) algorithms are ubiquitous and necessary to explore the extensive catalogs of media providers. To avoid the user examining all the results, its preferences are used to provide a subset of relatively small size. The…

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…

Artificial Intelligence · Computer Science 2026-01-12 Haoming Gong , Qingyao Ai , Zhihao Tao , Yongfeng Zhang

Click-Through Rate (CTR) prediction is a crucial task in recommendation systems, online searches, and advertising platforms, where accurately capturing users' real interests in content is essential for performance. However, existing methods…

Multi-task learning for various real-world applications usually involves tasks with logical sequential dependence. For example, in online marketing, the cascade behavior pattern of $impression \rightarrow click \rightarrow conversion$ is…

Information Retrieval · Computer Science 2023-05-03 Yunpeng Weng , Xing Tang , Liang Chen , Xiuqiang He

Recent advances in cross-prompt automated essay scoring (AES) typically train models jointly on all source prompts, often requiring additional access to unlabeled target prompt essays simultaneously. However, using all sources is suboptimal…

Computation and Language · Computer Science 2025-05-27 Sanwoo Lee , Kun Liang , Yunfang Wu

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…

Information Retrieval · Computer Science 2024-05-16 Philipp Hager , Romain Deffayet , Jean-Michel Renders , Onno Zoeter , Maarten de Rijke

Errors might not have the same consequences depending on the task at hand. Nevertheless, there is limited research investigating the impact of imbalance in the contribution of different features in an error vector. Therefore, we propose the…

Machine Learning · Computer Science 2022-07-12 Xavier F. Cadet , Sara Ahmadi-Abhari , Hamed Haddadi

Click-through data has proven to be a valuable resource for improving search-ranking quality. Search engines can easily collect click data, but biases introduced in the data can make it difficult to use the data effectively. In order to…

Machine Learning · Computer Science 2020-02-13 Yingcheng Sun , Richard Kolacinski , Kenneth Loparo

Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit relevance feedback for improving and personalizing search engines. However, it is well known that the probability of a user clicking on a result is…

Information Retrieval · Computer Science 2007-05-23 Filip Radlinski , Thorsten Joachims

Extracting query-document relevance from the sparse, biased clickthrough log is among the most fundamental tasks in the web search system. Prior art mainly learns a relevance judgment model with semantic features of the query and document…

Information Retrieval · Computer Science 2022-08-17 Lixin Zou , Changying Hao , Hengyi Cai , Suqi Cheng , Shuaiqiang Wang , Wenwen Ye , Zhicong Cheng , Simiu Gu , Dawei Yin

Fusing and ranking multimodal information remains always a challenging task. A robust decision-level fusion method should not only be dynamically adaptive for assigning weights to each representation but also incorporate inter-relationships…

Information Retrieval · Computer Science 2018-11-29 Dimitris Gkoumas , Dawei Sogn

Selecting appropriate training data is crucial for effective instruction fine-tuning of large language models (LLMs), which aims to (1) elicit strong capabilities, and (2) achieve balanced performance across a diverse range of tasks.…

Computation and Language · Computer Science 2025-01-22 Qirun Dai , Dylan Zhang , Jiaqi W. Ma , Hao Peng
‹ Prev 1 2 3 10 Next ›