research
∙
06/14/2023
Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression
The trade-off between regret and computational cost is a fundamental pro...
share
research
∙
03/09/2023
Improved Regret Bounds for Online Kernel Selection under Bandit Feedback
In this paper, we improve the regret bound for online kernel selection u...
research
∙
12/26/2022
