Pith. sign in

REVIEW 1 cited by

Rethinking SO(3)-equivariance with Bilinear Tensor 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 2303.11288 v1 pith:GMSQDBXY submitted 2023-03-20 cs.LG hep-exhep-ph

classification cs.LGhep-exhep-ph
keywords equivariancemethodnetworkrepresentationsstructuretensortextitapplications
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Many datasets in scientific and engineering applications are comprised of objects which have specific geometric structure. A common example is data which inhabits a representation of the group SO$(3)$ of 3D rotations: scalars, vectors, tensors, \textit{etc}. One way for a neural network to exploit prior knowledge of this structure is to enforce SO$(3)$-equivariance throughout its layers, and several such architectures have been proposed. While general methods for handling arbitrary SO$(3)$ representations exist, they computationally intensive and complicated to implement. We show that by judicious symmetry breaking, we can efficiently increase the expressiveness of a network operating only on vector and order-2 tensor representations of SO$(2)$. We demonstrate the method on an important problem from High Energy Physics known as \textit{b-tagging}, where particle jets originating from b-meson decays must be discriminated from an overwhelming QCD background. In this task, we find that augmenting a standard architecture with our method results in a \ensuremath{2.3\times} improvement in rejection score.

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. Learning Broken Symmetries with Approximate Invariance

    hep-ph 2024-12 accept novelty 6.0 of 10

    A dual-subnet network with a learned pT-dependent weighting learns broken symmetries faster than unconstrained networks while avoiding the performance ceiling of exactly invariant networks.

Pith tools