A diagrammatic, category-theoretic algorithm reduces the time complexity of applying equivariant weight matrices in tensor-power networks from O(n^(l+k)) to O(n^k) or better for four classical groups.
Bloem-Reddy and Y
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Diagrammatic Approach to Improve Computational Efficiency in Group Equivariant Neural Networks
A diagrammatic, category-theoretic algorithm reduces the time complexity of applying equivariant weight matrices in tensor-power networks from O(n^(l+k)) to O(n^k) or better for four classical groups.