Open Problem: Tight Online Confidence Intervals for RKHS Elements

28 October 2021

Papers citing "Open Problem: Tight Online Confidence Intervals for RKHS Elements"

9 / 9 papers shown

Title
Lower Bounds for Time-Varying Kernelized Bandits Xu Cai Jonathan Scarlett 83 1 0 22 Oct 2024
Kernel $ε$ -Greedy for Multi-Armed Bandits with Covariates Sakshi Arya Bharath K. Sriperumbudur 137 0 0 29 Jun 2023
Kernelized Reinforcement Learning with Order Optimal Regret Bounds Sattar Vakili Julia Olkhovskaya 91 9 0 13 Jun 2023
Sample Complexity of Kernel-Based Q-Learning Sing-Yuan Yeh Fu-Chieh Chang Chang-Wei Yueh Pei-Yuan Wu A. Bernacchia Sattar Vakili OffRL 84 4 0 01 Feb 2023
Instance-Dependent Regret Analysis of Kernelized Bandits S. Shekhar T. Javidi 57 4 0 12 Mar 2022
Improved Convergence Rates for Sparse Approximation Methods in Kernel-Based Learning Sattar Vakili Jonathan Scarlett Da-shan Shiu A. Bernacchia 83 19 0 08 Feb 2022
Uniform Generalization Bounds for Overparameterized Neural Networks Sattar Vakili Michael Bromberg Jezabel R. Garcia Da-shan Shiu A. Bernacchia 125 21 0 13 Sep 2021
Optimal Order Simple Regret for Gaussian Process Bandits Sattar Vakili N. Bouziani Sepehr Jalali A. Bernacchia Da-shan Shiu 99 55 0 20 Aug 2021
Neural Contextual Bandits without Regret Parnian Kassraie Andreas Krause OffRL 113 40 0 07 Jul 2021