Pith. sign in

REVIEW 4 cited by

Clifford Group Equivariant Neural Networks

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 2305.11141 v5 pith:DJQLZFDK submitted 2023-05-18 cs.LG cs.AI

Clifford Group Equivariant Neural Networks

classification cs.LG cs.AI
keywords cliffordgroupalgebraequivariantexperimentseveralactionmathrm
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We introduce Clifford Group Equivariant Neural Networks: a novel approach for constructing $\mathrm{O}(n)$- and $\mathrm{E}(n)$-equivariant models. We identify and study the $\textit{Clifford group}$, a subgroup inside the Clifford algebra tailored to achieve several favorable properties. Primarily, the group's action forms an orthogonal automorphism that extends beyond the typical vector space to the entire Clifford algebra while respecting the multivector grading. This leads to several non-equivalent subrepresentations corresponding to the multivector decomposition. Furthermore, we prove that the action respects not just the vector space structure of the Clifford algebra but also its multiplicative structure, i.e., the geometric product. These findings imply that every polynomial in multivectors, An advantage worth mentioning is that we obtain expressive layers that can elegantly generalize to inner-product spaces of any dimension. We demonstrate, notably from a single core implementation, state-of-the-art performance on several distinct tasks, including a three-dimensional $n$-body experiment, a four-dimensional Lorentz-equivariant high-energy physics experiment, and a five-dimensional convex hull experiment.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. The Program Hypergraph: Multi-Way Relational Structure for Geometric Algebra, Spatial Compute, and Physics-Aware Compilation

    cs.PL 2026-03 unverdicted novelty 7.0

    The Program Hypergraph extends binary program semantic graphs to arbitrary-arity hyperedges to faithfully represent multi-way relations in geometric algebra and spatial architectures.

  2. Adaptive Domain Models: Bayesian Evolution, Warm Rotation, and Principled Training for Geometric and Neuromorphic AI

    cs.AI 2026-03 conditional novelty 6.0

    Composing dimensional types, program hypergraphs, and b-posits yields depth-independent training memory, grade-preserving geometric updates, Bayesian distillation, and certified warm model rotation for domain AI.

  3. The Program Hypergraph: Multi-Way Relational Structure for Geometric Algebra, Spatial Compute, and Physics-Aware Compilation

    cs.PL 2026-03 conditional novelty 5.5

    Program Hypergraphs lift binary semantic graphs to arbitrary-arity hyperedges so grade inference, k-simplex joins, and spatial co-location become first-class, jointly analyzable compilation facts.

  4. Adaptive Domain Models: Bayesian Evolution, Warm Rotation, and Principled Training for Geometric and Neuromorphic AI

    cs.AI 2026-03 unverdicted novelty 3.0

    The paper claims that composing the Dimensional Type System, Program Hypergraph, and b-posit 2026 standard yields depth-independent training memory at ~2x inference, grade-preserving updates, Bayesian distillation for...