Learning to Optimize via Posterior Sampling (Q5247618): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Near-Optimal Regret Bounds for Thompson Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-time analysis of the multiarmed bandit problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kullback-Leibler upper confidence bounds for optimal sequential allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive treatment allocation and the multi-armed bandit problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically efficient adaptive allocation rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly Parameterized Bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Gradient Algorithm for a General Class of Online Learning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting / rank
 
Normal rank

Latest revision as of 23:52, 9 July 2024

scientific article; zbMATH DE number 6430560
Language Label Description Also known as
English
Learning to Optimize via Posterior Sampling
scientific article; zbMATH DE number 6430560

    Statements

    Identifiers

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