A PAC algorithm in relative precision for bandit problem with costly sampling (Q2084297): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploration-exploitation tradeoff using variance estimates in multi-armed bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization - a comprehensive survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure exploration in finitely-armed and continuous-armed bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic approximation on a discrete set and the multi— armed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Comparison Algorithm for Discrete Optimization with Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good arm identification via bandit feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2810758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandit Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Stochastic Approximation Approach to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4626283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Discrete Optimization / rank
 
Normal rank

Latest revision as of 12:09, 30 July 2024

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
    0 references
    0 references
    18 October 2022
    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

    Identifiers