Recommendations
Cited in
(39)- Further contributions to the two-armed bandit problem
- Bandit problems with infinitely many arms
- Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm
- Filtered Poisson process bandit on a continuum
- A revision game of experimentation on a common threshold
- Online linear optimization and adaptive routing
- On two continuum armed bandit problems in high dimensions
- Noise free multi-armed bandit game
- The Irrevocable Multiarmed Bandit Problem
- Continuum armed bandit problem of few variables in high dimensions
- A learning algorithm for the finite-time two-armed bandit problem
- scientific article; zbMATH DE number 4205609 (Why is no real title available?)
- Active Learning in Multi-armed Bandits
- scientific article; zbMATH DE number 3918239 (Why is no real title available?)
- scientific article; zbMATH DE number 3967731 (Why is no real title available?)
- An asymptotically optimal policy for finite support models in the multiarmed bandit problem
- Budgeted multi-armed bandit in continuous action space
- The Nonstochastic Multiarmed Bandit Problem
- Contextual bandits with continuous actions: smoothing, zooming, and adapting
- Nonparametric pricing analytics with customer covariates
- A general theory of multiarmed bandit processes with constrained arm switches
- Smoothness-Adaptive Contextual Bandits
- Infinite Arms Bandit: Optimality via Confidence Bounds
- Dynamic learning and decision making via basis weight vectors
- Learning in combinatorial optimization: what and how to explore
- Improved Rates for the Stochastic Continuum-Armed Bandit Problem
- Learning approximately optimal contracts
- Learning approximately optimal contracts
- Control-data separation and logical condition propagation for efficient inference on probabilistic programs
- Treatment recommendation with distributional targets
- Emerging directions in Bayesian computation
- Parameterized aspects of distinct Kemeny rank aggregation
- Parameterized aspects of distinct Kemeny rank aggregation
- Factored-reward bandits with intermediate observations: regret minimization and best arm identification
- General parallel optimization a without metric
- Title not available (Why is no real title available?)
- Optimal learning for sequential sampling with non-parametric beliefs
- Optimal learning with a local parametric belief model
- Adaptive-treed bandits
This page was built for publication: The Continuum-Armed Bandit Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862444)
