Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments (Q924170): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994989479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonstochastic Multiarmed Bandit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret Minimization Under Partial Monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision-theoretic generalization of on-line learning and an application to boosting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime algorithms for multi-armed bandit problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-based induction systems: Comparisons and convergence theorems / rank
 
Normal rank

Latest revision as of 09:58, 28 June 2024

scientific article
Language Label Description Also known as
English
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
scientific article

    Statements

    Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments (English)
    0 references
    0 references
    28 May 2008
    0 references
    multi-armed bandit
    0 references
    nonstochastic bandit
    0 references
    countable decision set
    0 references
    partial observations
    0 references
    reactive environments
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references