Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes
From MaRDI portal
(Redirected from Publication:5060501)
Cites work
- A linear response bandit problem
- An Explicit Description of the Reproducing Kernel Hilbert Spaces of Gaussian RBF Kernels
- Asymptotically efficient adaptive allocation rules
- Bandit problems with side observations
- Consistent nonparametric regression. Discussion
- Fast learning rates for plug-in classifiers
- Finite-time analysis of the multiarmed bandit problem
- scientific article; zbMATH DE number 1306865 (Why is no real title available?)
- scientific article; zbMATH DE number 3222478 (Why is no real title available?)
- Local Rademacher complexities
- Online decision making with high-dimensional covariates
- Optimal aggregation of classifiers in statistical learning.
- Optimal global rates of convergence for nonparametric regression
- Optimal rates of convergence for nonparametric estimators
- Prediction, Learning, and Games
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Smooth discrimination analysis
- Some new asymptotic theory for least squares series: pointwise and uniform results
- The k-nearest neighbour UCB algorithm for multi-armed bandits with covariates
- The multi-armed bandit problem with covariates
- Woodroofe's one-armed bandit problem revisited
Cited in
(3)
This page was built for publication: Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060501)