pith. sign in

On universality of deep equivariant networks.arXiv preprint arXiv:2510.15814

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

Universality results for equivariant neural networks remain rare. Those that do exist typically hold only in restrictive settings: either they rely on regular or higher-order tensor representations, leading to impractically high-dimensional hidden spaces, or they target specialized architectures, often confined to the invariant setting. This work develops a more general account. For invariant networks, we establish a universality theorem under separation constraints, showing that the addition of a fully connected readout layer secures approximation within the class of separation-constrained continuous functions. For equivariant networks, where results are even scarcer, we demonstrate that standard separability notions are inadequate and introduce the sharper criterion of $\textit{entry-wise separability}$. We show that with sufficient depth or with the addition of appropriate readout layers, equivariant networks attain universality within the entry-wise separable regime. Together with prior results showing the failure of universality for shallow models, our findings identify depth and readout layers as a decisive mechanism for universality, additionally offering a unified perspective that subsumes and extends earlier specialized results.

fields

cs.LG 2

years

2026 1 2025 1

verdicts

UNVERDICTED 2

clear filters

representative citing papers

Data Augmentation: A Fourier Analysis Perspective

cs.LG · 2026-06-23 · unverdicted · novelty 6.0

Partial random data augmentation matches full group augmentation's minimax rates up to vanishing approximation error for classical learning problems, but exact invariance requires the full group for expressive hypotheses.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • Data Augmentation: A Fourier Analysis Perspective cs.LG · 2026-06-23 · unverdicted · none · ref 57 · internal anchor

    Partial random data augmentation matches full group augmentation's minimax rates up to vanishing approximation error for classical learning problems, but exact invariance requires the full group for expressive hypotheses.

  • Drawback of Enforcing Equivariance and its Compensation via the Lens of Expressive Power cs.LG · 2025-12-10 · unverdicted · none · ref 6 · internal anchor

    Enforcing equivariance reduces expressive power in 2-layer ReLU networks but enlarging the model compensates with proven size bounds and yields lower hypothesis space dimensionality for better generalization.