Projected Riemannian Gradient Descent for the Bures-Wasserstein Barycenter: Dimension-Independent Linear Convergence at Unit Step Size
arXiv:2609.03762
2026
Geometry
2 ideas extracted · analyzed Sep 4, 2026
What the math gives to ML
The paper gives a concrete stability mechanism for iterative optimization over symmetric positive-definite matrices: after each unit-step Bures-Wasserstein update, clip eigenvalues into a fixed interval. The transferable asset is that spectral clipping is the exact closed-form projection in the Bures-Wasserstein metric and is non-expansive, while reusing an eigendecomposition already required by the update. This suggests projected Bures covariance-pooling layers and projection-based optimizers for learned SPD parameters. The claimed convergence rate is dimension-independent and has iteration complexity scaling as \(O(\kappa^{3/2}\log(1/\varepsilon))\).
Ideas from this paper
Unverified
2026
Replace Euclidean or unprojected covariance averaging with a projected Bures-Wasserstein barycenter layer. Each unit-step barycenter update is followed by eigenvalue clipping into \([\alpha,\beta]\), preserving positive definiteness and preventing ill-conditioning without an additional eigendecomposition.
Useful7/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the paper's non-expansive spectral projection as a constraint-preserving optimizer step for trainable SPD matrices, including Mahalanobis metrics, covariance heads, graph kernels, and quantum density operators. After an SGD or AdamW proposal, symmetrize the matrix and clip every eigenvalue into \([\alpha,\beta]\).
Useful6/10
Difficulty4/10
Novelty5/10