Structured Preconditioning in Affine-Invariant Geometry: Projection, Certificates, and Kronecker Separation
arXiv:2607.12286
2026
Optimization
2 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper supplies an intrinsic alternative to ordinary Euclidean Kronecker fitting for SPD curvature matrices: project a full SPD target onto the geodesically convex family A tensor B using affine-invariant distance. The transferable asset is that the projection is unique, has logarithmic partial-trace normal equations, and can be used as a certified structured preconditioner rather than merely a covariance approximation. This is relevant for layerwise Hessian, Fisher, or gradient-covariance matrices whose inverse is too expensive to store. A second useful asset is the spectral certificate distinguishing nearest structured approximation from true condition-number minimization, enabling adaptive checks of whether a Kronecker preconditioner is actually improving optimization conditioning.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Replace Euclidean or entrywise Kronecker fitting of a layer curvature matrix with its affine-invariant projection onto G = A tensor B. Use the resulting factors as a compact SPD preconditioner in the optimizer, while solving the projection through logarithmic residual partial traces and Armijo line search.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the extreme-eigenvector marginal test to decide whether a Kronecker preconditioner is condition-optimal, rather than blindly running expensive factor refinement. If the certificate fails, construct a low-cost factor correction from the mismatch between tensor marginals of the worst-conditioned spectral states and accept it only with a condition-number line search.
Useful7/10
Difficulty7/10
Novelty8/10