Learning Partial Equivariances from Data
Abstract
Group Convolutional Neural Networks (G-CNNs) constrain learned features to respect the symmetries in the selected group, and lead to better generalization when these symmetries appear in the data.
If this is not the case, however, equivariance leads to overly constrained models and worse performance.
Frequently, transformations occurring in data can be better represented by a subset of a group than by a group as a whole, e.g., rotations in [− 90 ○ , 90 ○ ] .
In such cases, a model that respects equivariance partially is better suited to represent the data.
In addition, relevant transformations may differ for low and high-level features.
For instance, full rotation equivariance is useful to describe edge orientations in a face, but partial rotation equivariance is better suited to describe face poses relative to the camera.
In other words, the optimal level of equivariance may differ per layer.
In this work, we introduce Partial G-CNNs : G-CNNs able to learn layer-wise levels of partial and full equivariance to discrete, continuous groups and combinations thereof as part of training.
Partial G-CNNs retain full equivariance when beneficial, e.g., for rotated MNIST, but adjust it whenever it becomes harmful, e.g., for classification of 6 / 9 digits or natural images.
We empirically show that partial G-CNNs pair
G-CNNs when full equivariance is advantageous, and outperform them otherwise.
Introduction
The translation equivariance of Convolutional Neural Networks (CNNs) [31] has proven an important inductive bias for good generalization on vision tasks.
This is achieved by restricting learned features to respect the translation symmetry encountered in visual data, such that if an input is translated, its features are also translated, but not modified.
Group equivariant CNNs (G-CNNs) [7] extend equivariance to other symmetry groups.
Analogously, they restrict the learned features to respect the symmetries in the group considered such that if an input is transformed by an element in the group, e.g., a rotation, its features are also transformed, e.g., rotated, but not modified.
Nevertheless, the group to which G-CNNs are equivariant must be fixed prior to training, and imposing equivariance to symmetries not present in the data leads to overly constrained models and worse performance [6].
The latter comes from a difference in the data distribution, and the family of distributions the model can describe.
Consequently, the group must be selected carefully, and it should correspond to the transformations that appear naturally in the data.
Frequently, transformations appearing in data can be better represented by a subset of a group than by a group as a whole, e.g., rotations in [− 90 ○ , 90 ○ ] .
For instance, natural images much more likely show an elephant standing straight or slightly rotated than an elephant upside-down.
In some cases, group transformations even change the desired model response, e.g., in the classification of the digits 6 and 9.
In both examples, the data distribution is better represented by a model that respects rotation equivariance partially .
That is, a model equivariant to some, but not all rotations.
Consequently, all output components are part of the output any
In a partial group convolution, however, the domain of the output is a learned subset S and all values outside of S are discarded.
As a result, parts of the output in a partial group convolution can change for different group transformations of the input.
In this figure, the output components within S for a 0 ○ rotation (outlined in orange) gradually leave S for stronger transformations of the input.
For strong transformations –here a 180 ○ rotation–, the output components within S are entirely different.
This difference allows partial group convolutions to distinguish among input transformations.
By controlling the size of S , the level of equivariance of the operation can be adjusted.
Moreover, the optimal level of equivariance may change per layer.
This results from changes in the likelihood of some transformations for low and high-level features.
For instance, whereas the orientations of edges in an human face are properly described with full rotation equivariance, the poses of human faces relative to the camera are better represented by rotations in a subset of the circle.
The previous observations indicate that constructing a model with different levels of equivariance at each layer may be advantageous.
Weiler and Cesa [46] empirically observed that manually tuning the level of equivariance at different layers leads to accuracy improvements for non-fully equivariant tasks.
Nevertheless, manually tuning layer-wise levels of equivariance is not straightforward and requires iterations over several possible combinations of equivariance levels.
Consequently, it is desirable to construct a model able to learn optimal levels of equivariance directly from data.
In this work, we introduce Partial Group equivariant CNNs (Partial G-CNNs): a family of equivariant models able to learn layer-wise levels of equivariance directly from data.
Instead of sampling group elements uniformly from the group during the group convolution –as in G-CNNs–, Partial G-CNNs learn a probability distribution over group elements at each group convolutional layer in the network, and sample group elements during group convolutions from the learned distributions.
By tuning the learned distributions, Partial G-CNNs adjust their level of equivariance at each layer during training.
We evaluate Partial G-CNNs on illustrative toy tasks and vision benchmark datasets.
We show that whenever full equivariance is beneficial, e.g., for rotated MNIST, Partial G-CNNs learn to remain fully equivariant.
However, if equivariance becomes harmful, e.g., for classification of 6 / 9 digits and natural images, Partial G-CNNs learn to adjust equivariance to a subset of the group to improve accuracy.
Partial G-CNNs improve upon conventional G-CNNs when equivariance reductions are advantageous, and match their performance whenever their design is optimal.
In summary, our contributions are:
• We present a novel design for the construction of equivariant neural networks, with which layer-wise levels of partial or full equivariance can be learned from data.
• We empirically show that Partial G-CNNs perform better than conventional G-CNNs for tasks for which full equivariance is harmful, and match their performance if full equivariance is beneficial.
Background
This work expects the reader to have a basic understanding of concepts from group theory such as groups, subgroups and group actions.
Please refer to Appx.
A if you are unfamiliar with these terms.
Group equivariance.
Group equivariance is the property of a map to respect the transformations in a group.
We say that a map is equivariant to a group if whenever the input is transformed by elements of the group, the output of the map is equally transformed but not modified.
Formally, for a group G with elements g ∈ G acting on a set X , and a map ϕ
∶ X → X , we say that ϕ is equivariant to G if:
[Equation]
For example, the convolution of a signal f ∶ R → R and a kernel ψ ∶ R → R is translation equivariant because L t ( ψ ∗ f )=
ψ ∗ L t f , where L t translates the function by t : L t f ( x )=
f
( x − t ) .
That is, if the input is translated, its convolutional descriptors are also translated but not modified.
The group convolution.
To construct neural networks equivariant to a group G , we require an operation that respects the symmetries in the group.
The group convolution is such a mapping.
It generalizes the convolution for equivariance to general symmetry groups.
Formally, for any u ∈ G , the group convolution of a signal f ∶ G → R and a kernel ψ ∶ G → R is given by:
[Equation]
where µ G (⋅) is the (invariant) Haar measure of the group.
The group convolution is G -equivariant in the sense that for all u,v,w ∈ G , it holds that:
[Equation]
The lifting convolution.
Regularly, the input of a neural network is not readily defined on the group of interest G , but on a sub-domain thereof X , i.e., f ∶ X → R .
For instance, medical images are functions on R 2 although equivariance to 2D-translations and planar rotations is desirable.
In this case X = R 2 , and the group of interest is G = SE ( 2 ) .
Consequently, we must first lift the input from X to G in order to use group convolutions.
This is achieved via the lifting convolution defined as:
[Equation]
Practical implementation of the group convolution.
The group convolution requires integration over a continuous domain and, in general, cannot be computed in finite time.
As a result, it is generally approximated.
Two main strategies exist to approximate group convolutions with regular group representations: group discretization [7] and Monte Carlo approximation [16].
The former approximates the group convolution with a fixed group discretization.
Unfortunately, the approximation becomes only equivariant to the transformations in the discretization and not to the intrinsic continuous group.
A Monte Carlo approximation, on the other hand, ensures equivariance –in expectation– to the continuous group.
This is done by uniformly sampling transformations { v j } , { u i } from the group during each forward pass, and using these transformations to approximate the group convolution as:
[Equation]
Note that this Monte Carlo approximation requires the convolutional kernel ψ to be defined on the continuous group .
As the domain cannot be enumerated, independent weights cannot be used to parameterize the convolutional kernel.
Instead, Finzi et al.
[16] parameterize it with a small neural network, i.e., ψ ( x )=
MLP ( x ) .
This allows them to map all elements v − 1 j u i to a defined kernel value.
Partial Group Equivariant Networks 3.1 (Approximate) partial group equivariance
Before defining the partial group convolution, we first formalize what we mean by partial group equivariance.
We say that a map ϕ is partially equivariant to G , if it is equivariant to transformations in a subset of the group S ⊂ G , but not necessarily to all transformations in the group G .
That is, if:
[Equation]
Different from equivariance to a subgroup of G –a subset of the group that also fulfills the group axioms–, we do not restrict the subset S to be itself a group.
As explained in detail in Sec. 3.3, partial equivariance holds, in general, only approximately , and it is exact only if S is a subgroup of G .
This results from the set S not being necessarily closed under group actions.
In other words, partial equivariance is a relaxation of group equivariance similar to soft invariance [44]: the property of a map to be approximately invariant.
We opt for the word partial in the equivariance setting to emphasize that (approximate) partial group equivariance arises by restricting the domain of the signals in a group convolution to a subset, i.e., a part, of the group.
3.2 The partial group convolution
Let S ( 1 ) , S ( 2 ) be subsets of a group G and p ( u ) be a probability distribution on the group, which is non-zero only on S ( 2 ) .
The partial group convolution from a function f ∶ S ( 1 ) → R to a function h
∶ S ( 2 ) → R is given by:
[Equation]
[Equation]
In contrast to group convolutions whose inputs and outputs are always defined on the entire group, i.e., f,h ∶ G → R , the domain of the input and output of the partial group convolution can also be subsets of the group .
By learning these subsets, the model can become ( i ) fully equivariant ( S ( 1 ) , S ( 2 ) =
G ) , ( ii ) partially equivariant ( S ( 1 ) , S ( 2 ) ≠ G ) , or ( iii ) forget some equivariances ( S ( 2 ) a subgroup of G ) .
3.3 From group convolutions to partial group convolutions
In this section, we show how group convolutions can be extended to describe partial equivariances.
Vital to our analysis is the equivariance proof of the group convolution [7, 9].
In addition, we must distinguish between the domains of the input and output of the group convolution, i.e., the domains of f and h in Eq. 2.
This distinction is important because they may be different for partial group convolutions.
From here on, we refer to these as the input domain and the output domain .
Proposition 3.1.
Let L w f ( u )=
f ( w − 1 u ) .
The group convolution is G -equivariant in the sense that:
[Equation]
all
[Equation]
Proof.
[Equation]
In the first line, the change of variables ¯ v ∶= w − 1 v is used.
This is possible because the group convolution is a map from the group to itself, and thus if w,v ∈ G , so does w − 1 v .
Moreover, as the
Haar measure is an invariant measure on the group, we have that µ G ( v )=
µ G ( ¯ v ) , for all v, ¯ v ∈ G .
Going from the group G to a subset S .
Crucial to the proof of Proposition 3.1 is the fact the group convolution is an operation from functions on the group to functions on the group.
As a result, w − 1 u is a member of the output domain for any w ∈ G applied to the input domain.
Consequently, a group transformation applied to the input can be reflected by an equivalent transformation on the output.
Now, consider the case in which the output domain is not the group G , but instead an arbitrary subset
S ⊂ G , e.g., rotations in [− π 2 , π 2 ] .
Following the proof of Proposition 3.1 with u ∈ S , and v ∈ G , we observe that the operation is equivariant to transformations w ∈ G as long as w − 1 u is a member of S .
However, if w − 1 u does not belong to the output domain S , the output of the operation cannot reflect an equivalent transformation to that of the input, and thus equivariance is not guaranteed (Fig. 1).
By tuning the size of S , partial group convolutions can adjust their level of equivariance.
Note that equivariance is only obtained if Eq.
7 holds for all elements in the output domain.
That is, if w − 1 u is a member of S , for all elements u ∈ S .
For partial group convolutions, this is, in general, not the case as the output domain S is not necessarily closed under group transformations.
Nevertheless, we can precisely quantify how much the output response will change for any input transformation given an output domain S .
Intuitively, this difference is given by the difference in the parts of the output feature representation that go in and out of S by the action of input group transformations.
The stronger the transformation and the smaller the size of S , the larger the equivariance difference in the output is (Fig. 1).
The formal treatment and derivation are provided in Appx.
B.1.
Going from a subset S ( 1 ) to another subset S ( 2 ) .
Now, consider the case in which the domain of the input and the output are both subsets of the group, i.e., v ∈ S ( 1 ) and u ∈ S ( 2 ) .
Analogous to the previous case, equivariance to input transformations w ∈ G holds at positions u ∈ S ( 2 ) for which w − 1 u are also members of S ( 2 ) .
Nevertheless, the input domain is not longer restricted to be closed, and thus the input can also change for different group transformations.
To see this, consider a partial group convolution from an input subset S ( 1 ) to the group G (Fig. 2).
Even if the output domain is the group, differences in the output feature map can be seen.
This results from differences observed in the input feature map f for different group transformations of the input.
Similar to the previous case, we can precisely quantify how much the output response changes for an arbitrary subset S ( 1 ) in the input domain.
Intuitively, the difference is given by the change in the parts of the input feature representation that go in and out of S ( 2 ) by the action of the input group transformation.
The stronger the transformation and the smaller the size of S ( 1 ) , the larger the difference in the output is (Fig. 2).
The formal treatment and derivation of this quantity is provided in Appx.
B.2.
Consequently, even if the output domain is the group, i.e., S ( 2 ) = G , a partial group convolution does not produce exactly equivariant outputs by design.
The difference exact equivariance in the input transformation of S
Special case: lifting convolutions.
To conclude, we note that the lifting convolution (Eq. 3) is a special case of a partial group convolution with S ( 1 ) =
X and S ( 2 ) =
G .
Note however, that the lifting convolution is fully group equivariant.
This is because the domain of the input – X – is closed under group transformations.
Hence no input component leaves X for group transformations of the input
3.4 Learning group subsets via probability distributions on group elements
So far, we have discussed the properties of the partial group convolution in terms of group subsets without specifying how these subsets can be learned.
In this section, we describe how this can be done by learning a certain probability distribution on the group.
We provide specific examples for discrete groups, continuous groups, and combinations thereof.
Vital to our approach is the Monte Carlo approximation to the group convolution presented in Sec. 2:
[Equation]
As shown in Appx.
C, this approximation is equivariant to G in expectation if the elements in the input and output domain are uniformly sampled from the Haar measure, i.e., u i ,v j ∼ µ G (⋅) .
Approach.
Our main observation is that we can prioritize sampling specific group elements during the group convolution by learning a probability distribution p ( u ) over the elements of the group.
When group convolutions draw elements uniformly from the group, each group element is drawn with equal probability and thus, the resulting approximation is fully equivariant in expectation.
However, we can also define a different probability distribution that draws some samples with larger probability.
For instance, we can sample from a certain region, e.g., rotations in [− π 2 , π 2 ] , by defining a probability distribution on the group p ( u ) which is uniform in this range, but zero otherwise.
The same principle can be used to forget an equivariance by letting this distribution collapse to a single point, e.g., the identity, along the corresponding group dimension.
In other words, learning a probability distribution p ( u ) on the group that is non-zero only in a subset of the group can be used to effectively learn this subset.
Specifically, we define a probability distribution p ( u ) on the output domain of the group convolution in order to learn a subset of the group
S ( 2 ) upon which partial equivariance is defined.
Note that we only need to define a distribution on the output domain of each layer.
This is because neural networks apply layers sequentially, and thus the distribution on the output domain of the previous layer defines the input domain of the next layer.
Distributions for one-dimensional continuous groups.
We take inspiration from Augerino [3], an use the reparameterization trick [26] to parameterize continuous distributions.
In particular, we use the reparameterization trick on the Lie algebra of the group [15] to define a distribution which is uniform over a connected set of group elements [ u − 1 ,...,e,...,u ] , but zero otherwise.
To this end, we define a uniform distribution U ( u ⋅ [− 1 , 1 ]) with learnable u on the Lie algebra g , and map it to the group via the pushforward of the exponential map
exp ∶ g
→ G .
This give us a distribution which is uniform over a connected set of elements [ u − 1 ,...,e,...,u ] , but zero otherwise.
For instance, we can learn a distribution on the rotation group SO ( 2 ) , which is uniform between [− θ,θ ] and zero otherwise by defining a uniform probability distribution U ( θ ⋅[− 1 , 1 ]) with learnable θ on the Lie algebra, and mapping it to the group.
If we parameterize group elements as scalars g ∈ [− π,π ) , the exponential map is the identity, and thus p ( g )=
U ( θ ⋅ [− 1 , 1 )) .
If we sample group elements from this distribution during the calculation of the group convolution, the output domain will only contain elements in [− θ,θ ) and the output feature map will be partially equivariant.
Distributions for one-dimensional discrete groups.
We can define a probability distribution on a discrete group as the probability of sampling from all possible element combinations.
For instance, for the mirroring group { 1 , − 1 } , this distribution assigns a probability to each of the combinations { 0 , 0 } , { 0 , 1 } , { 1 , 0 } , { 1 , 1 } indicating whether the corresponding element is sampled (1) or not (0).
For a group with elements { e,g 1 ,...,g n } , however, this means sampling from 2 n + 1 elements, which is computationally expensive and potentially difficult to train.
To cope with this, we instead define element-wise Bernoulli distributions over each of the elements { g 1 ,...,g n } , and learn the probability p i of sampling each element g i .
The probability distribution on the group can then be formulated as the joint probability of the element-wise Bernoulli distributions p ( e,g 1 ,...,g n ) =
∏ ni = 1 p ( g i ) .
To learn the element-wise Bernoulli distributions, we use the Gumbel-Softmax trick [25, 35], and use the Straight-Through Gumbel-Softmax to back-propagate through sampling.
If all the probabilities are equal to 1, i.e., { p i = 1 } ni = 1 , the group convolution will be fully equivariant.
Whenever probabilities start declining, group equivariance becomes partial, and, in the limit, if all probabilities become zero, i.e., { p i = 0 } ni = 1 , then only the identity is sampled and this equivariance is effectively forgotten.
Probability distributions for multi-dimensional groups.
There exist several multi-dimensional groups with important applications, such as the orthogonal group O ( 2 ) –parameterized by rotations and mirroring–, or the dilation-rotation group –parameterized by scaling and rotations–.
For multi-dimensional groups, we parameterize the probability distribution over the entire group as a combination of independent probability distributions along each of the group axes .
For a group G with elements g decomposable along n dimensions g =(
d 1 ,...,d n ) , we decompose the probability distribution as: p ( g )=
∏ ni = 1 p ( d i ) , where the probability p ( d i ) is defined given the type of space – continuous or discrete–. For instance, for the orthogonal group O ( 2 ) defined by rotations r and mirroring m , i.e., g = ( r,m ) , r ∈ SO ( 2 ) ,m ∈ {± 1 } , we define the probability distribution on the group as p ( g )=
p ( r ) ⋅ p ( m ) , where p ( r ) is a continuous distribution, and p ( m ) is a discrete one as defined above.
3.5 Partial Group Equivariant Networks
To conclude this section, we illustrate the structure of Partial
G-CNNs.
We build upon Finzi et al.
[16] and extend their continuous G-CNNs to discrete groups.
This is achieved by parameterizing the convolutional kernels on (continuous) Lie groups, and applying the action of discrete groups directly on the group representation of the kernels.
In addition, we replace the isotropic lifting of Finzi et al.
[16] with lifting convolutions (Eq. 3).
Inspired by Romero et al.
[39], we parameterize convolutional kernels as implicit neural representations with SIRENs [41].
This parameterization leads to higher expressivity, faster convergence, and better accuracy than ReLU , LeakyReLU and Swish MLP parameterizations used so far for continuous G-CNNs, e.g., [40, 16] –see Tab. 7, [27]-.
The architecture of Partial G-CNNs is shown in Fig.
Related work
Group equivariant neural networks.
The seminal work of G-CNNs [7] has inspired several methods equivariant to many different groups.
Existing methods show equivariance to planar [11, 50, 48], spherical rotations [47, 8, 12–14], scaling [49, 42, 38], and other symmetry groups [36, 4, 18].
Group equivariant self-attention has also been proposed [19, 37, 23].
Common to all these methods is that they are fully equivariant and the group must be fixed prior to training.
Contrarily, Partial G-CNNs learn their level of equivariance from data and can represent full, partial and no equivariance.
Invariance learning.
Learning the right amount of global invariance from data has been explored by learning a probability distribution over continuous test-time augmentations [3], or by using the marginal likelihood of a Gaussian process [44, 43].
Contrary to these approaches, Partial G-CNNs aim to learn the right level of equivariance at every layer and do not require additional loss terms.
Partial G-CNNs relate to Augerino [3] in the form that probability distributions are defined on
[Table] [Table]
continuous groups.
However, Partial G-CNNs are intended to learn partial layer-wise equivariances and are able to learn probability distributions on discrete groups.
There also exist learnable data augmentation strategies [34, 20, 33, 5] that can find transformations of the input that optimize the task loss.
We can also view Augerino as learning a smart data augmentation technique which we compare with.
In contrast to these methods, Partial G-CNNs find optimal partial equivariances at each layer.
Equivariance learning.
Learning equivariant mappings from data has been explored by metalearning of weight-tying matrices encoding symmetry equivariances [51, 1] and by learning the Lie algebra generators of the group jointly with the parameters of the network [10].
These approaches utilize the same learned symmetries across layers.
MSR [51] is only applicable to (small) discrete groups, and requires long training times.
L-Conv [10] is only applicable to continuous groups and is not fully compatible with current deep learning components, e.g., pooling, normalization.
Unlike these approaches, Partial G-CNNs can learn levels of equivariance at every layer, are fully compatible with current deep learning components, and are applicable for discrete groups, continuous groups and combinations thereof.
We note, however, that Zhou et al.
[51], Dehmamy et al.
[10] learn the structure of the group from scratch.
Contrarily, Partial G-CNNs start from a (very) large group and allows layers in the network to constrain their equivariance levels to better fit the data.
Finzi et al.
[17] incorporate soft equivariance constraints by combining outputs of equivariant and non-equivariant layers running in parallel, which incurs in large parameter and time costs.
Differently, Partial G-CNNs aim to learn from data the optimal amount of partial equivariance directly on the group manifold.
Experiments
Experimental details.
We parameterize all our convolutional kernels as 3-layer SIRENs [41] with 32 hidden units.
All our networks –except for the (partial) group equivariant 13-layer CNNs [29] used in Sec.
5.1– are constructed with 2 residual blocks of 32 channels each, batch normalization [24] following the structure shown in Fig.
Here, we intentionally select our networks to be simple as to better assess the effect of partial equivariance.
We avoid learning probability distributions on the translation part of the considered groups, and assume all spatial positions to be sampled in order to use fast PyTorch convolution primitives in our implementation.
Additional experimental details such as specific hyperparameters used and complementary results can be found in Appx.
E, F.
Toy tasks: MNIST6-180 and MNIST6-M. First, we validate whether Partial G-CNNs can learn partial equivariances.
To this end, we construct two illustrative datasets: MNIST6-180 , and MNIST6-M .
MNIST6-180 is constructed by extracting the digits of the class 6 from the MNIST dataset [31], and rotating them on the circle.
The goal is to predict whether the number is a six, i.e., a rotation in [− 90 ○ , 90 ○ ] was applied, or a nine otherwise.
Similarly, we construct MNIST6-M by mirroring digits over the y axis.
The the goal is to predict whether a digit was mirrored or not.
As shown in Tab. 1, G-CNNs are unable to solve these tasks as discrimination among group transformations is required.
Specifically, SE ( 2 ) -CNNs are unable to solve MNIST6-180, and Mirror -CNNs –G-CNNs equivariant to reflections– are unable to solve MNIST6-M.
Furthermore, E ( 2 ) -CNNs cannot solve any of the two tasks, because E ( 2 ) -CNNs incorporate equivariance to both rotations and reflections.
Partial G-CNNs, on the other hand, easily solve both tasks with corresponding base groups.
This indicates that Partial G-CNNs learn to adjust the equivariance levels in order to solve the tasks.
In addition, we verify the learned levels of equivariance for a Partial SE ( 2 ) -CNN on MNIST6-180.
To this end, we plot the probability of assigning the label 6 to test samples of MNIST6-180 rotated on the whole circle.
Fig 4 shows that the network learns to predict “6” for rotated samples in [− 90 ○ , 90 ○ ] , and “9” otherwise.
Note that Partial G-CNNs learn the expected levels of partial equivariance without any additional regularization loss terms to encourage them –as required in Benton et al.
[Table]
Benchmark image datasets.
Next, we validate Partial G-CNNs on classification datasets: RotMNIST [30], CIFAR-10 and CIFAR-100 [28].
Results on PatchCam [45] can be found in Appx.
F.
We construct Partial G-CNNs with base groups SE ( 2 ) and E ( 2 ) , and varying number of elements used in the Monte Carlo approximation of the group convolution and compare them to equivalent
G-CNNs and ResNets (equivalent to T ( 2 ) -CNNs).
Our results (Tab. 3) show that Partial G-CNNs are competitive with G-CNNs when full-equivariance is advantageous (rotated MNIST and PatchCamelyon).
However, for tasks in which the data does not naturally exhibit full rotation equivariance (CIFAR-10 and CIFAR-100), Partial G-CNNs consistently outperform fully equivariant G-CNNs.
The need for learning partial layer-wise equivariances.
Next, we evaluate ( i ) the effect of learning partial equivariances instead of soft invariances, and ( ii ) the effect of learning layer-wise levels of equivariances instead of a single level of partial equivariance for the entire network.
For the former, we compare Partial G-CNNs to equivalent ResNets with Augerino [3] (Tab. 2).
We extend our strategy to learn distributions on discrete groups to the Augerino framework to allow it to handle groups with discrete components, e.g., E ( 2 ) .
For the latter, we construct regular G-CNNs and replace either the final group convolutional layer by a T ( 2 ) convolutional layer, or the global max pooling layer at the end by a learnable MLP (Tab. 4).
If determining the level of equivariance at the end of the network is sufficient, these models should perform comparably to Partial G-CNNs.
Tab. 2 shows that Augerino is competitive to Partial G-CNNs on rotated MNIST, but falls behind by a large margin on CIFAR-10 and CIFAR-100.
This result can be explained by how these datasets are constructed.
RotMNIST is constructed by rotating MNIST digits globally, thus it is not surprising that a model able to encode global invariances can match Partial G-CNNs.
The invariance and equivariance relationships in natural images, however, are more complex, as they can be local as well.
Consequently, tackling different levels of equivariance at each layer using Partial G-CNNs leads to benefits over using a single level of global invariance for the entire network.
Although the T ( 2 ) and MLP alternatives outlined before could solve the MNIST-180 and MNIST-M toy datasets, we observed that Partial G-CNNs perform consistently better on the visual benchmarks considered (Tab. 4).
This indicates that learning layer-wise partial equivariances is beneficial over modifying the level of equivariance only at the end of the model.
In addition, it is important to highlight that Partial G-CNNs can become fully-, partial-, and non-equivariant during training.
Alternative models, on the other hand, are either unable to become fully equivariant ( T ( 2 ) models) or very unlikely to do so in practice ( MLP models).
SIRENs as group convolution kernels.
Next, we validate SIRENs as parameterization for group convolutional kernels.
Tab.
7 shows that SE ( 2 ) -CNNs with SIREN kernels outperform SE ( 2 ) -CNNs with ReLU , LeakyReLU and Swish kernels by a large margin on all datasets considered.
This result suggests that SIRENs are indeed better suited to represent continuous group convolutional kernels.
5.1 Experiments with deeper networks
In addition to the simple networks of the previous experiments, we also explore partial equivariance in a group equivariant version of the 13-layer CNN of Laine and Aila [29].
Specifically, we construct partial group equivariant 13-layer CNNs using SE ( 2 ) as base group, and vary the number of elements used in the Monte Carlo approximation of the group convolution.
For each number of elements,
[Table]
we compare Partial 13-layer G-CNNs to their fully equivariant counterparts as well as equivalent 13-layer CNNs trained with Augerino.
Our results are summarized in Tab. 5.
On partial equivariant settings (CIFAR10 and CIFAR100), partial equivariant networks consistently outperform fully equivariant and Augerino networks for all number of elements used.
Interestingly, translation equivariant CNNs outperform CNNs equivariant to SE ( 2 ) on CIFAR10 and CIFAR100.
This illustrates that overly restricting equivariance constraints can degrade accuracy.
In addition, partial equivariant CNNs retain the accuracy of full equivariant networks in fully equivariant settings.
By looking at the group subsets learned by partial equivariant networks (Fig 6), we corroborate that partial equivariant networks learn to preserve full equivariance if full equivariance is advantageous, and learn to disrupt it otherwise.
Discussion
Memory consumption in partial equivariant settings.
G-CNNs fix the number of samples used to approximate the group convolution prior to training.
In Partial G-CNNs we fix a maximum number of samples and adjust the number used at every layer based on the group subset learned.
Consequently, a partial group convolution with a learned distribution p ( u )=
U ( π 2 [− 1 , 1 ]) uses half of the elements used in a corresponding group convolution.
This reduction in memory and execution time leads to improvements in training and inference time for Partial G-CNNs on partial equivariant settings.
We observe reductions up to 2.5 × in execution time and memory usage on CIFAR-10 and CIFAR-100.
Sampling per batch element.
In our experiments, we sample once from the learned distribution p ( u ) at every layer, and use this sample for all elements in the batch.
A better estimation of p ( u ) can be obtained by drawing a sample per batch element.
Though this method may lead to faster convergence and better estimations of the learned distributions, it comes at a prohibitive memory cost resulting from independent convolutional kernels that must be rendered for each batch element.
Consequently, we use a single sample per batch at each layer in our experiments.
Better kernels with implicit neural representations.
We replace LeakyReLU , ReLU and Swish kernels used so far for continuous group convolution kernels with a SIREN [41].
Our results show that SIRENs are better at modelling group convolutional kernels than existing alternatives.
Going from a small group subset to a larger one.
What does it mean and why is it advantageous?
In Sec.
3.3 we described that a partial group convolution can go from a group subset S ( 1 ) to a larger group subset S ( 2 ) , e.g., the whole group G .
Nevertheless, once a layer becomes partially equivariant, subsequent layers cannot become fully equivariant even for S ( 2 ) =
G .
Interestingly, we observe that
Partial G-CNNs often learn to disrupt equivariance halfway in the network, and return to the whole group afterwards (Fig. 5).
As explained below, this behavior is actually advantageous.
Full equivariance restricts group convolutions to apply the same mapping on the entire group.
As a result, once the input is transformed, the output remains equal up to the same group transformations.
In partial equivariance settings, Partial G-CNNs can output different feature representations for different input transformations.
Consequently, Partial G-CNNs can use the group dimension to encode different feature mappings.
Specifically, some kernel values are used for some input transformations and other ones are used for other input transformations.
This means that when Partial G-CNNs go back to a larger group subset from a smaller one, they are able to use the group axis to encode transformation-dependent features, which in turn results in increased model expressivity.
[Table]
In Appx.
F, we evaluate the effect of enforcing monotonically decreasing group subsets as a function of depth.
That is, Partial G-CNNs whose subsets at deeper layers are equal or smaller than those at previous ones.
Our results show that this monotonicity leads to slightly worse results compared to the unconstrained case, thus supporting the use of unconstrained learning of group subsets.
Limitations and future work
Partial equivariances for other group representations.
The theory of learnable partial equivariances proposed here is only applicable to architectures using regular group representations, e.g., [7, 37].
Nevertheless, other type of representations exist with which exact equivariance to continuous groups can be obtained: irreducible representations [50, 48, 46].
We consider extending the learning of partial equivariances to irreducible representations a valuable extension of our work.
Unstable training on discrete groups.
Although we can model partial equivariance on discrete groups with our proposed discrete probability distribution parameterization, we observed that these distributions can be unstable to train.
To cope with this, we utilize a 10x lower learning rate for the parameters of the probability distributions (See Appx.
E.3 for details).
Nevertheless, finding good ways of learning discrete distributions is an active field of research [21, 22], and advances in this field could be used to further improve the learning of partial equivariances on discrete groups.
Scaling partial equivariance to large groups.
Arguably the main limitation of G-CNNs with regular representations is their computational and memory complexity, which prevents the use of very large groups, e.g., simultaneous rotation, scaling, mirroring and translations.
Partial equivariance is particularly promising for large groups as the network is initialized with a prior towards being equivariant to the entire group, but is able to focus on those relevant to the task at hand.
We consider learning partial equivariances on large groups an interesting direction for further research which orthogonal to other advances to scale group convolutions to large groups, e.g., via separable group convolutional kernels [32, 27].
Acknowledgments and Disclosure of Funding
David W. Romero and Suhas Lohit were supported by Mitsubishi Electric Research Laboratories.
David W. Romero is also financed as part of the Efficient Deep Learning (EDL) programme (grant number P16-25), partly funded by the Dutch Research Council (NWO).
This work was partially carried out on the Dutch national infrastructure with the support of SURF Cooperative.
Checklist
For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?
[Yes] (b) Did you describe the limitations of your work?
[Yes] (c) Did you discuss any potential negative societal impacts of your work?
[Yes] (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?
[Yes] 2.
If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?
[Yes] (b) Did you include complete proofs of all theoretical results?
[Yes]
If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?
[No] (b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?
[Yes] (c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?
[No] (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?
[Yes] 4.
If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?
[Yes] (b) Did you mention the license of the assets?
[Yes] (c) Did you include any new assets either in the supplemental material or as a URL?
[No] (d) Did you discuss whether
and how consent was obtained from people whose data you’re using/curating?
[N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content?
[N/A] 5.
If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?
[N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?
[N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?
[N/A]
Supplementary Material
Learning Partial
Equivariances from Data A Groups
subgroups
, group actions and
other group
theoretical concepts
Groups.
Group theory is the mathematical language that describes symmetries.
The core mathematical object is that of a group , and defines what it means for something to exhibit symmetries.
Specifically, a group is a tuple ( G , ⋅) consisting of a set of transformations G , and a binary operation ⋅ , that exhibit the following properties: (i) closure, i.e., g 1 × g 2 = g 3 ∈ G , ∀ g 1 ,g 2 ∈ G (ii) associativity, i.e., g 1 ⋅ ( g 2 ⋅ g 3 )=(
g 1 ⋅ g 2 )
⋅ g 3 for all g 1 ,g 2 ,g 3 ∈ G , (iii) the existence of an identity element e ∈ G , such that g ⋅ e = e ⋅ g = g , and (iv) the existence of an inverse g − 1 ∈ G for all g ∈ G .
Subgroups.
Given a group ( G , ⋅) , we say that a subset H of the group G , is a subgroup of G if this subset also complies to the group axioms under the binary operation ⋅ .
For instance, the set of rotations by 90 ○ , H ={ 0 ○ , 90 ○ , 180 ○ , 270 ○ } , is a subgroup of the rotation group SO ( 2 ) , because it also complies to the closure, associativity, identity and inverse group axioms.
Group action.
One can define the action of the group G on a set X .
This action describes how group elements g ∈ G modify the set X when the transformation is applied.
For instance, the action of elements in the group of planar rotations θ ∈ SO(2) on an image x ∈ X –written θx –, depicts how the image x changes when the rotation θ is applied.
Lie groups.
A group whose elements form a smooth manifold is referred to as a Lie group .
Since G is not necessarily a vector space, we cannot add or subtract group elements –the only operation defined on the group is the binary operation ⋅ –.
However, if the group is a Lie group, one can link the group
G to a vector space –tangent space at the identity T e ( G ) –, called the Lie algebra .
Consequently, one can readily expand group elements on the Lie algebra using a basis A =
∑ k a k e k and use these components for calculations.
As neural networks work on vector spaces –by means of sums and products–, it is desirable to define convolutional kernels on the Lie algebra as ψ = MLP ∶ g
→ R N in × N out , where N in and N out depict the input and output channels of a convolutional kernel, respectively [16].
Relevant groups for computer vision applications.
In this work, we consider computer vision applications and thus, are mainly interested in groups that have direct effect on these applications.
These groups compose the translation group T ( 2 ) , the rotation group SO ( 2 ) , the group of rotations and reflections O ( 2 ) and combinations thereof.
The actions of these groups can intuitively be understood as the translation, the rotation, and the rotation and reflection of 2D functions, respectively.
These groups can be combined by means of the semi-direct product (⋊) to construct groups that represent combined symmetries.
For instance, the 2D roto-translation group SE ( 2 )=
T ( 2 ) ⋊
SO ( 2 ) encompasses symmetries described by both translations and rotations on 2D.
Similarly, we can construct a group that describes 2D symmetries given by rotations, translations and reflections
E ( 2 )=
T ( 2 )⋊
O ( 2 ) .
6 Considering equivariance to these groups allows us to construct neural networks that respect the combined symmetries described by them.
B Formal treatment of equivariance in partial group convolutions B.1 Partial group convolutions from the group G to a subset S
The partial group convolution from signals on G to signals on a subset S can be interpreted as a group convolution for which the output signal outside of S is set to zero.
Consequently, we can calculate the equivariance difference ∆ equiv in the feature representation, by calculating the difference on the subset S of a group convolution with a group-transformed input ( L w f ∗ ψ ) and a group convolution with a canonical input proceeded by the same transformation on S , i.e., L w ( f ∗ ψ ) .
The equivariance difference ∆ outequiv resulting from the effect of considering a subset S in the output domain of the operation is given by:
The names SO ( 2 ) , O ( 2 ) are derived from their formal names: Special Orthogonal and Orthogonal group.
The names SE ( 2 ) , E ( 2 ) are derived from their formal names: Special Euclidean and Euclidean group.
[Equation]
[Equation]
From the first line to the second we take advantage of the equivariance property of the group convolution: ( L w f ∗ ψ )( u )=
L w ( f ∗ ψ )( u ) , and account for the fact that only the region within
S is visible at the output.
We use the change of variables u
= w − 1 u from the second to third line, and specify the boundaries of S , ( s max ,s min ) from the third to the fourth line.
In the fifth line we separate the integration over S as a sum of two integrals which depict the same range.
In the last line, we cancel out the overlapping parts of the two integrals to come to the final result.
In conclusion, the equivariance difference induced by a subset S ( 2 ) on the domain of the output ∆ outequiv is given by the difference between the part of the representation that leaves the subset S , and the part that comes to replace it instead.
This behaviour is illustrated in Figure 1.
B.2 Partial group convolutions from a subset S ( 1 ) to a subset S ( 2 )
To isolate the effect of having a group subset as domain of the input signal f , we first consider the domain of the output to be the group, i.e., S ( 2 )
=
G .
The equivariance difference in this case is given by the difference across the entire output representation of the group convolution calculated on an input subset S ( 1 ) with a canonical input f , and with a group transformed input L w f .
The equivariance difference ∆ inequiv resulting from the effect of considering a subset S ( 1 ) in the input domain of the operation is given by:
[Equation] [Equation]
[Equation]
In other words, the equivariance difference induced by a subset S ( 1 ) on the domain of the input ∆ inequiv is given by the difference in S ( 1 ) between the input f , and the part that comes to replace it when the input is modified by a group transformation w .
This behavior is illustrated in Figure 2.
C Equivariance property of Monte-Carlo approximations
Consider the Monte-Carlo approximation shown in the main paper:
[Equation]
For a transformed version of the L w f , we can show that the Monte-Carlo approximation of the group convolution is equivariant in expectation.
The proof follows the same steps than Finzi et al.
[16] except that the last step of the proof follows a different reason resulting from the fact that input and output elements can be sampled from different probability distributions.
For a transformed version of the L w f , we have that:
[Equation]
From the first to the second line, we use the change of variables ˜ v j = wv j and the fact that, group elements in the input domain are sampled from the Haar measure for which it holds that ¯ µ G ( v j )=
¯ µ G ( ˜ v j ) .
However, from the second to the third line, we must also assume that this holds for the output domain .
That is, that the probability of drawing w − 1 u j is equal to that of drawing u j .
We emphasize that this is of particular importance in the partial equivariance setting as this might not be the case in general.
D Algorithm for Monte-Carlo approximation of the partial group convolution
Algorithm 1: The Partial Group Convolution Layer
Inputs: position, function-value tuples on the group or a subset thereof { v j ,f ( v j )} .
Outputs: convolved position, function-value tuples on the output group subset { u i , ( f ˆ ∗ ψ )( u i )} .
{ u i } ∼ p ( u ) ; /*
Sample elements from p(u) u i ∈ { u i } h ( u i )
=
∑ j ψ ( v − 1 j u i ) f ( v j ) ¯ µ G ( v j ) ; /
* Compute group convolution (Eq. 4)
Return: { u i ,h ( u i )}
E Experimental details E.1 Dataset description
Dataset availability and licensing.
We note that all the datasets used in this paper are publicly available.
MNIST is available online under Creative Commons Attribution-Share Alike 3.0 license.
CIFAR-10 and CIFAR-100 are available online under MIT license.
PatchCamelyon is available online under MIT license.
Rotated MNIST.
The rotated MNIST dataset [30] contains 62,000 gray-scale 28x28 handwritten digits extracted from the MNIST dataset [31] uniformly rotated on the circle.
The dataset is split into training, validation and test sets of 10,000, 2,000, and 50,000 images, respectively.
CIFAR-10 and CIFAR-100.
The CIFAR-10 dataset [28] consists of 60,000 real-world 32x32 RGB images uniformly drawn from 10 classes divided into training and test sets of 50,000 and 10, samples respectively.
The CIFAR100 dataset [28] is similar to the CIFAR0 dataset, with the difference that images are uniformly drawn from 100 different classes.
For validation purposes, we divide the training dataset of the CIFAR-10 and CIFAR-100 datasets into training and validation sets of 45, and 5,000 samples, respectively.
PatchCamelyon.
The PatchCamelyon dataset [45] consists of 327,000 RGB image patches of tumorous and non-tumorous braset tissues extracted from the Camelyon16 dataset [2], where each patch was labelled as tumorous if the central region of 32x32 pixels contained at least one tomorous pixel as givel by the original annotation in Bejnordi et al.
The dataset is divided into train, validation and test sets of 262,144, 32,768 and 32,768 images, respectively.
E.2 General remarks
Hardware.
Our code is written in PyTorch .
Our experiments were performed on NVIDIA TITAN
RTX and V100 GPUs, depending on their availability and the size of the datasets.
Network specifications.
For almost all the experiments in this paper –except those using the 13layer CNN of Laine and Aila [29]–, we use the architecture shown in Fig.
3 with an initial lifting convolutional layer followed by 2 ResBlocks with full, partial or regular convolutional layers for
Regular G-CNNs, Partial G-CNNs and conventional ( T ( 2 ) )
CNNs.
All datasets use a network with 32 feature maps in the hidden layers, Batch Normalization and ReLU.
For MNIST6-M and MNIST6-180, max-pooling is performed after each of the Residual Blocks.
In the case of rotMNIST, max-pooling is performed after the lifting convolutional layer and the first
[Table]
group convolutional layer.
For CIFAR-10 and CIFAR-100, we use max-pooling after each of the residual blocks.
Finally, for PatchCamelyon, we apply max-pooling after the lifting convolution as well as both residual blocks.
At the end of the network, a global max-pooling layer is used to create invariant features used for classification.
These networks have approximately 460 K parameters.
The continuous group convolutional kernels.
The convolutional kernels of Partial G-CNNs are parameterized as 3-layer SIRENs with 32 hidden units.
For the experiments in the main text, we use ω 0 = 10 . 0 .
We compare these to other conventional nonlinearities in Appx.
F (Tab. 7).
In the case of (partial) group equivariant 13-layer CNNs, the convolutional kernels are constructed as a 3-layer
SIREN with 8 hidden units.
E.3 Hyperparameters and training details
To facilitate replicating our experiments, we provide the list of commands used for our experiments in github.com/merlresearch/partial-gcnn/EXPERIMENTS.md
Optimization and learning rate schedulers.
Networks on MNIST6-180, MNIST6-M, rotMNIST,
CIFAR-10 and CIFAR-100 are trained for 300 epochs and networks on PatchCamelyon are trained for 30 epochs.
Furthermore, we utilize a cosine annealing scheduler and combine it with a linear learning rate warm-up for 5 epochs.
Learning schedulers for the probability distributions p ( u ) .
In order to improve the stability of learning the probability distributions on the groups, we utilize a learning rate scheduler similar to that of the main network, i.e., learning rate warm-up for 5 epochs followed by a cosine annealing scheduler, but with a lower base learning rate.
Specifically, we use a base learning rate for all probability distributions p ( u ) of 1 e − 4 .
Hyperparameters.
We note that all hyperparameters were chosen based on the best performance of the fully equivariant G-CNNs on the validation datasets.
The found hyperparameters are subsequently used for the training of our Partial G-CNNs.
We use a batch size of 64 for all networks.
In the case of CIFAR-10, CIFAR-100 and PatchCamelyon datasets, we also use a weight decay of 1 e − 4 .
13-layer CNNs.
Additionally, in the case of 13-layer CNNs we use a dropout rate of 0.3 and train for 200 epochs with batches of size 128.
These settings are used on rotMNIST, CIFAR10 and CIFAR100.
F Additional Experiments
Classification results on PatchCamelyon.
Table 6 shows the results obtained for G-CNNs and
Partial G-CNNs on the PatchCamelyon dataset [45].
Partial G-CNNs match the performance of
G-CNNs in this full equivariant setting.
Similar to the rotMNIST case (Fig. 5), the learned probability distributions over the group elements for PatchCamelyon are consistent with Regular G-CNNs.
Convolution kernels as implicit neural representations.
Next, we validate that SIRENs are better suited to parameterize group convolutional kernels than other alternatives.
Tab.
7 shows that SE ( 2 ) -
CNNs with SIREN kernels consistently outperform SE ( 2 ) -CNNs with other parameterizations by a large margin on all the image benchmarks considered.
SIREN kernels consistently lead to better accuracy than other existing kernel parameterizations.
[Table]
[Table]
Enforcing monotonic decreasing group subsets over depth.
Once a Partial G-CNN becomes partial equivariant at some depth
[Table]
the network is, in general, unable to become fully equivariant at subsequent layers.
7 As a consequence, using fully equivariant layers after a partially equivariant layer does not restore full equivariance.
Based on this observation
[Table]
one could argue that it is beneficial to impose a monotonically decreasing size to the learned group subsets in order to prevent the at first sight meaningless situation in which the network goes back to larger group subsets.
This can be encouraged with an additional monotonic equivariance loss term in the training loss, which penalizes bigger subsets at subsequent layers:
[Equation]
Here, γ l represents the limit of the subset learned at the l -th layer.
Interestingly, we find that due to the reasons explained in Sec.
6 imposing a monotonic decrease on the learned subsets leads to slightly worse performance than an unconstrained model (see Tabs.
G Broader social impact
This work is fundamental and mathematical in nature.
We believe it does not pose any immediate harm to society.
However, the exact applications of these ideas could have negative impact and thus, care should be taken when using these ideas in machine learning.
One motivation of this paper is to make deep networks more robust to nuisance factors and can hopefully be safer than earlier works.