Pages that link to "Item:Q366995"
From MaRDI portal
The following pages link to Kullback-Leibler upper confidence bounds for optimal sequential allocation (Q366995):
Displayed 33 items.
- Batched bandit problems (Q282463) (← links)
- Scalar utility theory and proportional processing: what does it actually imply? (Q307616) (← links)
- Infomax strategies for an optimal balance between exploration and exploitation (Q310029) (← links)
- Kullback-Leibler upper confidence bounds for optimal sequential allocation (Q366995) (← links)
- Boundary crossing probabilities for general exponential families (Q722599) (← links)
- On Bayesian index policies for sequential resource allocation (Q1750289) (← links)
- Probabilistic learning inference of boundary value problem with uncertainties based on Kullback-Leibler divergence under implicit constraints (Q2142219) (← links)
- The multi-armed bandit problem: an efficient nonparametric solution (Q2176624) (← links)
- Adaptive policies for perimeter surveillance problems (Q2286935) (← links)
- Asymptotically optimal algorithms for budgeted multiple play bandits (Q2331676) (← links)
- Good arm identification via bandit feedback (Q2425222) (← links)
- Local Dvoretzky-Kiefer-Wolfowitz confidence bands (Q2670672) (← links)
- (Q4558161) (← links)
- (Q4558474) (← links)
- Learning the distribution with largest mean: two bandit frameworks (Q4606431) (← links)
- Finite-Time Analysis for the Knowledge-Gradient Policy (Q4610155) (← links)
- Learning to Optimize via Information-Directed Sampling (Q4969321) (← links)
- Nonasymptotic sequential tests for overlapping hypotheses applied to near-optimal arm identification in bandit models (Q4987192) (← links)
- Technical Note—A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents (Q4994155) (← links)
- (Q4998871) (← links)
- (Q4998881) (← links)
- (Q4998901) (← links)
- Bayesian adaptive bandit-based designs using the Gittins index for multi-armed trials with normally distributed endpoints (Q5035752) (← links)
- (Q5053268) (← links)
- Regret bounds for Narendra-Shapiro bandit algorithms (Q5086451) (← links)
- Infinite Arms Bandit: Optimality via Confidence Bounds (Q5089465) (← links)
- Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (Q5219722) (← links)
- Learning to Optimize via Posterior Sampling (Q5247618) (← links)
- ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT (Q5358116) (← links)
- Satisficing in Time-Sensitive Bandit Learning (Q5870357) (← links)
- Dealing with expert bias in collective decision-making (Q6103665) (← links)
- Probabilistic learning constrained by realizations using a weak formulation of Fourier transform of probability measures (Q6148395) (← links)
- A confirmation of a conjecture on Feldman’s two-armed bandit problem (Q6198964) (← links)
