How Fast Is the Bandit?
From MaRDI portal
Abstract: In this paper we investigate the rate of convergence of the so-called two-armed bandit algorithm in a financial context of asset allocation. The behaviour of the algorithm turns out to be highly non-standard: no CLT whatever the time scale, possible existence of two rate regimes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- Asymptotics in randomized urn models
- Decreasing step Stochastic algorithms: a.s. behaviour of weighted empirical measures
- Learning Automata - A Survey
- Nonconvergence to unstable points in urn models and stochastic approximations
- On the linear model with two absorbing barriers
- Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
- When can the two-armed bandit algorithm be trusted?
Cited in
(5)
This page was built for publication: How Fast Is the Bandit?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506304)