cs.LGMar 8, 2026

Generalized Reduction to the Isotropy for Flexible Equivariant Neural Fields

Authors: Alejandro García-Castellanos, Gijs Bellaard, Remco Duits, Daniel Pelt, Erik J Bekkers

Organizations: Amsterdam Machine Learning Lab (AMLab), University of Amsterdam · Department of Mathematics and Computer Science, Eindhoven University of Technology · Leiden Institute of Advanced Computer Science, Universiteit Leiden

Abstract

Many geometric learning problems require invariants on heterogeneous product spaces, i.e., products of distinct spaces carrying different group actions, where standard techniques do not directly apply. We show that, when a group GG acts transitively on a space MM, any GG-invariant function on a product space X×MX \times M can be reduced to an invariant of the isotropy subgroup HH of MM acting on XX alone. Our approach establishes an explicit orbit equivalence (X×M)/G≅X/H(X \times M)/G \cong X/H, yielding a principled reduction that preserves expressivity. We apply this characterization to Equivariant Neural Fields, extending them to arbitrary group actions and homogeneous conditioning spaces, and thereby removing the major structural constraints imposed by existing methods.

Explore similar work

Sep 22, 2026

Theory for groupoid equivariant neural networks: an approach for steerable CNNs on bounded domains

Equivariant convolutional neural networks are usually built from a group acting globally on the space of signals. This hypothesis is inappropriate for many bounded or stratified domains: an ambient rigid motion may be admissible only on part of the domain, and the boundary introduces geometric types that are invisible to a transitive group action. We develop a theory of groupoid-equivariant neural networks in which the symmetry datum consists of a groupoid, a selected pseudogroup of local bisections, a measure, and input and output representation bundles. For integral channels on the object space, we prove a bisection-equivariant kernel theorem: equivariance is equivalent to a transport constraint on the two-point kernel, and its solutions are classified by one joint-stabilizer intertwiner on each orbit of pairs. As a case study we apply the theory to bounded planar domains. The resulting architecture is implemented through offline nullspace bases and sparse gather--transform--scatter operations. A Poisson--Dirichlet kernel study is used separately to assess boundary-aware inductive bias; the exact inverse is shown to preserve the global symmetries of the rectangle but not general proper local bisections. The numerical results show that the proposed architectures provide significant advantages when symmetries cannot be globally implemented by group actions and provide an accuracy improvement of at least one order of magnitude with respect to the models tested.
Feb 23, 2026

Quantitative Approximation Rates for Group Equivariant Learning

The universal approximation theorem establishes that neural networks can approximate any continuous function on a compact set. Later works in approximation theory provide quantitative approximation rates for ReLU networks on the class of αα-Hölder functions f:[0,1]N→Rf: [0,1]^N \to \mathbb{R}. The goal of this paper is to provide similar quantitative approximation results in the context of group equivariant learning, where the learned αα-Hölder function is known to obey certain group symmetries. While there has been much interest in the literature in understanding the universal approximation properties of equivariant models, very few quantitative approximation results are known for equivariant models. In this paper, we bridge this gap by deriving quantitative approximation rates for several prominent group-equivariant and invariant architectures. The architectures that we consider include: the permutation-invariant Deep Sets architecture; the permutation-equivariant Sumformer and Transformer architectures; joint invariance to permutations and rigid motions using invariant networks based on frame averaging; and general bi-Lipschitz invariant models. Overall, we show that equally-sized ReLU MLPs and equivariant architectures are equally expressive over equivariant functions. Thus, hard-coding equivariance does not result in a loss of expressivity or approximation power in these models.
May 11, 2026

Steerable Neural ODEs on Homogeneous Spaces

We introduce steerable neural ordinary differential equations on homogeneous spaces M=G/HM=G/H. These models constitute a novel geometric extension of manifold neural ordinary differential equations (NODEs) that transport associated feature vectors transforming under the local symmetry group HH. We interpret features as sections of associated vector bundles over MM, and describe their evolution as parallel transport. This results in a coupled system of ODEs consisting of a flow equation on MM and a steering equation acting on features. We show that steerable NODEs are GG-equivariant whenever the vector field generating the flow and the connection governing parallel transport are both GG-invariant. Furthermore, we demonstrate how steerable NODEs incorporate existing NODE models and continuous normalizing flows on Lie groups. Our framework provides the geometric foundation for learning continuous-time equivariant dynamics of general vector-valued features on homogeneous spaces.