Advanced search in Research products
Research products
arrow_drop_down
Searching FieldsTerms
Any field
arrow_drop_down
includes
arrow_drop_down
Include:
The following results are related to Digital Humanities and Cultural Heritage. Are you interested to view more results? Visit OpenAIRE - Explore.
1 Research products, page 1 of 1

  • Digital Humanities and Cultural Heritage
  • Publications
  • Other research products
  • Open Access
  • Preprint
  • Netherlands Organisation for Scientific Research (NWO)
  • LIMOSINE
  • NARCIS

Relevance
arrow_drop_down
  • Publication . Article . Preprint . 2013 . Embargo End Date: 01 Jan 2013
    Open Access
    Authors: 
    Zoghi, Masrour; Whiteson, Shimon; Munos, Remi; de Rijke, Maarten;
    Publisher: arXiv
    Country: Netherlands
    Project: NWO | Modeling and Learning fro... (8686), EC | COMPLACS (270327), NWO | Building Rich Links to En... (2300153702), EC | LIMOSINE (288024), NWO | Digging archaeology data:... (25409), NWO | SPuDisc: Searching Public... (2300176811), NWO | Semantic Search in E-Disc... (7999)

    This paper proposes a new method for the K-armed dueling bandit problem, a variation on the regular K-armed bandit problem that offers only relative feedback about pairs of arms. Our approach extends the Upper Confidence Bound algorithm to the relative setting by using estimates of the pairwise probabilities to select a promising arm and applying Upper Confidence Bound with the winner as a benchmark. We prove a finite-time regret bound of order O(log t). In addition, our empirical results using real data from an information retrieval application show that it greatly outperforms the state of the art. Comment: 13 pages, 6 figures

Advanced search in Research products
Research products
arrow_drop_down
Searching FieldsTerms
Any field
arrow_drop_down
includes
arrow_drop_down
Include:
The following results are related to Digital Humanities and Cultural Heritage. Are you interested to view more results? Visit OpenAIRE - Explore.
1 Research products, page 1 of 1
  • Publication . Article . Preprint . 2013 . Embargo End Date: 01 Jan 2013
    Open Access
    Authors: 
    Zoghi, Masrour; Whiteson, Shimon; Munos, Remi; de Rijke, Maarten;
    Publisher: arXiv
    Country: Netherlands
    Project: NWO | Modeling and Learning fro... (8686), EC | COMPLACS (270327), NWO | Building Rich Links to En... (2300153702), EC | LIMOSINE (288024), NWO | Digging archaeology data:... (25409), NWO | SPuDisc: Searching Public... (2300176811), NWO | Semantic Search in E-Disc... (7999)

    This paper proposes a new method for the K-armed dueling bandit problem, a variation on the regular K-armed bandit problem that offers only relative feedback about pairs of arms. Our approach extends the Upper Confidence Bound algorithm to the relative setting by using estimates of the pairwise probabilities to select a promising arm and applying Upper Confidence Bound with the winner as a benchmark. We prove a finite-time regret bound of order O(log t). In addition, our empirical results using real data from an information retrieval application show that it greatly outperforms the state of the art. Comment: 13 pages, 6 figures