N EURAL E PDO S : S PATIALLY A DAPTIVE E QUIVARIANT P ARTIAL D IFFERENTIAL O PERATOR B ASED N ETWORKS
Anonymous authors
Paper under double-blind review
A BSTRACT
Endowing deep learning models with symmetry priors can lead to a considerable performance improvement.
As an interesting bridge between physics and deep learning, the equivariant partial differential operators (PDOs) have drawn much researchers’ attention recently.
However, to ensure the PDOs translation equivariance, previous works have to require coefficient matrices to be constant and spatially shared for their linearity, which could lead to the sub-optimal feature learning at each position.
In this work, we propose a novel nonlinear PDOs scheme that is both spatially adaptive and translation equivariant.
The coefficient matrices are obtained by local features through a generator rather than spatially shared.
Besides, we establish a new theory on incorporating more equivariance like rotations for such PDOs.
Based on our theoretical results, we efficiently implement the generator with an equivariant multilayer perceptron (EMLP).
As such equivariant PDOs are generated by neural networks, we call them Neural ePDOs.
In experiments, we show that our method can significantly improve previous works with smaller model size in various datasets.
Especially, we achieve the state-ofthe-art performance on the MNIST-rot dataset with only tenth of parameters of the previous best model.
I NTRODUCTION
In recent years, convolutional neural networks (CNNs) have achieved superior performance on various vision tasks (Krizhevsky et al., 2012; Szegedy et al., 2015;
He et al., 2016; Chen et al., 2017).
It is acknowledged that the success of CNNs is attributed to their ability to exploit the intrinsic translation-invariance symmetry of data to help downstream vision tasks.
To incorporate other symmetries like rotation-invariance, various CNNs-based equivariant networks have been studied and carried out to enhance the performance of vision tasks Cohen & Welling (2016a;b); Weiler & Cesa (2019).
In another branch, some works (Osher & Rudin, 1990; Perona & Malik, 1990) adopted partial differential operators (PDOs) to process images in the early period.
Recently, PDOs with learnable coefficients are adopted by Shen et al.
to design equivariant networks which achieve competitive performance compared to previous equivariant networks.
Jenner & Weiler (2021) further generalized this work to a unified framework on the equivariant linear PDOs on Euclidean spaces of various representation types.
Actually, the coefficient matrices of the current PDOs works are spatially shared, e.g. the same
PDOs are applied to process features at each position (see Figure.1(a)).
However, such coefficients sharing scheme of the PDOs is not the optimal pattern to extract features from input images (Wu et al., 2018;
Su et al., 2019;
Zhou et al., 2021).
To be specific, the contents of the input images vary according to positions, e.g. some pixels cover the background while some express texture, which would make coefficient-sharing PDOs inefficient to extract features at each positions.
In fact, Jenner & Weiler (2021) have proved that the linear PDOs layer is translation equivariant if and only if its coefficient matrices are spatially shared, so it seems impossible to ensure both the spatial adaptivity and translation equivariance for PDOs.
In this work, to deal with the above issue, we think outside the box of the linear limitation and propose a brand new nonlinear PDOs that are both spatially adaptive and translation equivariant.
Compared with spatially shared PDOs, we construct a coefficient generator that inputs local features and outputs the coefficient matrices.
Since different positions produce different coefficient matrices, the PDOs are essentially position-specific and can extract individual features according to the local content (see Figure 1(b)).
In addition, the coefficient matrices generated by local features guarantee the translation equivariance for such PDOs naturally.
However, such nonlinear PDOs scheme is not intrinsically equivariant to rotations or reflections.
To incorporate equivariance of these transformations, we establish a theory on the equivariant formulation of this nonlinear PDO scheme under any given symmetry group.
Specifically, the theory reveals that this type of PDO is equivariant if and only if the coefficient generators are exactly equivariant maps of particular transformations .
In practice, we choose a two-layer EMLP (Finzi et al., 2021) as the coefficient generator to satisfy the equivariance condition and provide an efficient implementation scheme.
We name our model Neural ePDOs and evaluate its performance on MNIST-rot and ImageNet datasets.
Extensive experiments show that our model can significantly improve the accuracy with fewer parameters.
Especially, we achieve the state-of-the-art results on MNIST-rot dataset with only tenth of parameters compared to previous best models.
[Figure]
We summarize the main contributions as follows:
• To our knowledge, we are the first one to propose the nonlinear form of PDOs that are both spatially adaptive and translation equivariant.
The coefficient matrices of the novel PDOs are adaptive to local features, which could alleviate the sub-optimal feature learning problem at each position.
• We develop a theory for such nonlinear PDOs which precisely characterize when it is equivariant under any given symmetry group.
The theory reveals that the nonlinear PDOs are equivariant if and only if the coefficient generators are exactly equivariant maps of particular transformations.
• We provide an efficient implementation which adopts a two-layer EMLP as the coefficient generator and could largely save parameters and computations.
• Extensive experiments show that our method can significantly improve the results on MNIST-rot and ImageNet datasets with significantly fewer parameters.
Especially, we achieve state-of-the-art results on the MNIST-rot dataset.
R ELATED W ORKS
So far, there are two mainstream approaches to constructing group equivariant networks.
One is first developed by Cohen & Welling (2016a) which viewes the feature maps as maps defined on a group, and they proposed group convolution operation to process these feature maps equivariantly for image recognition.
The method is further applied to designing equivariant networks for 3D space (Worrall & Brostow, 2018), sphere (Cohen et al., 2018),video tracking (Gupta et al., 2021) and lie groups (Finzi et al., 2020a; Bekkers, 2019), etc.
This approach is further developed to design attentive convolution layer (Romero et al., 2020) and self-attention layer (Romero & Cordonnier, 2020;
Hutchinson et al., 2021).
The other one follows the approach of steerable CNNs (Cohen & Welling, 2016b; Weiler & Cesa, 2019; Weiler et al., 2018; Jenner & Weiler, 2021), which is a generalization of the first approach.
Analogous to physics, the feature map here is viewed as a field, which is transformed according to a specified group representation under the act of transformation.
In comparison, the feature map in the first approach is simply the field with regular representation.
Works (Cohen & Welling, 2016b;
Weiler et al., 2018; Weiler & Cesa, 2019) are devoted to finding out all the equivariant convolution operations as a map between any two fields.
Later works further generalize the approach to design equivariant transformer (Fuchs et al., 2020) and graph network (Brandstetter et al., 2021).
Our work follows the approach.
Recently, some works focus on utilizing PDOs to design equivariant neural networks, as they can build an interesting bridge between physics and deep learning (Jenner & Weiler, 2021).
In addition,
PDOs are very suitable for processing the continuous data (Finzi et al., 2020b) and non-Euclidean structure data.
The work most closely related to ours is Jenner & Weiler (2021) which derives steerable PDOs as a linear map between any two fields in the language of group representation theory.
It is an extension of PDO-eConv (Shen et al., 2020) which employs rotated PDOs to design linear equivariant layers similar to the approach of Cohen & Welling (2016a).
In our work, to alleviate the spatial-agnostic problem in linear PDO-based equivariant layers, we propose a nonlinear PDO scheme and develop an equivariant theory that generalizes the Jenner & Weiler (2021).
A more detailed comparison between our work and steerable PDOs can be found in supplementary.
P RELIMINARY
In this section, we first give prior knowledge of equivariance.
Next, we briefly introduce the PDOs and their transformation properties.
3. E QUIVARIANCE
Equivariance measures how the output of a network layer transforms in a predictable way with respect to the transformation of the input.
In mathematics, a map Ψ is group equivariant if it satisfies:
[Equation]
where H is a transformation group, π ( h ) and π ′ ( h ) are group actions, and f is the input.
In CNNs, f is the feature map which can be seen as a vector-valued function f : R 2 → R n , where R n is the n -dimensional vector space.
If we choose H to be translation group, it is easy to prove that the convolution layer satisfies this requirement.
In the following, we mainly consider feature maps defined on R 2 , and the conclusions can be readily extended to feature maps defined on any dimension.
Following the standard practice of equivariant deep learning, the feature map f is modeled as vector field composed of fiber f ( x ) located at every point x ∈ R 2 .
For transformation group H , we mainly consider affine group of the form H =
( R 2 , +) ⋊
G , for some G ≤ GL (2 , R ) .
Here, H is constructed by the semi-direct product between translation group ( R 2 , +) and a linear invertible transformation group G performed on R 2 , e.g. rotations and mirrorings.
The group action π ( h ) acts on field f as:
[Equation]
where t ∈ R 2 is a translation, g ∈ G is a linear transformation, h :=
( t, g ) ∈ H , and ρ ( g ) is a group representation of g .
Formally, a group representation ρ of the group G is a group homomorphism:
G → R n × n , i.e. , ∀ g 1 , g 2 ∈ G , ρ ( g 1 g 2 ) =
ρ ( g 1 ) ρ ( g 2 ) .
It describes how each fiber transforms under the group action.
When ρ is given, its corresponding feature map is called a ρ -field.
See supplementary material for more introduction to group representations.
3. P ARTIAL D IFFERENTIAL O PERATORS
Partial differential operators (PDOs) are commonly used in physics areas, such as gradient, curl or Laplacian.
They can be seen as kind of maps between smooth functions.
Given a smooth c in - dimensional feature map f = ( f 1 , ..., f c in ) T , the PDO ∂ x acts on f as ∂ x f := ( ∂ x f 1 , ..., ∂ x f c in ) T .
In general, the PDOs can be formalized as the linear combination of various orders of elementary PDO which is denoted as ∂ α :=
∂
α 1 x 1 ∂ α 2 x 2 , α
=
( α 1 , α 2 ) ∈ N 20 .
Here, we adopt the multi-index notation on elementary PDOs as Jenner & Weiler (2021).
For simplicity, we utilize Γ N =
( i, j ) |
i, j ∈ N 0 , 0 ≤ i + j ≤ N } to index elementary PDOs with their order less than N as we have to set a truncation order to implement PDOs in the computer.
For example, the PDOs from
C ∞ ( R 2 , R c in ) to C ∞ ( R 2 , R c out ) with truncation order N = 3 can be formalized as
[Equation]
where W ( i,j ) : R 2 → R c out × c in is the coefficient matrix corresponding to ∂ ( i,j ) .
To study equivariance of PDOs, we give a discription of transformation property of elementary
PDOs.
Here, we assume the input f to be scalar field and take ∂ (2 , 0) as an example.
When input of the PDO go through a affine transformation ( g, t ) , resulting in ˜ f
( x ) :
= f ( g − 1 ( x − t )) .
According to the chain rule, we get:
[Equation]
where g − 1 11 and g − 1 21 are matrix elements of g − 1 and ˜ x := g − 1 ( x − t ) .
In general, for each elementary
PDO:
[Equation]
where ˆ ρ α,β ( g ) denotes the transformation coefficient in front of elementary PDO ∂ β on the right side of the above equation of a given α .
All these transformation coefficients of a given group element g constitute a matrix ˆ ρ ( g ) .
We have the following result:
Lemma 1 ˆ ρ ( g ) defined in Eq.
( 5 ) is a group representation of g on R | Γ N | .
Proof of the lemma can be found in supplementary material.
We also give a procedure in the supplementary material to automatically compute ˆ ρ ( g ) for any given N .
T HE N EURAL E PDO S F RAMEWORK
In this section, we first propose the new scheme of PDOs, in which the coefficient matrices are generated by features.
Then, we propose the general theory that gives a necessary and sufficient condition to ensure equivariance for the operator for any given symmetry.
As coefficient generators will induce heavy parameters and computation costs, we propose to require coefficient matrices to be diagonal and characterize the equivariant space for it.
4. A N ONLINEAR PDO S S CHEME
As introduced in Section 3.2, PDOs as maps from C ∞ ( R 2 , R c in ) to C ∞ ( R 2 , R c out ) are formulated as :
[Equation]
where f ∈ C ∞ ( R 2 , R c in ) , W α : R 2 → R c out × c in .
Jenner & Weiler has proved that the necessary and sufficient condition for Eq.(6) to be translation equivariant is to require the coefficients W α to be spatially shared, that is, ∀ x, x ′ ∈ R 2 , α ∈ Γ N , W α ( x ) =
W α ( x ′ ) .
However, it is not efficient for the spatially shared PDOs to learn diverse patterns in the feature map, which may lead to redundancy of learnable parameters.
To alleviate this problem, we propose a nonlinear PDOs scheme that adjusts PDOs according to features at different positions.
Furthermore, our newly proposed module still keeps translation equivariance as the spatially shared PDOs.
Specifically, we adopt W α as the coefficient generators to generate coefficient matrices from local input features, which can be formulated as:
[Equation]
where W α : R c in → R c out × c in , α ∈ Γ N are coefficient generators with local features as input.
It is easy to check the translation equivariance of Eq.(7).
We could adopt MLP as the structure of the coefficient generators as they are the universal approximator of any continuous function.
Then, the neural network and local input features decide the specific PDOs applied at each position.
4. E QUIVARIANCE T HEORY
Although the nonlinear PDOs formulated in Eq.(7) are equivariant to translation, they are not intrinsically equivariant to common transformations such as rotation or reflection.
We now derive a complete characterization of their equivariant space of such symmetry.
The equivariant requirement on the operators (7), in the sense defined by Eq.(1), can be reduced to the requirement on the coefficient generators W α .
Supposing the input and output of the operator are any ρ -field and ρ ′ -field, respectively, we have,
Proposition 1 The nonlinear PDOs in Eq.(7) are equivariant to affine transformation H if and only if the coefficient generators satisfy the following constraint:
[Equation]
The proof of this proposition can be found in supplementary material.
The proof makes use of the fact that elementary PDOs are independent from each other.
It is remarkable that the above equation constraints for coefficient generators are imposed for each α ∈ Γ N .
To uncover the intrinsic structure of W α , we further concatenate all the coefficient generators side by side as a whole W such that ∀
y ∈ R
c in , W ( y ) =
[ W (0 , 0) ( y ) , ..., W (0 ,N ) ( y )] .
Then, the constraint Eq.(8) reduces to the following form:
Proposition 2 Eq.(8) is equivalent to the following form:
[Equation]
Here, ⊗ is the tensor product of two group representations.
We show the proof at supplementary material.
Applying the vec-operator 1 on Eq.(9), it can be rewritten as:
[Equation]
where vec[ · ] operator flattens the matrix into a vector by concatenating the rows of a matrix one by one.
Eq.(10) reveals that vec[ W ] is an equivariant function with input and output vector transform according to ρ ( g ) and ρ ′ ( g ) ⊗ ˆ ρ ( g − 1 )
⊤ ⊗ ρ ( g − 1 ) ⊤ , respectively.
It is easy to check that ρ ′ ( g ) ⊗ ˆ ρ ( g − 1 )
⊤ ⊗ ρ ( g − 1 ) ⊤ is also a representation of G .
As we adopt coefficient generators as MLP, vec[ W ] is an EMLP and can be efficiently constructed by Finzi et al.
As coefficient matrices in such operator are generated via MLP, it brings much extra computational burden compared to steerable PDOs.
To alleviate the problem, we propose a novel structure for coefficient generators and give its equivariant characterization in the following.
4. E FFICIENT C OEFFICIENT G ENERATORS
In practice, regular representation and quotient representation (see supplementary material) are are mostly adopted for equivariant networks Weiler & Cesa (2019) due to their superior performance.
Therefore, we attempt to propose an efficient coefficient generator for these representation types in this subsection.
In Eq.(7), directly generating the whole coefficient matrix W would make it suffer heavy parameter and computation costs.
To alleviate this issue, we assume that the coefficient matrices in Eq.(7) are diagonal matrices.
Then we can can formulate the operator (7) as:
[Equation]
where w α : R c in → R c in and ◦ is used to denote element-wise product between two vectors.
Here, we have assumed output and input to be of the same field type and, if necessary, we can follow it with a linear projection to transform it into another field.
Such design greatly reduces the computational burden for generating coefficients and also works well in the experiment in Section 7.
According to Proposition 1, the above operator (11) is equivariant if and only if:
[Equation]
We use diag[ · ] to denote converting an n -dimensional vector to an n -dimensional diagonal matrix with the vector as diagnonal.
Because of the diagonal operation, directly using results in Proposition 2 cannot uncover the structure of w α satisfying the above constraint.
By utilizing the special structure of regular representation and quotient representation, we have the following result.
Proposition 3 Suppose the input and output of operator (11) are both ρ ( g ) -field.
If the ρ is a regular or quotient representation of G , the constraint in Eq.(12) is equivalent to:
[Equation]
where ∀ y ∈
R c in , ¯ w ( y ) =
vec([ w (0 , 0) ( y ) , ..., w (0 ,N ) ( y )]) is a large vector concatenated from all generated vectors (see supplementary material for proof).
Similar to the above general case, ¯ w is an equivariant function with input and output vector transform according to ρ ( g ) and ( ρ ( g ) ⊗ ˆ ρ ( g − 1 ) ⊤ ) , respectively.
So far, we have fully characterized the structure of the coefficient generators which ensures operator (11) to be equivariant.
As the coefficient generator is based on an equivariant neural network, we name our model Neural ePDOs.
In the next section, we will show a detailed implementation that is both parameters efficient and computationally efficient.
I MPLEMENTATION OF N EURAL E PDO S
In this section, we will introduce how we implement the Neural ePDOs in practice.
We first describe our efficient design of coefficient generator ¯ w in Proposition 3.
Then, we will discuss the discretization of Neural ePDOs.
5. D ESIGN OF C OEFFICIENT G ENERATOR
As is shown in Proposition 3, coefficient generator ¯ w can be viewed as an equivariant vector-valued function.
In practice, we implement it as an EMLP which can be constructed as Finzi et al.
In this paper, we adopt a two-layer EMLP as ¯ w .
To reduce parameter and computation costs, we choose a bottleneck design here, a relatively small size of hidden layer.
Specifically, ¯ w ( x ) =
W 2 ReLu( W 1 x ) , where W 1 ∈ R c
mid × c in , W 2 ∈ R | Γ N | c in × c mid , c
mid = c in r , where r is the reduction ratio, and ReLu( · ) is a element-wise ReLu activation function (Nair & Hinton, 2010).
Here, we assume ρ = p ρ 0 , in other words, representation ρ can be decomposed into multiple identical representations ρ 0 , which is very common in practice.
Then the output representation of ¯ w ( x ) =
W 2 ReLu( W 1 x ) can be decomposed in a similar way, i.e., ( ρ ⊗ ( ˆ ρ − 1 ) ⊤ ) =
p ( ρ 0 ⊗ ( ˆ ρ − 1 ) ⊤ ) .
We reduce both computations and parameters by requiring the outputs of the p partitions to be the same.
5. D ISCRETIZATION OF PDO S
Our theory for Neural ePDOs is developed in the continuous space.
In practice, in order to process digital images which are defined on two-dimensional grids, we need to discretize our PDOs.
In our paper, we mainly consider the finite difference (FD) method and the Gaussian derivatives method (GA)
(Jenner & Weiler, 2021).
In principle, we only need to consider the discretization of the elementary PDO because the discretization of the whole PDOs can be obtained by a linear combination of them.
FD : Finite difference method is widely used in numerical analysis to approximate PDO by a linear combination of function values on finite grids.
For example, ∂ x f = ( f ( x + 1) − f ( x − 1)) / 2 .
On the regular grids, a PDO can be approximated by a convolution operation (Shen et al., 2020), i.e.,
[Equation]
where u i is a convolution filter.
Corresponding filters for elementary PDOs in P are provided in the supplementary material.
GA :
PDO can also be estimated by taking derivatives of Gaussian function (Jenner & Weiler, 2021), i.e., given grid points x n ∈ R 2 , ∀ α ∈ Γ N ,
[Equation]
15) where G ( x ; σ ) is a Gaussian kernel with standard deviation σ around 0 .
C OMPLEXITY A NALYSIS
In this section, we give a complexity analysis for both steerable PDO and Neural ePDOs.
For simplicity, we assume the feature field to be a regular field (Results for other feature fields are similar).
We especially consider the complexity for Neural ePDOs with full coefficient matrices (denoted as full) and diagonal coefficient matrices (denoted as diag), respectively.
Here, we assume the EMLP of Neural ePDOs (full) to have the same design as Neural ePDOs (diag).
Suppose the representations type of the input feature map and output feature map to be cρ reg .
The width and height of the feature map are h and w , respectively.
n is the number of elements in the group G and k is the discretization kernel size.
Both parameters and flops complexity are listed in Table (1).
We first make a comparison for parameters.
For both the Neural ePDOs (full) and Neural ePDOs (diag), the first term is the number of parameters in the first layer of EMLP (coefficient generator) and the second term is for the second layer.
It is obvious that Neural ePDOs (full) have significantly more parameters than Neural ePDOs (diag)
( O ( c 3 ) vs O ( c 2 ) ).
For comparison of parameters between steerable PDOs and Neural ePDOs (diag), both the first term and second term in Neural ePDOs (diag) are much less than the parameters of steerable PDOs (In our paper, we set N = 4 ), hence Neural ePDOs (diag) is much parameter efficient than steerable PDOs.
For flops, the first two terms in the Neural ePDOs (both full and diag) are used for coefficient generation and the last term is used for the action of PDO.
As the last term in Neural ePDOs (full) is equal to steerable PDO, the latter one surely requires less computational burden.
It is also easy to check all three terms in the Neural ePDOs (diag) are much less than flops of steerable PDOs, hence
Neural ePDOs (diag) is much more computationally efficient than steerable PDOs.
From the comparison above, both the diagonal restriction and EMLP design (bottleneck structure (r) and partition (p) operation) help to make our Neural ePDOs more efficient than steerable PDOs.
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
Neural
[Table]
[Equation]
Neural ePDOs (diag)
[Equation]
E XPERIMENTS
We conduct extensive experiments to evaluate the performance of Neural ePDOs.
The most important baseline is Steerable PDOs (Jenner & Weiler, 2021).
All our experimental results indicate that our method can achieve superior performance than previous equivariant PDOs works with smaller model size.
7. MNIST- ROT
We first test our model on MNIST-rot dataset (Larochelle et al., 2007), which is a standard benchmark to test the equivariant models.
The dataset contains 62 k 28 × 28 randomly rotated gray-scale handwritten digits.
Images in the dataset are split into 12k for training and 50k for testing.
As the images in the MNIST-rot dataset are orientation-unknown, we choose the group as C 16 for our model.
Following the architecture in the Jenner & Weiler (2021) that consists of 6 steerable
[Table]
[Table]
PDOs layers followed by two fully connected layers, we construct our model by replacing the last 5 steerable PDOs layers with our Neural ePDOs layers.
More details about the model, training and hyperparameters analysis can be found in the supplementary material.
Our results can be found in Table 2.
Some of our models use the regular field as intermediate feature fields and others use quotient representations (which are denoted by quotient in Table 2).
Under the setting of using both finite difference and Gaussian derivatives, our model achieves significant improvement over the steerable PDOs based model with only 1/4 parameters.
It is noteworthy that the Gaussian derivatives method tends to achieve a better performance than the finite difference method for both steerable PDOs and our model, which is consistent to experiment results in Jenner & Weiler (2021).
However, the performance of our quotient field model is inferior to the regular field, which is different from the results of steerable PDOs in Jenner & Weiler (2021).
As is shown in Weiler & Cesa (2019), quotient fields can help to reduce redundancy in the regular fields in some cases.
In our models, the redundancy is already less than steerable PDOs, hence, applying quotient fields in our model may hurt performance.
To further demonstrate the potential capacity of our model, we enlarge the model size and employ D 16 regular field in the first five layers and restrict it to C 16 regular field in the last layer (results are denoted as D 16 | 5 C 16 in Table 2).
Our model improves current SOTA model (Weiler & Cesa, 2019) while consuming only 9.8% of parameters.
7. E VALUATION ON N ATURAL I MAGES
In general, the objects in the real-world images are not always in a uniform orientation.
So we believe that the models with rotation symmetry can generalize better on real-world images.
ImageNet (Deng et al., 2009) is a large-scale dataset that consists of 1000 classes with roughly 1000 images per class, which is a common benchmark for image recognition.
It contains 1 . 2 million training images and 50 k validation images.
Following Hou et al.
(2019), we consider two experimental settings which correspond to different data scale.
In the first setting, we conduct the experiments on a subset
[Table]
of ImageNet which randomly select 100 classes,
and denoted it as ImageNet100.
In the other one, we evaluate our model on the whole 1000 classes.
We choose ResNet-26 as the baseline model and construct equivariant PDO-based networks that are equivariant to C 8 group by taking place the convolution layer with C 8 equivariant module.
We adopt regular representation for all the equivariant modules throughout the model.
To make classification results rotation-invariant to the inputs, we add an orientation pooling (Cohen & Welling, 2016a) before global average pooling.
Notice that the 1 × 1 convolutions in ResNet26 are simply replaced with equivariant linear projection layers rather than the PDOs layer.
Other convolution layers are replaced by steerable PDOs or Neural ePDOs which we denote as Res26 Steerable PDOs or Res
Neural ePDOs.
The output dimensions of each layer for the two models are scaled with the same factor to make its learnable parameters in Res26 Steerable PDOs comparable with the baseline.
More detailed training settings can be found in the supplementary material.
Results on ImageNet100 and ImageNet1k are shown in the Table 3 and Table 4 respectively.
In all the settings, our models significantly improve Steerable PDOs based models with fewer parameters ( 8 . 2 M vs 14 .
4 M) and computational costs (flops= 24 .
1 G vs 56 . 6 G ).
For ImageNet100, training with/without data augmentation is adopted.
It is observed that equivariance can help improve the performance of the model and data augmentation can further enhance the performance of the equivariant model, which may be attributed to the approximate equivariance of the equivariant model incurred by discretization.
In addition, we observe that performance improvement of Neural ePDOs over Steerable PDOs under no data augmentation setting is more significant.
We conjecture our
Neural ePDOs can help our model easier adapt to unseen patterns and hence tend to be more data efficient.
It is also noticeable that the Gaussian discretization method still outperforms the finite difference method on the natural images.
C ONCLUSION AND F UTURE W ORKS
In this work, we propose a new nonlinear PDOs scheme that is both spatially adaptive and translation equivariance.
A new equivariant theory is developed for our nonlinear PDOs scheme which gives a general equivariant formulation of it under and given symmetry group.
The theory systematically characterizes the space of coefficient generators of our equivariant nonlinear PDOs for any given equivariance.
Based on this theory, we efficiently implement it by adopting two-layer
EMLP as the coefficient generators and, hence, name our model Neural ePDOs.
Extensive experiments demonstrate our Neural ePDOs can significantly improve performance on MNIST-rot and ImageNet dataset.
Particularly, we achieve new SOTA performance on MNIST-rot dataset with only 9.8% parameters compared to the previous best model.
To reduce the parameters and computational costs of generating coefficients, we have proposed efficient coefficient generators which are designed for features of regular field and quotient field.
Efficient coefficient generators for other representation fields, e.g., irreducible representation field, could be further explored.
It is worth emphasizing that the nonlinearity introduced in our adaptive PDOs has greatly improved their performance compared to linear PDOs even with smaller model sizes.
There is still a large space to explore how to introduce nonlinearity into PDOs more efficiently.
Although, we mainly focus on the two-dimensional plane, our framework can be readily extended to other homogeneous space such as sphere and 3D space.
As our Neural ePDOs can achieve significant improvement on the two dimensional image tasks, it is worth believing applications of
Neural ePDOs in these domain are promising.
Reproducibility Statement
The complete proof of the theorems is provided in supplementary material, and all the experimental details are provided in Section 7 and supplementary material.
Ethics Statement
The research in this paper does NOT involve any human subject, and our dataset is not related to any issue of privacy and can be used publicly.
All authors of this paper follow the ICLR Code of Ethics (https://iclr.cc/public/CodeOfEthics)