Pith. sign in

REVIEW 1 cited by

Learning Broken Symmetries with Resimulation and Encouraged Invariance

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 2311.05952 v1 pith:LYXF53M2 submitted 2023-11-10 hep-ex

classification hep-ex
keywords symmetrybrokennetworksdatasymmetriestrainingaugmentationconverge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recognizing symmetries in data allows for significant boosts in neural network training. In many cases, however, the underlying symmetry is present only in an idealized dataset, and is broken in the training data, due to effects such as arbitrary and/or non-uniform detector bin edges. Standard approaches, such as data augmentation or equivariant networks fail to represent the nature of the full, broken symmetry. We introduce a novel data-augmentation scheme that respects the true underlying symmetry and avoids artifacts by augmenting the training set with transformed pre-detector examples whose detector response is then resimulated. In addition, we encourage the network to treat the augmented copies identically, allowing it to learn the broken symmetry. While the technique can be extended to other symmetries, we demonstrate its application on rotational symmetry in particle physics calorimeter images. We find that neural networks trained with pre-detector rotations converge to a solution more quickly than networks trained with standard post-detector augmentation, and that networks modified to encourage similar internal treatment of augmentations of the same input converge even faster.

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