A Large-Scale Web Search Dataset for Federated Online Learning to Rank

Marcel Gregoriadis, Jingwei Kang, Johan Pouwelse
8/17/2025
cs.IRcs.AIcs.DC

No official code found. Best implementation: mg98/aol4foltr (3 stars, GPL-3.0, last commit 2026-02-04).

Abstract

The centralized collection of search interaction logs for training ranking models raises significant privacy concerns. Federated Online Learning to Rank (FOLTR) offers a privacy-preserving alternative by enabling collaborative model training without sharing raw user data. However, benchmarks in FOLTR are largely based on random partitioning of classical learning-to-rank datasets, simulated user clicks, and the assumption of synchronous client participation. This oversimplifies real-world dynamics and undermines the realism of experimental results. We present AOL4FOLTR, a large-scale web search dataset with 2.6 million queries from 10,000 users. Our dataset addresses key limitations of existing benchmarks by including user identifiers, real click data, and query timestamps, enabling realistic user partitioning, behavior modeling, and asynchronous federated learning scenarios.

View on arXivView PDF

Code Implementations(1)

mg98/aol4foltrCommunity62%
GPL-3.0

A Large-Scale Web Search Dataset for Federated Online Learning to Rank

30R, TeXJun 16, 20258 months agoGPL-3.0
datasetfederated-learninginformation-retrievallearning-to-rank

Similar Papers

Cite this paper

@article{gregoriadis2025largescale,
  title  = {A Large-Scale Web Search Dataset for Federated Online Learning to Rank},
  author = {Marcel Gregoriadis and Jingwei Kang and Johan Pouwelse},
  year   = {2025},
  eprint = {2508.12353},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.12353v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.12353.svg)](https://codeofpaper.com/paper/2508.12353)

Discussion