Position bias in features

• URL: http://arxiv.org/abs/2402.02626v1
• Date: Sun, 4 Feb 2024 22:15:30 GMT
• Title: Position bias in features
• Authors: Richard Demsyn-Jones
• Abstract summary: Document-specific historical click-through rates can be important features in a dynamic ranking system. This paper describes the properties of several such features, and tests them in controlled experiments.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 more sample. This paper describes the properties of several such features, and tests them in controlled experiments. Extending the inverse propensity weighting method to documents creates an unbiased estimate of document relevance. This feature can approximate relevance accurately, leading to near-optimal ranking in ideal circumstances. However, it has high variance that is increasing with respect to the degree of position bias. Furthermore, inaccurate position bias estimation leads to poor performance. Under several scenarios this feature can perform worse than biased click-through rates. This paper underscores the need for accurate position bias estimation, and is unique in suggesting simultaneous use of biased and unbiased position bias features.

Related papers

• Eliminating Position Bias of Language Models: A Mechanistic Approach [119.34143323054143]
  Position bias has proven to be a prevalent issue of modern language models (LMs) Our mechanistic analysis attributes the position bias to two components employed in nearly all state-of-the-art LMs: causal attention and relative positional encodings. By eliminating position bias, models achieve better performance and reliability in downstream tasks, including LM-as-a-judge, retrieval-augmented QA, molecule generation, and math reasoning.
  arXiv  Detail & Related papers  (2024-07-01T09:06:57Z)
• Measuring and Addressing Indexical Bias in Information Retrieval [69.7897730778898]
  PAIR framework supports automatic bias audits for ranked documents or entire IR systems. After introducing DUO, we run an extensive evaluation of 8 IR systems on a new corpus of 32k synthetic and 4.7k natural documents. A human behavioral study validates our approach, showing that our bias metric can help predict when and how indexical bias will shift a reader's opinion.
  arXiv  Detail & Related papers  (2024-06-06T17:42:37Z)
• Mitigate Position Bias in Large Language Models via Scaling a Single Dimension [47.792435921037274]
  This paper first explores the micro-level manifestations of position bias, concluding that attention weights are a micro-level expression of position bias. It further identifies that, in addition to position embeddings, causal attention mask also contributes to position bias by creating position-specific hidden states. Based on these insights, we propose a method to mitigate position bias by scaling this positional hidden states.
  arXiv  Detail & Related papers  (2024-06-04T17:55:38Z)
• Mitigate Position Bias with Coupled Ranking Bias on CTR Prediction [40.9668016608627]
  Most existing methods ignore the widely coupled ranking bias, which is also related to the placing position of the item. We show how this widely coexisted ranking bias deteriorates the performance of the existing position bias estimation methods. To mitigate the position bias with the presence of the ranking bias, we propose a novel position bias estimation method, namely gradient, which fuses two estimation methods using a fusing weight.
  arXiv  Detail & Related papers  (2024-05-29T10:31:53Z)
• Whole Page Unbiased Learning to Rank [59.52040055543542]
  Unbiased Learning to Rank(ULTR) algorithms are proposed to learn an unbiased ranking model with biased click data. We propose a Bias Agnostic whole-page unbiased Learning to rank algorithm, named BAL, to automatically find the user behavior model. Experimental results on a real-world dataset verify the effectiveness of the BAL.
  arXiv  Detail & Related papers  (2022-10-19T16:53:08Z)
• Improving Evaluation of Debiasing in Image Classification [29.711865666774017]
  Our study indicates several issues need to be improved when conducting evaluation of debiasing in image classification. Based on such issues, this paper proposes an evaluation metric Align-Conflict (AC) score' for the tuning criterion. We believe our findings and lessons inspire future researchers in debiasing to further push state-of-the-art performances with fair comparisons.
  arXiv  Detail & Related papers  (2022-06-08T05:24:13Z)
• Cross Pairwise Ranking for Unbiased Item Recommendation [57.71258289870123]
  We develop a new learning paradigm named Cross Pairwise Ranking (CPR) CPR achieves unbiased recommendation without knowing the exposure mechanism. We prove in theory that this way offsets the influence of user/item propensity on the learning.
  arXiv  Detail & Related papers  (2022-04-26T09:20:27Z)
• Unbiased Pairwise Learning to Rank in Recommender Systems [4.058828240864671]
  Unbiased learning to rank algorithms are appealing candidates and have already been applied in many applications with single categorical labels. We propose a novel unbiased LTR algorithm to tackle the challenges, which innovatively models position bias in the pairwise fashion. Experiment results on public benchmark datasets and internal live traffic show the superior results of the proposed method for both categorical and continuous labels.
  arXiv  Detail & Related papers  (2021-11-25T06:04:59Z)
• Mitigating the Position Bias of Transformer Models in Passage Re-Ranking [12.526786110360622]
  Supervised machine learning models and their evaluation strongly depends on the quality of the underlying dataset. We observe a bias in the position of the correct answer in the text in two popular Question Answering datasets used for passage re-ranking. We demonstrate that by mitigating the position bias, Transformer-based re-ranking models are equally effective on a biased and debiased dataset.
  arXiv  Detail & Related papers  (2021-01-18T10:38:03Z)
• Incorporating Vision Bias into Click Models for Image-oriented Search Engine [51.192784793764176]
  In this paper, we assume that vision bias exists in an image-oriented search engine as another crucial factor affecting the examination probability aside from position. We use regression-based EM algorithm to predict the vision bias given the visual features extracted from candidate documents.
  arXiv  Detail & Related papers  (2021-01-07T10:01:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.