mlsanityData to 7 Oct 2026

Discrete Double-Bracket Flows for Isotropic-Noise Invariant Eigendecomposition

arXiv 2602.13759 ↗First posted 14 Feb 2026cs.LG cs.NA math.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

We study eigendecomposition on SO(n) under streaming observations Ck = Csig + σk2 I + Ek, where the isotropic background σk2 I may be time-varying and arbitrarily large. Standard algorithms couple their stability to lVert Ck rVert2 ≈ σ2, forcing step sizes, contraction rates, and iteration counts to degrade with the noise floor. We observe that σ2 I lies in the center of the matrix algebra and therefore *should never enter* the eigenspace dynamics. We construct a discrete double-bracket flow whose skew-symmetric generator Omega = [A, operatornamediag(A)] operates in the tangent Lie algebra mathfrakso(n), where scalar multiples of the identity vanish by antisymmetry. The resulting trajectory, Lyapunov function, and maximal stable step size ηmax = 1/LC depend exclusively on the trace-free signal Ce -- achieving pointwise, pathwise σ2-invariance. We establish input-to-state stability with a noise ball governed solely by trace-free perturbations, prove global convergence via strict-saddle geometry and a discrete Lojasiewicz argument, and extend the framework to top-k eigentracking on the Stiefel manifold operatornameSt(k,n) at cost k matrix-vector products per step.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 14 Feb 2026.

Builds on

19 of 35 references.

References · 19

  1. 2017How to Escape Saddle Points Efficientlycited by 284
  2. 2020Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transformcited by 79
  3. 2020Hutch++: Optimal Stochastic Trace Estimationcited by 62
  4. 2016First Efficient Convergence for Streaming k-PCA: a Global, Gap-Free, and Near-Optimal Ratecited by 31
  5. 2016Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithmcited by 29
  6. 2023Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraintscited by 18
  7. 2015Convergence of Stochastic Gradient Descent for PCAcited by 17
  8. 2020A Modern Analysis of Hutchinson's Trace Estimatorcited by 11
  9. 2021On the Optimality of the Oja's Algorithm for Online PCAcited by 11
  10. 2021Escape saddle points by a simple gradient-descent based algorithmcited by 11
  11. 2019AdaOja: Adaptive Learning Rates for Streaming PCAcited by 10
  12. 2023Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCAcited by 10
7 more
  1. 2023Streaming PCA for Markovian Datacited by 9
  2. 2024Oja's Algorithm for Streaming Sparse PCAcited by 9
  3. 2023Riemannian stochastic optimization methods avoid strict saddle pointscited by 8
  4. 2019Robust Streaming PCAcited by 6
  5. 2022Optimal Query Complexities for Dynamic Trace Estimationcited by 5
  6. 2024Sparser, Better, Deeper, Stronger: Improving Sparse Training with Exact Orthogonal Initializationcited by 3
  7. 2023Streaming Heteroscedastic Probabilistic PCA with Missing Datacited by 2

Built on by

Not cited yet.