5 citations
3 papers
stat.ML2021★ 1 cited
Open Problem: Tight Online Confidence Intervals for RKHS Elements
Sattar Vakili, Jonathan Scarlett, Tara Javidi
Confidence intervals are a crucial building block in the analysis of various online learning problems. The analysis of kernel based bandit and reinforcement learning problems utili…
cs.CV2021★ 1 cited
Bridging Unsupervised and Supervised Depth from Focus via All-in-Focus Supervision
Ning-Hsu Wang, Ren Wang, Yu-Lun Liu +4
Depth estimation is a long-lasting yet important task in computer vision. Most of the previous works try to estimate depth from input images and assume images are all-in-focus (AiF…
stat.ML2021★ 5 cited
Optimal Order Simple Regret for Gaussian Process Bandits
Sattar Vakili, Nacime Bouziani, Sepehr Jalali +2
Consider the sequential optimization of a continuous, possibly non-convex, and expensive to evaluate objective function . The problem can be cast as a Gaussian Process (GP) band…