Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes
From MaRDI portal
Publication:5060501
DOI10.1287/opre.2021.2237OpenAlexW3045217160MaRDI QIDQ5060501
Nathan Kallus, Xiaojie Mao, Yichun Hu
Publication date: 10 January 2023
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.02553
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-armed bandit problem with covariates
- Some new asymptotic theory for least squares series: pointwise and uniform results
- Woodroofe's one-armed bandit problem revisited
- Fast learning rates for plug-in classifiers
- Asymptotically efficient adaptive allocation rules
- Optimal rates of convergence for nonparametric estimators
- Consistent nonparametric regression. Discussion
- Smooth discrimination analysis
- Optimal global rates of convergence for nonparametric regression
- Optimal aggregation of classifiers in statistical learning.
- Local Rademacher complexities
- An Explicit Description of the Reproducing Kernel Hilbert Spaces of Gaussian RBF Kernels
- Online Decision Making with High-Dimensional Covariates
- A linear response bandit problem
- Bandit problems with side observations
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Prediction, Learning, and Games
- Finite-time analysis of the multiarmed bandit problem
