Copeland dueling bandits
A version of the dueling bandit problem is addressed in which a Condorcet winner may not exist. Two algorithms are proposed that instead seek to minimize regret with respect to the Copeland winner, which, unlike the Condorcet winner, is guaranteed to exist. The first, Copeland Confidence Bound (CCB)...
Autors principals: | Zoghi, M, Karnin, Z, Whiteson, S, Rijke, M |
---|---|
Format: | Conference item |
Publicat: |
2015
|
Ítems similars
-
Melancholic Mem in the Third Life of Grange Copeland
per: Sedehi, Kamelia Talebian, et al.
Publicat: (2015) -
Good Outcome Following Copeland Hemiarthroplasty for Acromegalic Arthropathy
per: S. E. Johnson-Lynn, et al.
Publicat: (2011-01-01) -
Synergy in science: an interview with Neal Copeland and Nancy Jenkins
Publicat: (2012-11-01) -
Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations
per: de Freitas, N, et al.
Publicat: (2012) -
StreamingBandit: Experimenting with Bandit Policies
per: Jules Kruijswijk, et al.
Publicat: (2020-08-01)