The following results are related to Digital Humanities and Cultural Heritage. Are you interested to view more results? Visit OpenAIRE - Explore.

Digital Humanities and Cultural Heritage
Publications
Other research products
Preprint
European Commission
LIMOSINE
NARCIS

Sort by

Relevance

arrow_drop_down

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem
descriptionPublicationkeyboard_double_arrow_right Article 2013Embargo end date: 01 Jan 2013 Netherlands Publisher:arXivFunded by:NWO | Semantic Search in E-Disc..., NWO | Modeling and Learning fro..., NWO | Building Rich Links to En... +4 projects
NWO| Semantic Search in E-Discovery ,
NWO| Modeling and Learning from Implicit Feedback in Information Retrieval ,
NWO| Building Rich Links to Enable Television History Research ,
EC| COMPLACS ,
EC| LIMOSINE ,
NWO| SPuDisc: Searching Public Discourse ,
NWO| Digging archaeology data: image search and markup (DADAISM)
Authors: Zoghi, Masrour; Whiteson, Shimon; Munos, Remi; de Rijke, Maarten;
Zoghi, Masrour; Whiteson, Shimon; Munos, Remi; de Rijke, Maarten;
doi: 10.48550/arxiv.1312.3393
handle: 11245/1.430126
doi: 10.48550/arxiv.1312.3393
handle: 11245/1.430126
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
downloaddonwloadFull-Text
NARCISarrow_drop_down
NARCIS
Article . 2014
Full-Text: https://pure.uva.nl/ws/files/2467569/167012_zoghi14.pdf
Data sources: NARCIS; Universiteit van Amsterdam (UvA) Institutional Repository UvA-DARE
http://jmlr.org/proceedings/pa...
Article . 2014
Data sources: NARCIS
arXiv.org e-Print Archive
Other literature type . Preprint . 2013
Data sources: arXiv.org e-Print Archive
https://doi.org/10.48550/arxiv...
Article . 2013
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
linkLink to
shareshareShare
citeCite
addClaim
Please grant OpenAIRE to access and update your ORCID works.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
Do the share buttons not appear? Please make sure, any blocking addon is disabled, and then reload the page.
Select content type to embed
All Research products
arrow_drop_down
<script type="text/javascript">  </script>
COPY SCRIPT
For further information contact us at helpdesk@openaire.eu
Access Routes
Green
0
citations 0
popularity Average
influence Average
impulse Average
Powered by BIP!
more_vert
downloaddonwloadFull-Text
NARCISarrow_drop_down
NARCIS
Article . 2014
Full-Text: https://pure.uva.nl/ws/files/2467569/167012_zoghi14.pdf
Data sources: NARCIS; Universiteit van Amsterdam (UvA) Institutional Repository UvA-DARE
http://jmlr.org/proceedings/pa...
Article . 2014
Data sources: NARCIS
arXiv.org e-Print Archive
Other literature type . Preprint . 2013
Data sources: arXiv.org e-Print Archive
https://doi.org/10.48550/arxiv...
Article . 2013
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
linkLink to
shareshareShare
citeCite
addClaim
Please grant OpenAIRE to access and update your ORCID works.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
Do the share buttons not appear? Please make sure, any blocking addon is disabled, and then reload the page.
Select content type to embed
All Research products
arrow_drop_down
<script type="text/javascript">  </script>
COPY SCRIPT
For further information contact us at helpdesk@openaire.eu

The following results are related to Digital Humanities and Cultural Heritage. Are you interested to view more results? Visit OpenAIRE - Explore.

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem
descriptionPublicationkeyboard_double_arrow_right Article 2013Embargo end date: 01 Jan 2013 Netherlands Publisher:arXivFunded by:NWO | Semantic Search in E-Disc..., NWO | Modeling and Learning fro..., NWO | Building Rich Links to En... +4 projects
NWO| Semantic Search in E-Discovery ,
NWO| Modeling and Learning from Implicit Feedback in Information Retrieval ,
NWO| Building Rich Links to Enable Television History Research ,
EC| COMPLACS ,
EC| LIMOSINE ,
NWO| SPuDisc: Searching Public Discourse ,
NWO| Digging archaeology data: image search and markup (DADAISM)
Authors: Zoghi, Masrour; Whiteson, Shimon; Munos, Remi; de Rijke, Maarten;
Zoghi, Masrour; Whiteson, Shimon; Munos, Remi; de Rijke, Maarten;
doi: 10.48550/arxiv.1312.3393
handle: 11245/1.430126
doi: 10.48550/arxiv.1312.3393
handle: 11245/1.430126
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
downloaddonwloadFull-Text
NARCISarrow_drop_down
NARCIS
Article . 2014
Full-Text: https://pure.uva.nl/ws/files/2467569/167012_zoghi14.pdf
Data sources: NARCIS; Universiteit van Amsterdam (UvA) Institutional Repository UvA-DARE
http://jmlr.org/proceedings/pa...
Article . 2014
Data sources: NARCIS
arXiv.org e-Print Archive
Other literature type . Preprint . 2013
Data sources: arXiv.org e-Print Archive
https://doi.org/10.48550/arxiv...
Article . 2013
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
linkLink to
shareshareShare
citeCite
addClaim
Please grant OpenAIRE to access and update your ORCID works.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
Do the share buttons not appear? Please make sure, any blocking addon is disabled, and then reload the page.
Select content type to embed
All Research products
arrow_drop_down
<script type="text/javascript">  </script>
COPY SCRIPT
For further information contact us at helpdesk@openaire.eu
Access Routes
Green
0
citations 0
popularity Average
influence Average
impulse Average
Powered by BIP!
more_vert
downloaddonwloadFull-Text
NARCISarrow_drop_down
NARCIS
Article . 2014
Full-Text: https://pure.uva.nl/ws/files/2467569/167012_zoghi14.pdf
Data sources: NARCIS; Universiteit van Amsterdam (UvA) Institutional Repository UvA-DARE
http://jmlr.org/proceedings/pa...
Article . 2014
Data sources: NARCIS
arXiv.org e-Print Archive
Other literature type . Preprint . 2013
Data sources: arXiv.org e-Print Archive
https://doi.org/10.48550/arxiv...
Article . 2013
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
linkLink to
shareshareShare
citeCite
addClaim
Please grant OpenAIRE to access and update your ORCID works.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
This Research product is the result of merged Research products in OpenAIRE.

You have already added works in your ORCID record related to the merged Research product.
Do the share buttons not appear? Please make sure, any blocking addon is disabled, and then reload the page.
Select content type to embed
All Research products
arrow_drop_down
<script type="text/javascript">  </script>
COPY SCRIPT
For further information contact us at helpdesk@openaire.eu

Filters

Access

Type

Document Type

Year range

Funder

Funding Stream

Project

Country

Source

Research community

Digital Humanities and Cultural Heritage
Publications
Other research products
Preprint
European Commission
LIMOSINE
NARCIS

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem

Searching Fields	Terms
Any field arrow_drop_down includes arrow_drop_down

	citations	0
	popularity	Average
	influence	Average
	impulse	Average

	citations	0
	popularity	Average
	influence	Average
	impulse	Average

Filters

Access

Type

Document Type

Year range

Funder

Funding Stream

Project

Country

Source

Research community

Digital Humanities and Cultural Heritage Publications close Other research products close Preprint close European Commission close LIMOSINE close NARCIS close

Loading

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem

Loading

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem

Digital Humanities and Cultural Heritage
Publications
Other research products
Preprint
European Commission
LIMOSINE
NARCIS