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)...
Príomhchruthaitheoirí: | Zoghi, M, Karnin, Z, Whiteson, S, Rijke, M |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
2015
|
Míreanna comhchosúla
-
Melancholic Mem in the Third Life of Grange Copeland
de réir: Sedehi, Kamelia Talebian, et al.
Foilsithe / Cruthaithe: (2015) -
Good Outcome Following Copeland Hemiarthroplasty for Acromegalic Arthropathy
de réir: S. E. Johnson-Lynn, et al.
Foilsithe / Cruthaithe: (2011-01-01) -
Synergy in science: an interview with Neal Copeland and Nancy Jenkins
Foilsithe / Cruthaithe: (2012-11-01) -
Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations
de réir: de Freitas, N, et al.
Foilsithe / Cruthaithe: (2012) -
StreamingBandit: Experimenting with Bandit Policies
de réir: Jules Kruijswijk, et al.
Foilsithe / Cruthaithe: (2020-08-01)