Awesome

Unbiased Learning to Rank Algorithms (ULTRA)

<a href="https://twitter.com/intent/follow?screen_name=CommunityUltr"> <img src="https://img.shields.io/twitter/follow/CommunityUltr?style=social&logo=twitter" alt="follow on Twitter"></a>

🔥News: A TensorFlow version of this package can be found in ULTRA.

This is an Unbiased Learning To Rank Algorithms (ULTRA) toolbox, which provides a codebase for experiments and research on learning to rank with human annotated or noisy labels. With the unified data processing pipeline, ULTRA supports multiple unbiased learning-to-rank algorithms, online learning-to-rank algorithms, neural learning-to-rank models, as well as different methods to use and simulate noisy labels (e.g., clicks) to train and test different algorithms/ranking models. A user-friendly documentation can be found here.

Get Started

Create virtual environment (optional):

pip install --user virtualenv
~/.local/bin/virtualenv -p python3 ./venv
source venv/bin/activate

Install ULTRA from the source:

git clone https://github.com/ULTR-Community/ULTRA_pytorch.git
cd ULTRA
make init

Run toy example:

bash example/toy/offline_exp_pipeline.sh

Structure

Input Layers

1. ClickSimulationFeed: this is the input layer that generate synthetic clicks on fixed ranked lists to feed the learning algorithm.

2. DeterministicOnlineSimulationFeed: this is the input layer that first create ranked lists by sorting documents according to the current ranking model, and then generate synthetic clicks on the lists to feed the learning algorithm. It can do result interleaving if required by the learning algorithm.

3. StochasticOnlineSimulationFeed: this is the input layer that first create ranked lists by sampling documents based on their scores in the current ranking model and the Plackett-Luce distribution, and then generate synthetic clicks on the lists to feed the learning algorithm. It can do result interleaving if required by the learning algorithm.

4. DirectLabelFeed: this is the input layer that directly feed the labels of each documents (e.g., the true relevance labels or raw click logs) to the learning algorithm.

Learning Algorithms

1. NA: this model is an implementation of the naive algorithm that directly train models with input labels (e.g., clicks).

2. DLA: this is an implementation of the Dual Learning Algorithm in <a href="https://arxiv.org/pdf/1804.05938.pdf">Unbiased Learning to Rank with Unbiased Propensity Estimation</a>.

3. IPW: this model is an implementation of the Inverse Propensity Weighting algorithms in <a href="https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/45286.pdf">Learning to Rank with Selection Bias in Personal Search</a> and <a href="https://arxiv.org/pdf/1608.04468.pdf"> Unbiased Learning-to-Rank with Biased Feedback</a>

4. REM: this model is an implementation of the regression-based EM algorithm in <a href="https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/46485.pdf">Position bias estimation for unbiased learning to rank in personal search</a>

5. PD: this model is an implementation of the pairwise debiasing algorithm in <a href="https://arxiv.org/pdf/1809.05818.pdf">Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm.</a>

6. DBGD: this model is an implementation of the Dual Bandit Gradient Descent algorithm in <a href="https://arxiv.org/abs/1503.03244">Interactively optimizing information retrieval systems as a dueling bandits problem</a>

7. MGD: this model is an implementation of the Multileave Gradient Descent in <a href="https://dl.acm.org/doi/pdf/10.1145/2835776.2835804">Multileave Gradient Descent for Fast Online Learning to Rank</a>

8. NSGD: this model is an implementation of the Null Space Gradient Descent algorithm in <a href="https://dl.acm.org/doi/pdf/10.1145/3209978.3210045">Efficient Exploration of Gradient Space for Online Learning to Rank</a>

9. PDGD: this model is an implementation of the Pairwise Differentiable Gradient Descent algorithm in <a href="https://arxiv.org/abs/1809.08415">Differentiable unbiased online learning to rank</a>

Ranking Models

1. Linear: this is a linear ranking algorithm that compute ranking scores with a linear function.

2. DNN: this is neural ranking algorithm that compute ranking scores with a multi-layer perceptron network (with non-linear activation functions).

3. DLCM: this is an implementation of the Deep Listwise Context Model in <a href="https://arxiv.org/pdf/1804.05936.pdf">Learning a Deep Listwise Context Model for Ranking Refinement</a> (<span style="color:yellow">TODO</span>).

4. GSF: this is an implementation of the Groupwise Scoring Function in <a href="https://arxiv.org/pdf/1811.04415.pdf">Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks</a> (<span style="color:yellow">TODO</span>).

5. SetRank: this is an implementation of the SetRank model in <a href="https://arxiv.org/abs/1912.05891">SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrieval</a> (<span style="color:yellow">TODO</span>).

Supported Evaluation Metrics

1. MRR: the <a href="https://en.wikipedia.org/wiki/Mean_reciprocal_rank">Mean Reciprocal Rank</a>.

2. ERR: the Expected Reciprocal Rank from <a href="http://olivier.chapelle.cc/pub/err.pdf">Expected reciprocal rank for graded relevance</a>.

3. ARP: the Average Relevance Position.

4. NDCG: the <a href="https://en.wikipedia.org/wiki/Discounted_cumulative_gain">Normalized Discounted Cumulative Gain</a>.

5. DCG: the <a href="https://en.wikipedia.org/wiki/Discounted_cumulative_gain">Discounted Cumulative Gain</a>.

6. Precision: the Precision.

7. MAP: the <a href="https://en.wikipedia.org/wiki/Evaluation_measures_(information_retrieval)#Mean_average_precision">Mean Average Precision</a>.

8. Ordered_Pair_Accuracy: the percentage of correctedly ordered pair.

Click Simulation Example

Create click models for click simulations

python ultra/utils/click_models.py pbm 0.1 1 4 1.0 example/ClickModel

* The output is a json file containing the click mode that could be used for click simulation. More details could be found in the code.

(Optional) Estimate examination propensity with result randomization

python ultra/utils/propensity_estimator.py example/ClickModel/pbm_0.1_1.0_4_1.0.json <DATA_DIR> example/PropensityEstimator/

* The output is a json file containing the estimated examination propensity (used for IPW). DATA_DIR is the directory for the prepared data created by ./libsvm_tools/prepare_exp_data_with_svmrank.py. More details could be found in the code.

Citation

If you use ULTRA in your research, please use the following BibTex entry.

@misc{tran2021ultra,
      title={ULTRA: An Unbiased Learning To Rank Algorithm Toolbox}, 
      author={Anh Tran and Tao Yang and Qingyao Ai},
      year={2021},
      eprint={2108.05073},
      archivePrefix={arXiv},
      primaryClass={cs.IR}
}

@article{10.1145/3439861,
author = {Ai, Qingyao and Yang, Tao and Wang, Huazheng and Mao, Jiaxin},
title = {Unbiased Learning to Rank: Online or Offline?},
year = {2021},
issue_date = {February 2021},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {39},
number = {2},
issn = {1046-8188},
url = {https://doi.org/10.1145/3439861},
doi = {10.1145/3439861},
journal = {ACM Trans. Inf. Syst.},
month = feb,
articleno = {21},
numpages = {29},
keywords = {unbiased learning, online learning, Learning to rank}
}

Development Team

​ ​ ​ ​

Contribution

Please read the Contributing Guide before creating a pull request.

Project Organizers

• Qingyao Ai
  • Dept. of CS&T, Tsinghua University
  • Homepage

License

Apache-2.0

Copyright (c) 2020-present, Qingyao Ai (QingyaoAi) "# Pytorch_ULTRA"