skip to main content
Resource type Show Results with: Show Results with: Index

Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval

Hofmann, Katja ; Whiteson, Shimon ; Rijke, Maarten

Information Retrieval, 2013, Vol.16(1), pp.63-90 [Peer Reviewed Journal]

Link to full text

Citations Cited by
  • Title:
    Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval
  • Author/Creator: Hofmann, Katja ; Whiteson, Shimon ; Rijke, Maarten
  • Language: English
  • Subjects: Information retrieval ; Learning to rank ; Implicit feedback
  • Is Part Of: Information Retrieval, 2013, Vol.16(1), pp.63-90
  • Description: As retrieval systems become more complex, learning to rank approaches are being developed to automatically tune their parameters. Using online learning to rank, retrieval systems can learn directly from implicit feedback inferred from user interactions. In such an online setting, algorithms must obtain feedback for effective learning while simultaneously utilizing what has already been learned to produce high quality results. We formulate this challenge as an exploration–exploitation dilemma and propose two methods for addressing it. By adding mechanisms for balancing exploration and exploitation during learning, each method extends a state-of-the-art learning to rank method, one based on listwise learning and the other on pairwise learning. Using a recently developed simulation framework that allows assessment of online performance, we empirically evaluate both methods. Our results show that balancing exploration and exploitation can substantially and significantly improve the online retrieval performance of both listwise and pairwise approaches. In addition, the results demonstrate that such a balance affects the two approaches in different ways, especially when user feedback is noisy, yielding new insights relevant to making online learning to rank effective in practice.
  • Identifier: ISSN: 1386-4564 ; E-ISSN: 1573-7659 ; DOI: 10.1007/s10791-012-9197-9