TpopT: Efficient Trainable Template Optimization on Low-Dimensional Manifolds
TpopT replaces exhaustive template-bank search with trainable optimization on a low-dimensional signal manifold. I led the core theoretical analysis, establishing curvature-dependent convergence guarantees for Riemannian gradient descent under Gaussian noise and estimation bounds governed primarily by intrinsic dimension. The analysis identifies the geometric conditions behind its computational advantage over matched filtering and the limits of that advantage.
