scientific article; zbMATH DE number 6982311
From MaRDI portal
Publication:4558161
zbMath1445.62015MaRDI QIDQ4558161
Publication date: 21 November 2018
Full work available at URL: http://jmlr.csail.mit.edu/papers/v19/17-513.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minimax procedures in statistical decision theory (62C20) Nonparametric tolerance and confidence regions (62G15) Sequential estimation (62L12)
Related Items (2)
EXPLORATION–EXPLOITATION POLICIES WITH ALMOST SURE, ARBITRARILY SLOW GROWING ASYMPTOTIC REGRET ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lemma 1
- The multi-armed bandit problem with covariates
- Kullback-Leibler upper confidence bounds for optimal sequential allocation
- An asymptotically optimal policy for finite support models in the multiarmed bandit problem
- UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
- Asymptotically efficient adaptive allocation rules
- Boundary crossing of Brownian motion. Its relation to the law of the iterated logarithm and to sequential analysis
- Adaptive treatment allocation and the multi-armed bandit problem
- On Bayesian index policies for sequential resource allocation
- Optimal adaptive policies for sequential allocation problems
- Concentration Inequalities
- Multi‐Armed Bandit Allocation Indices
- An Asymptotic Minimax Theorem for the Two Armed Bandit Problem
- Tuning Bandit Algorithms in Stochastic Environments
- Pure Exploration in Multi-armed Bandits Problems
- Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
- Finite-time lower bounds for the two-armed bandit problem
- Near-Optimal Regret Bounds for Thompson Sampling
- Sample mean based index policies by O(log n) regret for the multi-armed bandit problem
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Introduction to nonparametric estimation
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication:
