A PAC algorithm in relative precision for bandit problem with costly sampling (Q2084297)

From MaRDI portal
Revision as of 11:44, 12 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
A PAC algorithm in relative precision for bandit problem with costly sampling
scientific article

    Statements

    A PAC algorithm in relative precision for bandit problem with costly sampling (English)
    0 references
    0 references
    0 references
    18 October 2022
    0 references
    0 references
    bandit algorithm
    0 references
    probably approximately correct algorithm
    0 references
    relative precision
    0 references
    concentration inequalities
    0 references
    Monte Carlo estimates
    0 references