Pith. sign in

REVIEW 1 cited by

Equivariant Neural Tangent Kernels

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 2406.06504 v2 pith:TQ7SFKHC submitted 2024-06-10 cs.LG

classification cs.LG
keywords equivarianttrainingneuraldynamicskernelsnetworksntkstangent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Little is known about the training dynamics of equivariant neural networks, in particular how it compares to data augmented training of their non-equivariant counterparts. Recently, neural tangent kernels (NTKs) have emerged as a powerful tool to analytically study the training dynamics of wide neural networks. In this work, we take an important step towards a theoretical understanding of training dynamics of equivariant models by deriving neural tangent kernels for a broad class of equivariant architectures based on group convolutions. As a demonstration of the capabilities of our framework, we show an interesting relationship between data augmentation and group convolutional networks. Specifically, we prove that they share the same expected prediction at all training times and even off-manifold. In this sense, they have the same training dynamics. We demonstrate in numerical experiments that this still holds approximately for finite-width ensembles. By implementing equivariant NTKs for roto-translations in the plane ($G=C_{n}\ltimes\mathbb{R}^{2}$) and 3d rotations ($G=\mathrm{SO}(3)$), we show that equivariant NTKs outperform their non-equivariant counterparts as kernel predictors for histological image classification and quantum mechanical property prediction.

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. Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits

    cs.LG 2025-12 conditional novelty 6.0 of 10

    Hopfield networks can memorize entire graph isomorphism classes with polynomially many samples, aided by an implicit norm-minimization bias that drives weights toward a 3-dimensional invariant subspace.

Pith tools