GP-UCB algorithm's suboptimality revealed in new research

A new paper published on arXiv investigates the limitations of the Gaussian Process Upper Confidence Bound (GP-UCB) algorithm. Researchers have established upper bounds on its cumulative regret, but this work explores whether GP-UCB is truly minimax optimal. The study introduces a new regret lower bound for GP-UCB with Matérn kernels, indicating that polynomial growth in the effective optimism level hinders optimal regret rates. AI

影响 Identifies a fundamental limitation in a widely used optimization algorithm, potentially guiding future research towards more optimal methods.

排序理由 The cluster contains an academic paper discussing algorithmic limitations. [lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv stat.ML 阅读 →

• arXiv
• Gaussian Process Upper Confidence Bound
• GP-UCB
• Matérn kernels
• Xiaowei Zhang

• 论文
• 其他

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →