Optimal group selection for covariance matching reduces exactly to the minimum eigenvector of the double-commutator matrix, solvable in O(d²M² + d³) time.
Almost commuting selfadjoint matrices and applications
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem
Optimal group selection for covariance matching reduces exactly to the minimum eigenvector of the double-commutator matrix, solvable in O(d²M² + d³) time.