Improved Regret Bounds for Online Kernel Selection Under Bandit Feedback
- 17 March 2023
- book chapter
- Published by Springer Nature
- p. 333-348
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Worst-case regret analysis of computationally budgeted online kernel selectionMachine Learning, 2022
- High-Probability Kernel Alignment Regret Bounds for Online Kernel Selection2021
- Online Kernel Selection via Incremental Sketched Kernel Alignment2018
- Online multiple kernel regression2014
- Online Multiple Kernel ClassificationMachine Learning, 2012
- Online Kernel Selection: Algorithms and EvaluationsProceedings of the AAAI Conference on Artificial Intelligence, 2012
- Prediction, Learning, and Games2006
- The Nonstochastic Multiarmed Bandit ProblemSIAM Journal on Computing, 2002
- Possible generalization of Boltzmann-Gibbs statisticsJournal of Statistical Physics, 1988