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 39 0 0 22 Oct 2024
Gambling-Based Confidence Sequences for Bounded Random Vectors Jeonghun Ryu G. Wornell 26 3 0 06 Feb 2024
Sample Complexity of Kernel-Based Q-Learning Sing-Yuan Yeh Fu-Chieh Chang Chang-Wei Yueh Pei-Yuan Wu A. Bernacchia Sattar Vakili OffRL 30 4 0 01 Feb 2023
Collaborative Learning in Kernel-based Bandits for Distributed Users Sudeep Salgia Sattar Vakili Qing Zhao FedML 39 6 0 16 Jul 2022
Instance-Dependent Regret Analysis of Kernelized Bandits S. Shekhar T. Javidi 27 3 0 12 Mar 2022
Improved Convergence Rates for Sparse Approximation Methods in Kernel-Based Learning Sattar Vakili Jonathan Scarlett Da-shan Shiu A. Bernacchia 33 18 0 08 Feb 2022
Gaussian Process Bandit Optimization with Few Batches Zihan Li Jonathan Scarlett GP 133 47 0 15 Oct 2021
Uniform Generalization Bounds for Overparameterized Neural Networks Sattar Vakili Michael Bromberg Jezabel R. Garcia Da-shan Shiu A. Bernacchia 25 19 0 13 Sep 2021
Optimal Order Simple Regret for Gaussian Process Bandits Sattar Vakili N. Bouziani Sepehr Jalali A. Bernacchia Da-shan Shiu 34 51 0 20 Aug 2021