Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm
type: Item
instance of: scholarly article
title: Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm
DOI: 10.1214/22-AOS2182
author: Yanyan Li
published in: The Annals of Statistics
publication date: 2022-11-02T00:00:00Z
Mathematics Subject Classification ID: 62G08
Mathematics Subject Classification ID: 62L12
zbMATH DE Number: 7610767
zbMATH Keywords: adaptivity
zbMATH Keywords: additive model
zbMATH Keywords: bandits
zbMATH Keywords: communication constraints
zbMATH Keywords: curse of dimensionality
zbMATH Keywords: minimax lower bound
zbMATH Keywords: optimal rate of convergence
zbMATH Keywords: regret
zbMATH Keywords: self-similarity
MaRDI profile type: Publication
cites work: Stochastic Convex Optimization with Bandit Feedback
cites work: The Continuum-Armed Bandit Problem
cites work: MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
cites work: Regret bounds and minimax policies under partial monitoring
cites work: Fast learning rates for plug-in classifiers
cites work: 10.1162/153244303321897663
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: Improved Rates for the Stochastic Continuum-Armed Bandit Problem
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Online linear optimization and adaptive routing
cites work: Denumerable-Armed Bandits
cites work: Q5396654
cites work: Adaptive-treed bandits
cites work: Confidence intervals for high-dimensional linear regression: minimax rates and adaptivity
cites work: An adaptation theory for nonparametric confidence intervals
cites work: Adaptive confidence intervals for regression functions under shape constraints
cites work: Optimal rates of convergence for covariance matrix estimation
cites work: Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
cites work: Confidence bands in density estimation
cites work: Q5396640
cites work: Online Learning with Prior Knowledge
cites work: Playing Games with Approximation Algorithms
cites work: Q5302093
cites work: Bandits and Experts in Metric Spaces
cites work: Asymptotically efficient adaptive allocation rules
cites work: Bandit Algorithms
cites work: A kernel method of estimating structured nonparametric regression based on marginal integration
cites work: Learning Theory
cites work: Adaptive confidence interval for pointwise curve estimation.
cites work: Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
cites work: Minimax-optimal rates for sparse additive models over kernel classes via convex programming
cites work: Some aspects of the sequential design of experiments
cites work: Linearly Parameterized Bandits
cites work: Additive regression and other nonparametric models
cites work: Optimization of Smooth Functions With Noisy Observations: Local Minimax Rates
cites work: Minimax optimal rates of estimation in high dimensional additive models
description: scientific article; zbMATH DE number 7610767