LGCOJan 16

Constant Metric Scaling in Riemannian Computation

arXiv:2601.10992v21 citationsh-index: 7
AI Analysis

This is an incremental expository note aimed at practitioners in Riemannian computation to prevent confusion in applying scaling parameters.

The paper clarifies the effects of constant metric scaling in Riemannian computation, distinguishing between quantities that change (e.g., norms, distances) and those that remain invariant (e.g., geodesics, connection), with implications for optimization where it can be interpreted as step-size rescaling.

Constant rescaling of a Riemannian metric appears in many computational settings, often through a global scale parameter that is introduced either explicitly or implicitly. Although this operation is elementary, its consequences are not always made clear in practice and may be confused with changes in curvature, manifold structure, or coordinate representation. In this note we provide a short, self-contained account of constant metric scaling on arbitrary Riemannian manifolds. We distinguish between quantities that change under such a scaling, including norms, distances, volume elements, and gradient magnitudes, and geometric objects that remain invariant, such as the Levi--Civita connection, geodesics, exponential and logarithmic maps, and parallel transport. We also discuss implications for Riemannian optimization, where constant metric scaling can often be interpreted as a global rescaling of step sizes rather than a modification of the underlying geometry. The goal of this note is purely expository and is intended to clarify how a global metric scale parameter can be introduced in Riemannian computation without altering the geometric structures on which these methods rely.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes