Pith. sign in

REVIEW 2 cited by

Regularizing Towards Soft Equivariance Under Mixed Symmetries

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 2306.00356 v1 pith:5WZVOADH submitted 2023-06-01 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords symmetriesapproximatemethodapproximationmixedmodelssymmetrytype
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Datasets often have their intrinsic symmetries, and particular deep-learning models called equivariant or invariant models have been developed to exploit these symmetries. However, if some or all of these symmetries are only approximate, which frequently happens in practice, these models may be suboptimal due to the architectural restrictions imposed on them. We tackle this issue of approximate symmetries in a setup where symmetries are mixed, i.e., they are symmetries of not single but multiple different types and the degree of approximation varies across these types. Instead of proposing a new architectural restriction as in most of the previous approaches, we present a regularizer-based method for building a model for a dataset with mixed approximate symmetries. The key component of our method is what we call equivariance regularizer for a given type of symmetries, which measures how much a model is equivariant with respect to the symmetries of the type. Our method is trained with these regularizers, one per each symmetry type, and the strength of the regularizers is automatically tuned during training, leading to the discovery of the approximation levels of some candidate symmetry types without explicit supervision. Using synthetic function approximation and motion forecasting tasks, we demonstrate that our method achieves better accuracy than prior approaches while discovering the approximate symmetry levels correctly.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Unsupervised Causal Abstractions Discovery

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    Low-rank graphs induce latents that form causal abstractions, with identifiability results and a practical objective enabling unsupervised learning of high-level SCMs from low-level measurements.

  2. Approximate Equivariance via Projection-based Regularisation

    cs.LG 2026-01 conditional novelty 5.0 of 10

    Projection-based regularisation penalises the distance between layer weights and their group-equivariant projection, computed exactly in Fourier space, yielding fast approximate equivariance for finite and continuous groups.

Pith tools