Pith. sign in

REVIEW 1 cited by

An Algorithm for Computing with Brauer's Group Equivariant Neural Network Layers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.14165 v1 pith:6DEEYRGV submitted 2023-04-27 cs.LG math.COmath.RTstat.ML

classification cs.LGmath.COmath.RTstat.ML
keywords groupalgorithmarxivequivariantlayersnetworkneuralorthogonal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The learnable, linear neural network layers between tensor power spaces of $\mathbb{R}^{n}$ that are equivariant to the orthogonal group, $O(n)$, the special orthogonal group, $SO(n)$, and the symplectic group, $Sp(n)$, were characterised in arXiv:2212.08630. We present an algorithm for multiplying a vector by any weight matrix for each of these groups, using category theoretic constructions to implement the procedure. We achieve a significant reduction in computational cost compared with a naive implementation by making use of Kronecker product matrices to perform the multiplication. We show that our approach extends to the symmetric group, $S_n$, recovering the algorithm of arXiv:2303.06208 in the process.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces

    cs.LG 2024-12 accept novelty 8.0 of 10

    A path-matrix algorithm yields irreducible Cartesian tensor decomposition matrices up to rank 9 and orthogonal bases of equivariant spaces, surpassing prior rank-5 and spanning-set limits.

Pith tools