# Supervised Contrastive Learning Approach for Contextual Ranking

arXiv: https://arxiv.org/abs/2207.03153 · HTML: https://mlsanity.com/paper/2207.03153/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Jul 2022.

## Built on by (most cited first, 2 of 2)

- [Self Contrastive Learning for Session-based Recommendation](https://mlsanity.com/paper/2306.01266/) (2023)
- [The Surprising Effectiveness of Rankers Trained on Expanded Queries](https://mlsanity.com/paper/2404.02587/) (2024)

## Abstract (arXiv)

Contextual ranking models have delivered impressive performance improvements over classical models in the document ranking task. However, these highly over-parameterized models tend to be data-hungry and require large amounts of data even for fine tuning. This paper proposes a simple yet effective method to improve ranking performance on smaller datasets using supervised contrastive learning for the document ranking problem. We perform data augmentation by creating training data using parts of the relevant documents in the query-document pairs. We then use a supervised contrastive learning objective to learn an effective ranking model from the augmented dataset. Our experiments on subsets of the TREC-DL dataset show that, although data augmentation leads to an increasing the training data sizes, it does not necessarily improve the performance using existing pointwise or pairwise training objectives. However, our proposed supervised contrastive loss objective leads to performance improvements over the standard non-augmented setting showcasing the utility of data augmentation using contrastive losses. Finally, we show the real benefit of using supervised contrastive learning objectives by showing marked improvements in smaller ranking datasets relating to news (Robust04), finance (FiQA), and scientific fact checking (SciFact).