We propose a Riemannian gradient descent with the Poincar\'e metric to compute the order-$\alpha$ Augustin information, a widely used quantity for characterizing exponential error behaviors in information theory. We prove that the algorithm converges to the optimum at a rate of $\mathcal{O}(1 / T)$. As far as we know, this is the first algorithm with a non-asymptotic optimization error guarantee for all positive orders. Numerical experimental results demonstrate the empirical efficiency of the algorithm. Our result is based on a novel hybrid analysis of Riemannian gradient descent for functions that are geodesically convex in a Riemannian metric and geodesically smooth in another.

翻译：我们提出一种基于庞加莱度量的黎曼梯度下降方法，用于计算阶次-α奥古斯丁信息——信息论中刻画指数误差行为的常用量。我们证明该算法以𝒪(1/T)的速率收敛至最优解。据我们所知，这是首个对所有正阶次都具有非渐近优化误差保证的算法。数值实验结果表明了该算法的经验有效性。本成果基于对黎曼梯度下降的混合分析：该算法针对在某一黎曼度量下测地凸、而在另一度量下测地光滑的函数具有收敛性。