Manifold-Aware Information Gain and Lower Bounds for Gaussian-Process Bandits on Riemannian Quotient Spaces
Yuriy Dorn, Changsheng Chen, and Ning Xie

TL;DR
This paper establishes a geometric lower bound for Gaussian-process bandits on Riemannian manifolds, revealing how manifold volume influences regret and extending analysis with new bounds, algorithms, and geometric insights.
Contribution
It introduces a volume-dependent lower bound for Gaussian-process bandits on manifolds, extends analysis to quotient spaces, and explores geometric and curvature effects on regret.
Findings
Derived a volume-dependent regret lower bound for manifold GP-bandits.
Extended analysis with a new lower bound and regret upper bounds on quotient spaces.
Connected geometric properties like volume and curvature to regret bounds.
Abstract
We prove a regret lower bound for Gaussian-process bandits on a smooth compact Riemannian manifold of dimension with intrinsic Mat\'ern- kernel () that exposes how the geometry of the arm space enters the constant. For any algorithm and time horizon exceeding an explicit threshold, the worst-case expected regret over the RKHS-ball satisfies \begin{multline*} \E[R_T(f)]\;\ge\;c_*(d,\nu)\,B^{d/(2\nu+d)}\,\sigma_n^{2\nu/(2\nu+d)} \\ \cdot\,\vol_g(\M)^{\nu/(2\nu+d)}\,T^{(\nu+d)/(2\nu+d)}(\log T)^{\nu/(2\nu+d)}. \end{multline*} The exponent matches the Vakili--Khezeli--Picheny upper bound \cite{vakili2021information}; the factor is, to our knowledge, the first explicit volume-dependent geometric constant in a manifold GP-bandit lower bound. We extend the analysis in five directions: (i)~a companion…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
