Federated Unbiased Learning to Rank
- URL: http://arxiv.org/abs/2105.04761v1
- Date: Tue, 11 May 2021 03:01:14 GMT
- Title: Federated Unbiased Learning to Rank
- Authors: Chang Li and Hua Ouyang
- Abstract summary: Unbiased Learning to Rank (ULTR) studies the problem of learning a ranking function based on biased user interactions.
In this paper, we consider an on-device search setting, where users search against their personal corpora on their local devices.
We propose the FedIPS algorithm, which learns from user interactions on-device under the coordination of a central server.
- Score: 3.125116096130909
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Unbiased Learning to Rank (ULTR) studies the problem of learning a ranking
function based on biased user interactions. In this framework, ULTR algorithms
have to rely on a large amount of user data that are collected, stored, and
aggregated by central servers.
In this paper, we consider an on-device search setting, where users search
against their personal corpora on their local devices, and the goal is to learn
a ranking function from biased user interactions. Due to privacy constraints,
users' queries, personal documents, results lists, and raw interaction data
will not leave their devices, and ULTR has to be carried out via Federated
Learning (FL).
Directly applying existing ULTR algorithms on users' devices could suffer
from insufficient training data due to the limited amount of local
interactions. To address this problem, we propose the FedIPS algorithm, which
learns from user interactions on-device under the coordination of a central
server and uses click propensities to remove the position bias in user
interactions. Our evaluation of FedIPS on the Yahoo and Istella datasets shows
that FedIPS is robust over a range of position biases.
Related papers
- Unbiased Learning to Rank with Query-Level Click Propensity Estimation: Beyond Pointwise Observation and Relevance [74.43264459255121]
In real-world scenarios, users often click only one or two results after examining multiple relevant options.
We propose a query-level click propensity model to capture the probability that users will click on different result lists.
Our method introduces a Dual Inverse Propensity Weighting mechanism to address both relevance saturation and position bias.
arXiv Detail & Related papers (2025-02-17T03:55:51Z) - Effective and secure federated online learning to rank [5.874142059884521]
Online Learning to Rank optimises ranking models using implicit user feedback, such as clicks.
It addresses several drawbacks such as the high cost of human annotations, potential misalignment between user preferences and human judgements, and the rapid changes in user query intents.
This thesis presents a comprehensive study on Federated Online Learning to Rank, addressing its effectiveness, robustness, security, and unlearning capabilities.
arXiv Detail & Related papers (2024-12-26T05:53:10Z) - Scalable Collaborative Learning via Representation Sharing [53.047460465980144]
Federated learning (FL) and Split Learning (SL) are two frameworks that enable collaborative learning while keeping the data private (on device)
In FL, each data holder trains a model locally and releases it to a central server for aggregation.
In SL, the clients must release individual cut-layer activations (smashed data) to the server and wait for its response (during both inference and back propagation).
In this work, we present a novel approach for privacy-preserving machine learning, where the clients collaborate via online knowledge distillation using a contrastive loss.
arXiv Detail & Related papers (2022-11-20T10:49:22Z) - 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) - D-BIAS: A Causality-Based Human-in-the-Loop System for Tackling
Algorithmic Bias [57.87117733071416]
We propose D-BIAS, a visual interactive tool that embodies human-in-the-loop AI approach for auditing and mitigating social biases.
A user can detect the presence of bias against a group by identifying unfair causal relationships in the causal network.
For each interaction, say weakening/deleting a biased causal edge, the system uses a novel method to simulate a new (debiased) dataset.
arXiv Detail & Related papers (2022-08-10T03:41:48Z) - DQRE-SCnet: A novel hybrid approach for selecting users in Federated
Learning with Deep-Q-Reinforcement Learning based on Spectral Clustering [1.174402845822043]
Machine learning models based on sensitive data in the real-world promise advances in areas ranging from medical screening to disease outbreaks, agriculture, industry, defense science, and more.
In many applications, learning participant communication rounds benefit from collecting their own private data sets, teaching detailed machine learning models on the real data, and sharing the benefits of using these models.
Due to existing privacy and security concerns, most people avoid sensitive data sharing for training. Without each user demonstrating their local data to a central server, Federated Learning allows various parties to train a machine learning algorithm on their shared data jointly.
arXiv Detail & Related papers (2021-11-07T15:14:29Z) - FedMix: Approximation of Mixup under Mean Augmented Federated Learning [60.503258658382]
Federated learning (FL) allows edge devices to collectively learn a model without directly sharing data within each device.
Current state-of-the-art algorithms suffer from performance degradation as the heterogeneity of local data across clients increases.
We propose a new augmentation algorithm, named FedMix, which is inspired by a phenomenal yet simple data augmentation method, Mixup.
arXiv Detail & Related papers (2021-07-01T06:14:51Z) - FedeRank: User Controlled Feedback with Federated Recommender Systems [4.474834288759608]
Data privacy is one of the most prominent concerns in the digital era.
We present FedeRank, a privacy-preserving distributed machine learning paradigm.
We show the effectiveness of FedeRank in terms of recommendation accuracy, even with a small portion of shared user data.
arXiv Detail & Related papers (2020-12-15T22:26:54Z) - Multi-Center Federated Learning [62.57229809407692]
This paper proposes a novel multi-center aggregation mechanism for federated learning.
It learns multiple global models from the non-IID user data and simultaneously derives the optimal matching between users and centers.
Our experimental results on benchmark datasets show that our method outperforms several popular federated learning methods.
arXiv Detail & Related papers (2020-05-03T09:14:31Z) - Handling Position Bias for Unbiased Learning to Rank in Hotels Search [0.951828574518325]
We will investigate the importance of properly handling the position bias in an online test environment in Tripadvisor Hotels search.
We propose an empirically effective method of handling the position bias that fully leverages the user action data.
The online A/B test results show that this method leads to an improved search ranking model.
arXiv Detail & Related papers (2020-02-28T03:48:42Z)
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.