Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
type: Item
instance of: scholarly article
title: Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
author: Stewart Jamieson
author: Jonathan P. How
author: Yogesh Girdhar
published in: Artificial Intelligence
publication date: 2024-07-03T00:00:00Z
Mathematics Subject Classification ID: 68Txx
zbMATH DE Number: 7875630
zbMATH Keywords: Bayesian risk
zbMATH Keywords: stochastic online learning
zbMATH Keywords: multi-armed bandits
zbMATH Keywords: partial monitoring
MaRDI profile type: Publication
cites work: Bandit Algorithms
cites work: Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
cites work: On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
cites work: Partial Monitoring—Classification, Regret Bounds, and Algorithms
cites work: Q4998881
cites work: 10.1162/153244303765208377
cites work: Near-optimal regret bounds for reinforcement learning
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: Technical Note—A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents
cites work: Efficient global optimization of expensive black-box functions
cites work: The knowledge gradient algorithm for a general class of online learning problems
cites work: Learning to Optimize via Information-Directed Sampling
cites work: Finite-Time Analysis for the Knowledge-Gradient Policy
cites work: Simple Bayesian Algorithms for Best-Arm Identification
cites work: Bayesian look ahead one-stage sampling allocations for selection of the best population
cites work: A Knowledge-Gradient Policy for Sequential Information Collection
cites work: Q3245701
cites work: Planning and acting in partially observable stochastic domains
cites work: Bayesian reinforcement learning: a survey
cites work: Q5744808
cites work: Risk-Sensitive Reinforcement Learning
cites work: Reinforcement Learning, Bit by Bit
cites work: Scalable and efficient Bayes-adaptive reinforcement learning based on Monte-Carlo tree search
cites work: Q3112637
cites work: Discrete Convex Analysis
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Q4821303
cites work: Q5612192
cites work: Asymptotic methods in statistical decision theory
cites work: Pure Exploration in Multi-armed Bandits Problems
cites work: Learning to Optimize via Posterior Sampling
cites work: The knowledge-gradient policy for correlated normal beliefs
cites work: Regret bounds and minimax policies under partial monitoring
cites work: On Stochastic Limit and Order Relationships
cites work: Congresso internazionale dei matematici. Argomenti delle communicazioni. 3-10 settembre 1928.
DOI: 10.1016/J.ARTINT.2024.104096
description: scientific article; zbMATH DE number 7875630