Geodesic strong convexity does not imply forward invariance under gradient flow on SO(3): a certified counterexample
arXiv:2608.28976
2026
Dynamics
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper provides a certified counterexample showing that geodesic strong convexity and an interior minimizer do not imply forward invariance of a geodesic trust region under gradient flow on \(\mathrm{SO}(3)\). Its transferable mechanism is a separation between curvature relative to the minimizer and the boundary-normal component required by the viability condition: a strongly convex objective can still point outward at the boundary. Neural-network training on Lie-group parameters, latent rotations, or any bounded chart should therefore enforce a boundary-normal condition or use a barrier/projected flow rather than relying on strong convexity alone. The sharp engineering prediction is that unconstrained updates leave the chart at a measurable step size, while a radial barrier or projection eliminates outward boundary velocity.
Ideas from this paper
Unverified
2026
Replace the assumption that strong convexity keeps optimization inside a valid parameter chart with an explicit viability condition on the chart boundary. For Lie-group neural-network parameters or bounded latent coordinates, modify each update so its velocity has nonpositive outward radial component, using either a radial barrier or projection onto the tangent cone.
Useful6/10
Difficulty4/10
Novelty6/10