The optimal affine transform for the extended Davis-Kahan bound is a concave-convex fractional program, solved globally and shown to give tighter eigenvector subspace bounds in SBM and PCA examples.
On Nonlinear Fractional Programming,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Extending the Davis-Kahan theorem for comparing eigenvectors of two symmetric matrices II: Computation and Applications
The optimal affine transform for the extended Davis-Kahan bound is a concave-convex fractional program, solved globally and shown to give tighter eigenvector subspace bounds in SBM and PCA examples.