# Variance Reduction in Gradient Exploration for Online Learning to Rank

**Authors:** Huazheng Wang, Sonwoo Kim, Eric McCord-Snook, Qingyun Wu, Hongning, Wang

arXiv: 1906.03766 · 2019-11-18

## TL;DR

This paper introduces a variance reduction technique for gradient estimation in Online Learning to Rank algorithms, improving their efficiency and regret performance by projecting gradients into a feature-based document space.

## Contribution

The paper proposes a novel gradient projection method that reduces variance in OL2R algorithms, compatible with existing models, and theoretically and empirically improves performance.

## Key findings

- Significant regret reduction demonstrated in experiments.
- Effective variance reduction across multiple OL2R algorithms.
- Improved ranking performance and stability.

## Abstract

Online Learning to Rank (OL2R) algorithms learn from implicit user feedback on the fly. The key of such algorithms is an unbiased estimation of gradients, which is often (trivially) achieved by uniformly sampling from the entire parameter space. This unfortunately introduces high-variance in gradient estimation, and leads to a worse regret of model estimation, especially when the dimension of parameter space is large.   In this paper, we aim at reducing the variance of gradient estimation in OL2R algorithms. We project the selected updating direction into a space spanned by the feature vectors from examined documents under the current query (termed the "document space" for short), after interleaved test. Our key insight is that the result of interleaved test solely is governed by a user's relevance evaluation over the examined documents. Hence, the true gradient introduced by this test result should lie in the constructed document space, and components orthogonal to the document space in the proposed gradient can be safely removed for variance reduction. We prove that the projected gradient is an unbiased estimation of the true gradient, and show that this lower-variance gradient estimation results in significant regret reduction. Our proposed method is compatible with all existing OL2R algorithms which rank documents using a linear model. Extensive experimental comparisons with several state-of-the-art OL2R algorithms have confirmed the effectiveness of our proposed method in reducing the variance of gradient estimation and improving overall performance.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1906.03766/full.md

## Figures

4 figures with captions in the complete paper: https://tomesphere.com/paper/1906.03766/full.md

## References

29 references — full list in the complete paper: https://tomesphere.com/paper/1906.03766/full.md

---
Source: https://tomesphere.com/paper/1906.03766