Machine learning and nonparametric bandit theory
From MaRDI portal
Publication:4850249
Recommendations
- Nonparametric bandit methods
- Bayesian nonparametric bandits
- Mechanisms with learning for stochastic multi-armed bandit problems
- Optimal learning and experimentation in bandit problems.
- Machine learning. Theory and applications
- Machine Learning
- Machine learning. A probabilistic perspective
- A learning algorithm for the finite-time two-armed bandit problem
- scientific article; zbMATH DE number 1332320
- The Nonstochastic Multiarmed Bandit Problem
Cited in
(15)- Arbitrary side observations in bandit problems
- Nonparametric bandit methods
- The time until the final zero crossing of random sums with application to nonparametric bandit theory
- A linear response bandit problem
- Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates
- Methods and theory for off-line machine learning
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
- Bandit and covariate processes, with finite or non-denumerable set of arms
- Sequential design with applications to the trim-loss problem
- Convergence of least squares learning in self-referential discontinuous stochastic models.
- Active learning in heteroscedastic noise
- Learning unknown service rates in queues: a multiarmed bandit approach
- Gaussian process modelling of dependencies in multi-armed bandit problems
- MULTI-ARMED BANDITS WITH COVARIATES:THEORY AND APPLICATIONS
- Tuning Bandit Algorithms in Stochastic Environments
This page was built for publication: Machine learning and nonparametric bandit theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850249)
