An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem (Q1785430)

From MaRDI portal
Revision as of 13:13, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem
scientific article

    Statements

    An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2018
    0 references
    multi-armed bandit problem
    0 references
    matching
    0 references
    regret analysis
    0 references
    combinatorial bandit
    0 references
    online learning
    0 references

    Identifiers