Title: SCALING-TRANSLATION-EQUIVARIANT NETWORKS WITH DECOMPOSED CONVOLUTIONAL FILTERS

Abstract: Encoding the scale information explicitly into the representation learned by a convolutional neural network (CNN) is beneficial for many vision tasks especially when dealing with multiscale inputs. We study, in this paper, a scaling-translationequivariant (ST -equivariant) CNN with joint convolutions across the space and the scaling group, which is shown to be both sufficient and necessary to achieve STequivariant representations. To reduce the model complexity and computational burden, we decompose the convolutional filters under two pre-fixed separable bases and truncate the expansion to low-frequency components. A further benefit of the truncated filter expansion is the improved deformation robustness of the equivariant representation. Numerical experiments demonstrate that the proposed scaling-translation-equivariant networks with decomposed convolutional filters (ScDCFNet) achieves significantly improved performance in multiscale image classification and better interpretability than regular CNNs at a reduced model size.

1. INTRODUCTION:

Convolutional neural networks (CNNs) have achieved great success in machine learning problems such as image classification (Krizhevsky et al., 2012) , object detection (Ren et al., 2015) , and semantic segmentation (Long et al., 2015; Ronneberger et al., 2015) . Compared to fully-connected networks, CNNs through spatial weight sharing have the benefit of being translation-equivariant, i.e., translating the input leads to a translated version of the output. This property is crucial for many vision tasks such as image recognition and segmentation. However, regular CNNs are not equivariant to other important group transformations such as rescaling and rotation, and it is beneficial in some applications to also encode such group information explicitly into the network representation.

Several network architectures have been designed to achieve (2D) roto-translation-equivariance (SE(2)-equivariance) (Cheng et al., 2019; Marcos et al., 2017; Weiler et al., 2018b; Worrall et al., 2017; Zhou et al., 2017) , i.e., roughly speaking, if the input is spatially rotated and translated, the output is transformed accordingly. The feature maps of such networks typically include an extra index for the rotation group SO(2). Building on the idea of group convolutions proposed by Cohen & Welling (2016) for discrete symmetry groups, Cheng et al. (2019) and Weiler et al. (2018b) constructed SE(2)-equivariant CNNs by conducting group convolutions jointly across the space and SO(2) using steerable filters (Freeman & Adelson, 1991) . Scaling-translation-equivariant (ST -equivariant) CNNs, on the other hand, have typically been studied in a less general setting in the existing literature (Kanazawa et al., 2014; Marcos et al., 2018; Xu et al., 2014; Ghosh & Gupta, 2019) . In particular, to the best of our knowledge, a joint convolution across the space and the scaling group S has yet been proposed to achieve equivariance in the most general form. This is possibly because of two difficulties one encounters when dealing with the scaling group: First, unlike SO(2), it is an acyclic and unbounded group; second, an extra index in S incurs a significant increase in model parameters and computational burden. Moreover, since the scaling transformation is rarely perfect in practice (due to changing view angle or numerical discretization), one needs to quantify and promote the deformation robustness of the equivariant representation (i.e., is the model still "approximately" equivariant if the scaling transformation is "contaminated" by a nuisance input deformation), which, to the best of our knowledge, has yet been studied in prior works.

The purpose of this paper is to address the aforementioned theoretical and practical issues in the construction of ST -equivariant CNN models. Specifically, our contribution is three-fold:

1. We propose a general ST -equivariant CNN architecture with a joint convolution over R 2 and S, which is proved in Section 4 to be both sufficient and necessary to achieve ST -equivariance. 2. A truncated decomposition of the convolutional filters under a pre-fixed separable basis on the two geometric domains (R 2 and S) is used to reduce the model size and computational cost.

3. We prove the representation stability of the proposed architecture up to equivariant scaling action of the input signal. Our contribution to the family of group-equivariant CNNs is non-trivial; in particular, the scaling group unlike SO(2) is acyclic and non-compact. This poses challenges both in theory and in practice, so that many previous works on group-equivariant CNNs cannot be directly extended. We introduce new algorithm design and mathematical techniques to obtain the first general ST -equivariant CNN in literature with both computational efficiency and proved representation stability.

2. RELATED WORK:

Mixed-scale and ST -equivariant CNNs. Incorporating multiscale information into a CNN representation has been studied in many existing works. The Inception net (Szegedy et al., 2015) and its generalizations (Szegedy et al., 2017; 2016; Li et al., 2019) stack filters of different sizes in a single layer to address the multiscale salient features. Dilated convolutions (Pelt & Sethian, 2018; Wang et al., 2018; Yu & Koltun, 2016; Yu et al., 2017) , pyramid architectures (Ke et al., 2017; Lin et al., 2017) , and multiscale dense networks (Huang et al., 2017) have also been proposed to take into account the multiscale feature information. Although the effectiveness of such models have been empirically demonstrated in various vision tasks, there is still a lack of interpretability of their ability to encode the input scale information. Group-equivariant CNNs, on the other hand, explicitly encode the group information into the network representation. Cohen & Welling (2016) proposed CNNs with group convolutions that are equivariant to several finite discrete symmetry groups. This idea is later generalized in Cohen et al. (2018) and applied mainly to the rotation groups SO(2) and SO(3) (Cheng et al., 2019; Weiler et al., 2018a; b) . Although ST -equivariant CNNs have also been proposed in the literature (Kanazawa et al., 2014; Marcos et al., 2018; Xu et al., 2014; Ghosh & Gupta, 2019) , they are typically studied in a less general setting. In particular, none of these previous works proposed to conduct joint convolutions over R 2 × S as a necessary and sufficient condition to impose equivariance, for which reason they are thus variants of a special case of our proposed architecture where the convolutional filters in S are Dirac delta functions (c.f. Remark 1.) The scale-space semi-group correlation proposed in the concurrent work (Worrall & Welling, 2019) bears the most resemblance to our proposed model, however, their approach is only limited to discrete semigroups, whereas our model does not have such restriction.

Representation stability to input deformations. Input deformations typically induce noticeable variabilities within object classes, some of which are uninformative for the vision tasks. Models that are stable to input deformations are thus favorable in many applications. The scattering transform (Bruna & Mallat, 2013; Mallat, 2010; 2012) computes translation-invariant representations that are Lipschitz continuous to deformations by cascading predefined wavelet transforms and modulus poolings. A joint convolution over R 2 × SO(2) is later adopted in Sifre & Mallat (2013) to build roto-translation scattering with stable rotation/translation-invariant representations. These models, however, use pre-fixed wavelet transforms in the networks, and are thus nonadaptive to the data. DCFNet (Qiu et al., 2018) combines a pre-fixed filter basis and learnable expansion coefficients in a CNN architecture, achieving both data adaptivity and representation stability inherited from the filter regularity. This idea is later extended by Cheng et al. (2019) to produce SE(2)-equivariant representations that are Lipschitz continuous in L 2 norm to input deformations modulo a global rotation, i.e., the model stays approximately equivariant even if the input rotation is imperfect. To the best of our knowledge, a theoretical analysis of the deformation robustness of a ST -equivariant CNN has yet been studied, and a direct generalization of the result in Cheng et al. (2019) is futile because the feature maps of a ST -equivariant CNN is typically not in L 2 (c.f. Remark 2.)

3. ST -EQUIVARIANT CNN AND FILTER DECOMPOSITION:

Group-equivariance is the property of a mapping f : X → Y to commute with the group actions on the domain X and codomain Y . More specifically, let G be a group, and D g , T g , respectively, be group actions on X and

Y . A function f : X → Y is said to be G-equivariant if f (D g x) = T g (f (x)), ∀ g ∈ G, x ∈ X.

(1)

G-invariance is thus a special case of G-equivariance where T g = Id Y . For learning tasks where the feature y ∈ Y is known a priori to change equivariantly to a group action g ∈ G on the input x ∈ X, e.g. image segmentation should be equivariant to translation, it would be beneficial to reduce the hypothesis space to include only G-equivaraint models. In this paper, we consider mainly the scaling-translation group (Kanazawa et al., 2014; Marcos et al., 2018; Xu et al., 2014; Ghosh & Gupta, 2019) are all variants of this architecture. (b) The general case of ST -equivariant CNN with joint convolutions (Theorem 1) where information transfers among different scales. See Remark 1 for more explanation.

ST ∼ = S × R 2 ∼ = R × R 2 . Given g = (β, v) ∈ ST

x (0) (u, λ) (u ∈ R 2 is the spatial position, and λ is the unstructured channel index, e.g. RGB channels of a color image), the scaling-translation group action D g = D β,v on x (0) is defined as

EQUATION

Constructing ST -equivariant CNNs thus amounts to finding an architecture A such that each trained network f ∈ A commutes with the group action D β,v on the input and a similarly defined group action T β,v (to be explained in Section 3.1) on the output.

3.1. ST -EQUIVARIANT CNNS:

Inspired by Cheng et al. (2019) and Weiler et al. (2018b) , we consider ST -equivariant CNNs with an extra index α ∈ S for the the scaling group S ∼ = R: for each l ≥ 1, the l-th layer output is denoted as x (l) (u, α, λ), where u ∈ R 2 is the spatial position, α ∈ S is the scale index, and λ ∈ [M l ] := {1, . . . , M l } corresponds to the unstructured channels. We use the continuous model for formal derivation, i.e., the images and feature maps have continuous spatial and scale indices.

In practice, the images are discretized on a Cartesian grid, and the scales are computed only on a discretized finite interval. Similar to Cheng et al. (2019) , the group action T β,v on the l-th layer output is defined as a scaling-translation in space as well as a shift in the scale channel:

EQUATION

A feedforward neural network is said to be scaling-translation-equivariant, i.e., equivariant to ST , if

EQUATION

where we slightly abuse the notation x (l) [x (0) ] to denote the l-th layer output given the input x (0) . The following Theorem shows that ST -equivariance is achieved if and only if joint convolutions are conducted over S × R 2 as in ( 5) and ( 6). Theorem 1. A feedforward neural network with an extra index α ∈ S for layerwise output is ST -equivariant if and only if the layerwise operations are defined as (5) and (6):

EQUATION

where σ : R → R is a pointwise nonlinear function.

We defer the proof of Theorem 1, as well as those of other theorems, to the appendix. We note that the joint-convolution in Theorem 1 is a generalization of the group convolution proposed by Cohen & Welling (2016) to a non-compact group ST in the continuous setting.

Remark 1. When the (joint) convolutional filter

W (l) λ ,λ (u, α) takes the special form W (l) λ ,λ (u, α) = V (l)

λ ,λ (u)δ(α), the joint convolution (6) over R 2 × S reduces to only a (multiscale) spatial convolution

EQUATION

i.e., the feature maps at different scales do not transfer information among each other (see Figure 1a ). The previous works (Kanazawa et al., 2014; Marcos et al., 2018; Xu et al., 2014; Ghosh & Gupta, 2019) on ST -equivariant CNNs are all based on this special case of Theorem 1.

Although the joint convolutions (6) on R 2 × S provide the most general way of imposing STequivariance, they unfortunately also incur a significant increase in the model size and computational burden. Following the idea of Cheng et al. (2019) and Qiu et al. (2018) , we address this issue by taking a truncated decomposition of the convolutional filters under a pre-fixed separable basis, which will be discussed in detail in the next section.

3.2. SEPARABLE BASIS DECOMPOSITION:

We consider decomposing the convolutional filters W (l)

λ ,λ (u, α) under the product of two function bases, {ψ k (u)} k and {ϕ m (α)} m , which are the eigenfunctions of the Dirichlet Laplacian on, respectively, the unit disk D ⊂ R 2 and [-1, 1], i.e.,

EQUATION

EQUATION

In particular, the spatial basis {ψ k } k satisfying ( 8) is the Fourier-Bessel (FB) basis (Abramowitz & Stegun, 1965) . In the continuous formulation, the spatial "pooling" operation is equivalent to rescaling the convolutional filters in space. We thus assume, without loss of generality, that the convolutional filters are compactly supported as follows

EQUATION

W (l) λ ,λ ∈ C c (2 j l D × [-1, 1]), ∀ l > 1. (9) Let ψ j,k (u) := 2 -2j ψ k (2 -j u), then W (l)

λ ,λ can be decomposed under {ψ j l ,k } k and {ϕ m } m as W

(1)

λ ,λ (u) = k a (1) λ ,λ (k)ψ j1,k (u), W (l) λ ,λ (u, α) = m k a (l) λ ,λ (k, m)ψ j l ,k (u)ϕ m (α), l > 1 (10)

where a

(1) λ ,λ (k) and a (l) λ ,λ (k, m) are the expansion coefficients of the filters. During training, the basis functions are fixed, and only the expansion coefficients are updated. In practice, we truncate the expansion to only low-frequency components (i.e., a

(l) λ ,λ (k, m) are non-zero only for k ∈ [K], m ∈ [K α ]

), which are kept as the trainable parameters. Similar idea has also been considered in the prior works (Qiu et al., 2018; Cheng et al., 2019; Jacobsen et al., 2016) . This directly leads to a reduction of network parameters and computational burden. More specifically, let us compare the l-th convolutional layer (6) of a ST -equivariant CNN with and without truncated basis decomposition: Number of trainable parameters: Suppose the filters W (l) λ ,λ (u, α) are discretized on a Cartesian grid of size L×L×L α . The number of trainable parameters at the l-th layer of a ST -equivariant CNN without basis decomposition is L 2 L α M l-1 M l . On the other hand, in an ScDCFNet with truncated basis expansion up to K leading coefficients for u and K α coefficients for α, the number of parameters is instead KK α M l-1 M l . Hence a reduction to a factor of KK α /L 2 L α in trainable parameters is achieved for ScDCFNet via truncated basis decomposition. In particular, if L = 5, L α = 5, K = 8, and K α = 3, then the number of parameters is reduced to (8 × 3)/(5 2 × 5) = 19.2%.

Computational cost: Suppose the size of the input x (l-1) (u, α, λ) and output x (l) (u, α, λ) at the l-th layer are, respectively, W × W × N α × M l-1 and W × W × N α × M l , where W × W is the spatial dimension, N α is the number of scale channels, and M l-1 (M l ) is the number of the unstructured input (output) channels. Let the filters W (l) λ ,λ (u, α) be discretized on a Cartesian grid of size L × L × L α . The following theorem shows that, compared to a regular ST -equivariant CNN, the computational cost in a forward pass of ScDCFNet is reduced again to a factor of KK α /L 2 L α . Theorem 2. Assume M l L 2 , L α , i.e., the number of the output channels is much larger than the size of the convolutional filters in u and α, then the computational cost of an ScDCFNet is reduced to a factor of KK α /L 2 L α when compared to a ST -equivariant CNN without basis decomposition.

4. REPRESENTATION STABILITY OF SCDCFNET TO INPUT DEFORMATION:

Apart from reducing the model size and computational burden, we demonstrate in this section that truncating the filter decomposition has the further benefit of improving the deformation robustness of the equivariant representation, i.e., the equivaraince relation ( 4) still approximately holds true even if the spatial scaling of the input D β,v x (0) is contaminated by a local deformation. The analysis is motivated by the fact that scaling transformations are rarely perfect in practice -they are typically subject to local distortions such as changing view angle or numerical discretization. To quantify the distance between different feature maps at each layer, we define the norm of x (l) as

x (0) 2 = 1 M 0 M0 λ=1 x (0) (u, λ) 2 du, x (l) 2 = sup α 1 M l M l λ=1 x (l) (u, α, λ) 2 du, l ≥ 1. (11)

Remark 2. The definition of x (l) is different from that of RotDCFNet (Cheng et al., 2019) , where an L 2 norm is taken for the α index as well. The reason why we adopt the L ∞ norm for α in (11) is that x (l) is typically not L 2 in α, since the scaling group S, unlike SO(2), has infinite Haar measure.

We next quantify the representation stability of ScDCFNet under three mild assumptions on the convolutional layers and input deformations. First, (A1) The pointwise nonlinear activation σ : R → R is non-expansive.

Next, we need a bound on the convolutional filters under certain norms. For each l ≥ 1, define

EQUATION

where the Fourier-Bessel (FB) norm a FB of a sequence {a(k)} k≥0 is a weighted l 2 norm defined as a 2 FB := k µ k a(k) 2 , where µ k is the k-th eigenvalue of the Dirichlet Laplacian on the unit disk defined in (8). We next assume that each A l is bounded:

(A2) For all l ≥ 1, A l ≤ 1.

The boundedness of A l is facilitated by truncating the basis decomposition to only low-frequency components (small µ k ), which is one of the key idea of ScDCFNet explained in Section 3.2. After a proper initialization of the trainable coefficients, (A2) can generally be satisfied. The assumption (A2) implies several bounds on the convolutional filters at each layer (c.f. Lemma 2 in the appendix), which, combined with (A1), guarantees that an ScDCFNet is layerwise non-expansive: Proposition 1. Under the assumption (A1) and (A2), an ScDCFNet satisfies the following. (a) For any l ≥ 1, the mapping of the l-th layer, x (l) [•] defined in (5) and (6), is non-expansive, i.e.,

EQUATION

) (b) Let x (l)

0 be the l-th layer output given a zero bottom-layer input, then x (l) 0 (λ) depends only on λ.

(c) Let x (l)

c be the centered version of x (l) after removing x

EQUATION

c (u, λ) := x (0) (u, λ) - x (0) 0 (λ) = x (0) (u, λ), and x (l) c (u, α, λ) := x (l) (u, α, λ) -x (l) 0 (λ), ∀l ≥ 1, then x (l) c ≤ x (l-1) c , ∀l ≥ 1. As a result, x (l) c ≤ x (0) c = x (0) .

Finally, we make an assumption on the input deformation modulo a global scale change. Given a C 2 function τ : R 2 → R 2 , the spatial deformation D τ on the feature maps x (l) is defined as

EQUATION

where ρ(u) = u -τ (u). We assume a small local deformation on the input:

(A3) |∇τ | ∞ := sup u ∇τ (u) < 1/5

, where • is the operator norm.

The following theorem demonstrates the representation stability of an ScDCFNet to input deformation modulo a global scale change. ) ] (l-th layer feature of the original input), 0) ] (rescaled l-th layer feature of the original input), and the difference

EQUATION

(x (l) [D β,v x (0) ] -T β,v x (l) [x (0) ]) displayed in a (signal intensity) scale relative to the maximum value of x (l) [D β,v x (0) ].

It is clear that even after numerical discretization, ST -equivariance still approximately holds for ScDCFNet, i.e., ) ] ≈ 0, but not for a regular CNN.

x (l) [D β,v x (0) ] -T β,v x (l) [x (0

Theorem 3. Let D τ be a small spatial deformation defined in (14), and let D β,v , T β,v be the group actions corresponding to an arbitrary scaling  and (3) .

2 -β ∈ R + centered at v ∈ R 2 defined in (2)

In an ScDCFNet satisfying (A1), (A2), and (A3), we have, for any L,

EQUATION

Theorem 3 gauges how approximately equivariant is ScDCFNet if the input undergoes not only a scale change D β,v but also a nonlinear spatial deformation D τ , which is important both in theory and in practice because the scaling of an object is rarely perfect in reality.

5. NUMERICAL EXPERIMENTS:

In this section, we conduct several numerical experiments for the following three purposes. 1. To verify that ScDCFNet indeed achieves ST -equivariance (4). 2. To illustrate that ScDCFNet significantly outperforms regular CNNs at a much reduced model size in multiscale image classification. 3. To show that a trained ScDCFNet auto-encoder is able to reconstruct rescaled versions of the input by simply applying group actions on the image codes, demonstrating that ScDCFNet indeed explicitly encodes the input scale information into the representation. The experiments are tested on the Scaled MNIST (SMNIST) and Scaled Fashion-MNIST (SFashion) datasets, which are built by rescaling the original MNIST and Fashion-MNIST (Xiao et al., 2017) images by a factor randomly sampled from a uniform distribution on [0.3, 1]. A zero-padding to a size of 28 × 28 is conducted after the rescaling. If mentioned explicitly, for some experiments, the images are resized to 64 × 64 for better visualization. The implementation details of ScDCFNet are explained in Appendix B.1. In particular, we discuss how to discretize the integral (6) and truncate the scale channel to a finite interval for practical implementation. We also explain how to mitigate the boundary "leakage" effect incurred by the truncation. Moreover, modifications to the spatial pooling and batch-normalization modules of ScDCFNet to maintain ST -equivariance are also explained.

5.1. VERIFICATION OF ST -EQUIVARIANCE:

We first verify that ScDCFNet indeed achieves ST -equivariance (4). Specifically, we compare the feature maps of a two-layer ScDCFNet with randomly generated truncated filter expansion coefficients and those of a regular CNN. The exact architectures are detailed in Appendix B.2. Figure 2 displays the first-and second-layer feature maps of an original image x (0) and its rescaled version D β,v x (0) using the two comparing architectures. Feature maps at different layers are rescaled to the same spatial dimension for visualization. The four images enclosed in each of the dashed rectangle correspond to: x (l) [x (0) ] (l-th layer feature of the original input), x (l) [D β,v x (0) ] (l-th layer feature of the rescaled input), T β,v x (l) [x (0) ] (rescaled l-th layer feature of the original input, where T β,v is understood as D β,v for a regular CNN due to the lack of a scale index α), and the difference The error is unavoidable as depth becomes larger, but it can be mitigated by (1) using joint convolutional filters with a smaller support in scale (i.e., a smaller number of "taps" after discretization), and (2) using a replicate-padding instead of zero-padding. See Appendix B.1 for detailed explanation.

x

(l) [D β,v x (0) ] -T β,v x (l) [x (0) ].

It is clear that even with numerical discretization, which can be modeled as a form of input deformation, ScDCFNet is still approximately ST -equivariant, i.e., ) ], whereas a regular CNN does not have such a property.

x (l) [D β,v x (0) ] ≈ T β,v x (l) [x (0

We also examin how the numerical error in equivariance (incurred by the the boundary "leakage" effect after the scale channel truncation) evolves as the network gets deeper. The error in equivariance is measured in a relative L 2 sense at a particular scale α, i.e.,

EQUATION

)

It is clear from Figure 3 that the boundary "leakage" effect is unavoidable as the network becomes deeper. However, the error can be alleviated by either choosing joint convolutional filters with a smaller support in scale (i.e., the filter size, or the number of "taps", after discretization in scale is much smaller compared to the number of scale channels in the feature map), or using a replicatepadding in the scale channel for the joint convolution. See Appendix B.1 for detailed explanation.

5.2. MULTISCALE IMAGE CLASSIFICATION:

We next demonstrate the improved performance of ScDCFNet in multiscale image classification. The experiments are conducted on SMNIST and SFashion, and a regular CNN is used as a performance benchmark. Both networks are comprised of three convolutional layers with the exact architectures (Table 2 ) detailed in Appendix B.3. Since the scaling group S ∼ = R is unbounded, we compute only the feature maps x (l) (u, α, λ) with the α index restricted to the truncated scale interval [-1.6, 0] (2 -1.6 ≈ 0.3), which is discretized uniformly into N α = 9 channels (again, see Appendix B.1 for implementation details.) The performance of the comparing architectures with and without batch-normalization is shown in Table 1 . It is clear that, by limiting the hypothesis space to STequivaraint models and taking truncated basis decomposition to reduce the model size, ScDCFNet achieves a significant improvement in classification accuracy with a reduced number of trainable parameters. The advantage of ScDCFNet is more pronounced when the number of training samples is small (N tr = 2000), suggesting that, by hardwiring the input scale information directly into its representation, ScDCFNet is less susceptible to overfitting the limited multiscale training data.

We also observe that even when a regular CNN is trained with data augmentation (random cropping and rescaling), its performance is still inferior to that of an ScDCFNet without manipulation of the training data. In particular, although the accuracies of the regular CNNs trained on 2000 SMNIST and SFashion images after data augmentation are improved to, respectively, 93.85% and 79.41%, they still underperform the ScDCFNets without data augmentation (93.91% and 79.94%) using only a fraction of trainable parameters. Moreover, if ScDCFNet is trained with data augmentation, the accuracies can be further improved to 94.30% and 80.62% respectively. This suggests that ScDCFNet can be combined with data augmentation for optimal performance in multiscale image classification. The architectures are detailed in Table 2 . In particular, M stands for the number of the first-layer (unstructured) output channels, which is doubled after each layer, and K/Kα is the number of basis function in u/α used for filter decomposition. The networks are tested with different training data size, Ntr = 2000, 5000, and 10000, and the means and standard deviations after three independent trials are reported. The column "ratio" stands for the ratio between the number of trainable parameters of the current architecture and that of the baseline CNN. The results of the Locally Scale-Invariant CNN (SI-CNN) (Kanazawa et al., 2014) and Vector Field Scale-Equivariant CNN (VF-SECNN) (Marcos et al., 2018) reported in (Marcos et al., 2018 ) are displayed at the bottom of the table for comparison.

Input:

ScDCFNet auto-encoder CNN auto-encoder 

5.3. IMAGE RECONSTRUCTION:

In the last experiment, we illustrate the ability of ScDCFNet to explicitly encode the input scale information into the representation. To achieve this, we train an ScDCFNet auto-encoder on the SMNIST dataset with images resized to 64 × 64 for better visualization. The encoder stacks two STequivaraint convolutional blocks with 2 × 2 average-pooling, and the decoder contains a succession of two transposed convolutional blocks with 2 × 2 upsampling. A regular CNN auto-encoder is also trained for comparison (see Table 3 in Appendix B.4 for the detailed architecture.)

Our goal is to demonstrate that the image code produced by the ScDCFNet auto-encoder contains the scale information of the input, i.e., by applying the group action T β,v (3) to the code C of a test image before feeding it to the decoder, we can reconstruct rescaled versions of original input. This property can be visually verified in Figure 4 . In contrast, a regular CNN auto-encoder fails to do so.

6. CONCLUSION:

We propose, in this paper, a ST -equivaraint CNN with joint convolutions across the space R 2 and the scaling group S, which we show to be both sufficient and necessary to impose ST -equivariant network representation. To reduce the computational cost and model complexity incurred by the joint convolutions, the convolutional filters supported on R 2 × S are decomposed under a separable basis across the two domains and truncated to only low-frequency components. Moreover, the truncated filter expansion leads also to improved deformation robustness of the equivaraint representation, i.e., the model is still approximately equivariant even if the scaling transformation is imperfect. Experimental results suggest that ScDCFNet achieves improved performance in multiscale image classification with greater interpretability and reduced model size compared to regular CNN models.

For future work, we will study the application of ScDCFNet in other more complicated vision tasks, such as object detection/localization and pose estimation, where it is beneficial to directly encode the input scale information into the deep representation. Moreover, the memory usage of our current implementation of ScDCFNet scales linearly to the number of the truncated basis functions in order to realize the reduced computational burden explained in Theorem 2. We will explore other efficient implementation of the model, e.g., using filter-bank type of techniques to compute convolutions with multiscale spatial filters, to significantly reduce both the computational cost and memory usage. 

A PROOFS:

A.1 PROOF OF THEOREM 1

Proof of Theorem 1. We note first that (4) holds true if and only if the following being valid for all l ≥ 1,

EQUATION

where T β,v x (0) is understood as D β,v x (0) . We also note that the layer-wise operations of a general feedforward neural network with an extra index α ∈ S can be written as

EQUATION

and, for l > 1,

EQUATION

)

To prove the sufficient part: when l = 1, (2), (3), and (5) lead to

EQUATION

and

x (1) [D β,v x (0) ](u, α, λ) =σ λ R 2 D β,v x (0) (u + u , λ )W (1) λ ,λ 2 -α u 2 -2α du + b (1) (λ) =σ λ R 2 x (0) (2 -β (u + u -v), λ ) W (1) λ ,λ 2 -α u 2 -2α du + b (1) (λ) . (21) Hence T β,v x (1) [x (0) ] = x (1) [D β,v x (0) ].

When l > 1, we have

EQUATION

and

EQUATION

Therefore T β,v x (l) [x (l-1) ] = x (l) [T β,v x (l-1) ], ∀l > 1.

To prove the necessary part: when l = 1, we have

EQUATION

and

EQUATION

Hence for (17) to hold when l = 1, we need α, λ, u , λ , v, β. (26) Keeping u, α, λ, u , λ , β fixed while changing v in (26), we obtain that W (1) (u , λ , u, α, λ) does not depend on the third variable u. Thus W (1) (u , λ , u, α, λ) = W (1) (u , λ , 0, α, λ) , ∀u. Define W

W (1) (u , λ , u, α, λ) = W (1) 2 -β u , λ , 2 -β (u -v), α -β, λ 2 -2β , ∀ u,

(1) λ,λ (u ) as

EQUATION

)

Then, for any given u , λ , u, α, λ, setting β = α in (26) leads to

W (1) (u , λ , u, α, λ) = W (1) 2 -α u , λ , 2 -α (u -v), 0, λ 2 -2α =W (1) 2 -α u , λ , 0, 0, λ 2 -2α = W (1) λ ,λ 2 -α u 2 -2α .

(28) Hence ( 18) can be written as (5).

For l > 1, a similar argument leads to ∀u, α, λ, u , α , λ , v, β. (29) Again, keeping u, α, λ, u , α , λ , β fixed while changing v in (29) leads us to the conclusion that W (l) (u , α , λ , u, α, λ) does not depend on the fourth variable u. Define

W (l) (u , α , λ , u, α, λ) = W (l) 2 -β u , α , λ , 2 -β (u -v), α -β, λ 2 -2β ,

W (l) λ ,λ (u , α ) := W (l) (u , α , λ , 0, 0, λ) .

(30) After setting β = α in ( 29), for any given u , α , λ , u, α, λ, we have

W (l) (u , α , λ , u, α, λ) = W (l) 2 -α u , α , λ , 2 -α (u -v), 0, λ 2 -2α =W (l) 2 -α u , α , λ , 0, 0, λ 2 -2α = W (l) λ ,λ 2 -α u 2 -2α .

(31) This concludes the proof of the Theorem.

A.2 PROOF OF THEOREM 2:

Proof of Theorem 2. In a regular ST -equivariant CNN, the l-th convolutional layer ( 6) is computed as follows:

EQUATION

EQUATION

EQUATION

)

The spatial convolutions in (32) take 2W 2 L 2 N α L α M l M l-1 flops (there are N α L α M l M l-1 convolutions in u, each taking 2W 2 L 2 flops.) The summation over α in (33) requires L α N α W 2 M l M l-1 flops. The summation over λ , adding the bias, and applying the nonlinear activation in (34) requires an additional W 2 N α M l (2 + M l-1 ) flops. Thus the total number of floating point computations in a forward pass through the l-th layer of a regular ST -equivariant CNN is

EQUATION

)

On the other hand, in an ScDCFNet with separable basis truncation up to KK α leading coefficients, (6) can be computed via the following steps:

EQUATION

)

The convolutions in α (36

) require 2L α N α W 2 K α M l-1 flops (there are W 2 K α M l-1 convolutions in α, each taking 2L α N α flops.) The spatial convolutions in (37) take 2W 2 L 2 N α M l-1 K α K flops (N α M l-1 K α K convolutions in u, each taking 2W 2 L 2 flops.) The last step (38) requires an additional 2W 2 N α M l (1 + KK α M l-1 ) flops.

Hence the total number of floating point computation for an ScDCFNet is

EQUATION

)

In particular, when M l L 2 , L α , the dominating terms in ( 35) and ( 39) are, respectively,

2W 2 N α M l M l-1 L 2 L α and 2W 2 N α M l-1 M l KK α .

Thus the computational cost in an ScDCFNet has been reduced to a factor of KKα L 2 Lα .

A.3 PROOF OF PROPOSITION 1:

Before proving Proposition 1, we need the following two lemmas. Lemma 1. Suppose that {ψ k } k are the FB bases, and

EQUATION

)

This is Lemma 3.5 and Proposition 3.6 in Qiu et al. (2018) after rescaling u. Lemma 1 easily leads to the following lemma.

Lemma 2. Let a 

EQUATION

)

We have

EQUATION

)

where

EQUATION

λ ,λ := |u| ∇ u W (1) λ ,λ (u) du, C (l) λ ,λ,m := |u| ∇ u W (l) λ ,λ,m (u) du, l > 1, D (1) λ ,λ := ∇ u W (1) λ ,λ (u) du, D (l) λ ,λ,m := ∇ u W (l)

λ ,λ,m (u) du, l > 1.

(43)

We thus have

EQUATION

where

EQUATION

and, for l > 1,

EQUATION

In particular, (A2) implies that B l , C l , 2 j l D l ≤ 1, ∀l.

Proof of Proposition 1. To simplify the notation, we omit (l) in W

EQUATION

λ ,λ,m , and b (l) , and let M = M l , M = M l-1 . The proof of (a) for the case l = 1 is similar to Proposition 3.1(a) of Qiu et al. (2018) after noticing the fact that

EQUATION

and we include it here for completeness. From the definition of B 1 in (45), we have

EQUATION

λ ,λ ≤ B 1 , and sup

EQUATION

Thus, given two arbitrary functions x 1 and x 2 , we have

EQUATION

Therefore, for any α,

EQUATION

where the last inequality makes use of the fact that B 1 ≤ A 1 ≤ 1 under (A2) (Lemma 2.) Therefore

EQUATION

This concludes the proof of (a) for the case l = 1. To prove the case for any l > 1, we first recall from ( 46) that

EQUATION

Thus, for two arbitrary functions x 1 and x 2 , we have

EQUATION

where

EQUATION

We claim (to be proved later in Lemma 3) that

EQUATION

Thus, for any α,

EQUATION

Therefore

EQUATION

)

To prove (b), we use the method of induction. When l = 0, x

EQUATION

Part (c) is an easy corollary of part (a). More specifically, for any l > 1,

EQUATION

Lemma 3. Suppose ϕ ∈ L 2 (R) with supp(ϕ m ) ⊂ [-1, 1] and ϕ L 2 = 1, and x is a function of three variables

EQUATION

)

Then we have

EQUATION

)

Proof of Lemma 3. Notice that, for any α, we have

EQUATION

)

Thus

EQUATION

A.4 PROOF OF THEOREM 3

To prove Theorem 3, we need the following two Propositions. Proposition 2. In an ScDCFNet satisfying (A1) and (A3), we have 1. For any l ≥ 1,

EQUATION

)

2. For any l ≥ 1, we have l) , (67) and

T β,v x (l) = 2 β x (

EQUATION

where the first T β,v in (68) is replaced by D β,v when l = 1.

3. If (A2) also holds true, then

EQUATION

)

Proposition 3. In an ScDCFNet satisfying (A1) and (A3), we have, for any l ≥ 1,

EQUATION

)

If (A2) also holds true, then

EQUATION

Proof of Theorem 3. Putting together ( 69) and (71), we have

EQUATION

This concludes the proof of Theorem 3. 

EQUATION

EQUATION

where Jρ is the Jacobian of ρ, and |Jρ| is the Jacobian determinant. As a result,

EQUATION

)

Proof of Proposition 2. Just like Proposition 1(a), the proof of Proposition 2(a) for the case l = 1 is similar to Lemma 3.2 of Qiu et al. (2018) after the change of variable (47). We thus focus only on the proof for the case l > 1. To simplify the notation, we denote x (l) [x (l-1) ] as y[x], and replace x (l-1) c

, W (l) , b (l) , M l-1 , and M l , respectively, by x c , W , b, M , and M . By the definition of the deformation D τ (14), we have

EQUATION

EQUATION

Thus

EQUATION

)

where the second equality results from the fact that x(u, α, λ) -x c (u, α, λ) = x 0 (λ) depends only on λ (Proposition 1(b).) Just like the proof of Proposition 1(a), we take the integral of α first, and define

EQUATION

Thus

EQUATION

where

EQUATION

EQUATION

Therefore

EQUATION

)

We thus seek to estimate E 1 and E 2 individually.

To bound E 2 , we let

EQUATION

)

Then

EQUATION

and, for any given v and α

EQUATION

where the last inequality comes from (74). Moreover, for any given u and α,

EQUATION

where the last inequality is again because of (74). Thus, for any given α,

EQUATION

Since G m 2 ≤ 2 x c 2 (by Lemma 3), and m B l,m ≤ M 2M B l by definition (46), we thus have

EQUATION

Taking sup α on both sides gives us

EQUATION

Similarly, to bound E 1 , we introduce

EQUATION

Then

EQUATION

and, for any given v and α, we have

EQUATION

The proof of ( 96) is exactly the same as that of Lemma 3.2 in Qiu et al. (2018) after a change of variable, and we thus omit the detail. Similar to the procedure we take to bound E 2 , (96) leads to

EQUATION

Putting together (86), (93), and (97), we thus have

EQUATION

This concludes the proof of (a).

To prove (b), given any β ∈ R, and v ∈ R 2 , we have

EQUATION

Thus (67) holds true. As for (68), we have

EQUATION

where the first equality holds valid because of Theorem 1, and the second equality comes from (67).

To prove (c), for any 0 ≤ j ≤ l, define y j as

EQUATION

We thus have

EQUATION

where the second inequality is because of Proposition 1(a), the third inequality is due to (68), and the last inequality holds true because B l , C l ≤ A l ≤ 1 under (A2) (Lemma 2.) This concludes the proof of Proposition 2.

Proof of Proposition 3. The second inequality in ( 70) is due to Proposition 1(c). Because of (67), the first inequality in ( 70) is equivalent to

EQUATION

)

Just like Proposition 2(a), the proof of (103) for the case l = 1 is similar to Proposition 3.4 of Qiu et al. (2018) after the change of variable (47). A similar strategy as that of Proposition 2(a) can be used to extend the proof to the case l > 1. More specifically, denote x (l-1) , x

(l-1) c

, W (l) , b (l) , respectively, as x, x c , W, and b to simplify the notation. We have

EQUATION

where

EQUATION

EQUATION

Similar to (96), we have the following bound

EQUATION

Again, the proof of ( 107) is the same as that of Proposition 3.4 in Qiu et al. (2018) after a change of variable. The rest of the proof follows from a similar argument as in ( 92) and ( 93).

B EXPERIMENTAL DETAILS IN SECTION 5 B.1 IMPLEMENTATION DETAILS:

Discretization and scale channel truncation. In practice, the scale channel S ∼ = R needs to be truncated to a finite interval I ⊂ S such that the layerwise feature map x (l) (u, α, λ) is only computed for α ∈ I. This scale channel truncation unavoidably destroys the global scaling symmetry (similar to the fact that truncating an image to a finite spatial support destroys translation symmetry), which leads to the boundary "leakage" effect after a (joint) convolution in scale. This boundary "leakage" effect can be alleviated through the following two ways: (1) we can choose a joint convolutional filter that is compactly supported on a much smaller scale interval I α 0 compared to the truncated scale interval I, i.e., |I α | |I| (a similar idea has been explored in (Worrall & Welling, 2019)); (2) instead of using a zero-padding (which is typically chosen by default as a spatial padding method before spatial convolution), a "replicate"-padding in the scale channel (i.e., extending the truncated scale channel according to Neumann boundary condition) should be implemented before the convolution in scale. After a scale channel truncation, the layerwise feature maps x (l) (u, α, λ) and the separable basis functions {ψ k (u)} k , {ϕ m (α)} m are discretized both in space and scale on a uniform grid. To avoid the spatial aliasing effect, the number K of the spatial basis functions {ψ k (u)} k∈ [K] is not allowed to be too large (typically we set K ≤ 10.) ST -equivariant average pooling. Given a feature x (l) (u, α, λ), the traditional average-pooling in u with the same spatial kernel size across α destroys ST -equivariance (4). To remedy this issue, similar to (Zhang, 2019), we first convolve x (l) with a scale-specific low-pass filter before downsampling the convolved signal on a coarser spatial grid. Specifically, we have x(l) (u, α, λ) = R 2 x (l) (N u + u , α, λ)η(2 -α u )2 -2α du , where x(l) is the feature after pooling, η is a low-pass filter, e.g., a Gaussian kernel, and N ∈ Z + is the pooling factor. We refer to this as ST -equivariant average-pooling.

ST -equivariant batch-normalization. Batch-normalization Ioffe & Szegedy (2015) accelerates network training by reducing layerwise covariate shift, and it has become an integral part in various CNN architectures. With an extra scale index α in the feature map x (l) (u, α, λ) of an SDCFNet, we need to include α in the normalization in order not to destroy ST -equivariance, i.e., a batch of features {x (l) n (u, α, λ)} N n=1 should be normalized as if it were a collection of 3D data (two dimensions for u, and one dimension for α.)

B.2 VERIFICATION OF ST -EQUIVARIANCE:

The ScDCFNet used in this experiment has two convolutional layers, each of which is composed of a ST -equivariant convolution (5) or (6), a batch-normalization, and a 2 × 2 ST -equivariant average-pooling. The expansion coefficients a

(1) λ ,λ (k) and a

(2) λ ,λ (k, m) are sampled from a Gaussian distribution and truncated to K = 8 and K α = 3 leading coefficients for u and α respectively. Similarly, a regular CNN with two convolutional layers and randomly generated 5 × 5 convolutional kernels is used as a baseline for comparison.

B.3 MULTISCALE IMAGE CLASSIFICATION:

In the experiments on multiscale image classification on the SMNIST and SFashion dataaset, the network architectures for the ScDCFNet and the regular CNN are shown in Table 2 . Stochastic gradient descent (SGD) with decreasing learning rate from 10 -2 (10 -1 ) to 10 -4 (10 -3 ) is used to train all networks without (with) batch-normalization for 160 epochs. 

B.4 IMAGE RECONSTRUCTION:

The network architectures for the SDCFNet and regular CNN auto-encoders are shown in Table 3 . The filter expansion in the SDCFNet auto-encoder is truncated to K = 8 and K α = 3. SGD with decreasing learning rate from 10 -2 to 10 -4 is used to train both networks for 20 epochs. 

:



Figures and Tables:

and an input image

(a) A special case of ST -equivariant CNN with (multiscale) spatial convolutions.

Figure 1: (a) A special case of ST -equivariant CNN with only (multiscale) spatial convolutions. The previous works on ST -equivariant CNNs (Kanazawa et al., 2014; Marcos et al., 2018; Xu et al., 2014; Ghosh & Gupta, 2019) are all variants of this architecture. (b) The general case of ST -equivariant CNN with joint convolutions (Theorem 1) where information transfers among different scales. See Remark 1 for more explanation.

Figure 2: Verification of ST -equivariance in Section 5.1. Given the original input x (0) and its rescaled version D β,v x (0) , the four figures in each dashed rectangle are: x (l) [x (0) ] (l-th layer feature of the original input), x (l) [D β,v x (0) ] (l-th layer feature of the rescaled input), T β,v x (l) [x (0) ] (rescaled l-th layer feature of the original input), and the difference (x(l) [D β,v x (0) ] -T β,v x (l) [x (0) ]) displayed in a (signal intensity) scale relative to the maximum value of x (l) [D β,v x (0) ].It is clear that even after numerical discretization, ST -equivariance still approximately holds for ScDCFNet, i.e., x (l) [D β,v x (0) ] -T β,v x (l) [x (0) ] ≈ 0, but not for a regular CNN.

(a) Zero-padding for the scale channel.(b) Replicate-padding for the scale channel.

Figure 3: The numerical error in equivariance (i.e., the boundary "leakage" effect incurred by scale channel truncation) as a function of network depth. Either (a) zero-padding or (b) replicate-padding is used for the convolution in scale.The error is unavoidable as depth becomes larger, but it can be mitigated by (1) using joint convolutional filters with a smaller support in scale (i.e., a smaller number of "taps" after discretization), and (2) using a replicate-padding instead of zero-padding. See Appendix B.1 for detailed explanation.

Figure 4: Reconstructing rescaled versions of the original test image by manipulating its image code C according to the group action (3). The first two images on the left are the original inputs; Decoder(C) denotes the reconstruction using the (unchanged) image code C; Decoder(D β,v C) and Decoder(T β,v C) denote the reconstructions using the "rescaled" image codes D β,v C and T β,v C respectively according to (2) and (3). Unlike the regular CNN auto-encoder, the ScDCFNet auto-encoder manages to generate rescaled versions of the original input, suggesting that it successfully encodes the scale information directly into the representation.

(k, m) be the coefficients of the filter W (l) λ ,λ (u, α) under the joint bases {ψ k } k and {ϕ m } m defined in (10), and define W (l) λ ,λ,m (u) as

to prove Proposition 2 and Proposition 3, where the following lemma from Qiu et al. (2018) is useful. Lemma 4 (Lemma A.1 of Qiu et al. (

softmax-loss fc64 ReLU fc10 softmax-loss Table 2: Network architectures used for the experiments in Section 5.2. cLxLxM'xM: a regular convolutional layer with M' input channels, M output channels, and LxL spatial kernels. sc(Nα)LxLxM'xM: the first-layer convolution operation (5) in ScDCFNet, where Nα is the number of the uniform grid points to discretize the scale interval [-1.6, 0], and LxL is the spatial kernel size on the largest scale α = 0. sc(Nα)LxLxLαxM'xM: the l-th layer (l > 1) convolution operation (6) in ScDCFNet, where the extra symbol Lα stands for the filter size in α. apLxL(sapLxL): the regular (ST -equivariant) LxL average-pooling. fcM: a fully connected layer with M output channels. Batch-normalization layers are added to each convolutional layer if adopted during training.

Classification accuracy on the SMNIST and SFashion dataset with and without batch-normalization.

Table content: <table><tr><td colspan="2">Without batch-normalization</td><td colspan="3">SMNIST test accuracy (%)</td><td colspan="2">SFashion test accuracy (%)</td></tr><tr><td>Architectures</td><td>Ratio</td><td>Ntr = 2000</td><td>Ntr = 5000</td><td>Ntr = 10000</td><td>Ntr = 2000</td><td>Ntr = 5000</td></tr><tr><td>CNN, M = 32</td><td>1.00</td><td>92.60 ± 0.17</td><td>94.86 ± 0.25</td><td>96.43 ± 0.18</td><td>77.74 ± 0.28</td><td>82.57 ± 0.38</td></tr><tr><td>ScDCFNet, M = 16</td><td/><td/><td/><td/><td/><td/></tr><tr><td>K = 10, Kα = 3</td><td>0.84</td><td>93.75 ± 0.02</td><td>95.70 ± 0.09</td><td>96.89 ± 0.10</td><td>78.95 ± 0.31</td><td>83.51 ± 0.71</td></tr><tr><td>K = 8, Kα = 3</td><td>0.67</td><td>93.91 ± 0.30</td><td>95.71 ± 0.10</td><td>96.81 ± 0.12</td><td>79.22 ± 0.50</td><td>83.06 ± 0.32</td></tr><tr><td>K = 5, Kα = 3</td><td>0.42</td><td>93.52 ± 0.29</td><td>95.19 ± 0.13</td><td>96.77 ± 0.12</td><td>79.74 ± 0.44</td><td>83.46 ± 0.69</td></tr><tr><td>K = 10, Kα = 2</td><td>0.56</td><td>93.68 ± 0.23</td><td>95.54 ± 0.21</td><td>96.87 ± 0.13</td><td>79.01 ± 0.61</td><td>83.43 ± 0.60</td></tr><tr><td>K = 8, Kα = 2</td><td>0.45</td><td>93.67 ± 0.19</td><td>95.51 ± 0.20</td><td>96.85 ± 0.06</td><td>79.15 ± 0.59</td><td>83.44 ± 0.37</td></tr><tr><td>K = 5, Kα = 2</td><td>0.28</td><td>93.51 ± 0.30</td><td>95.35 ± 0.21</td><td>96.49 ± 0.17</td><td>78.57 ± 0.53</td><td>82.95 ± 0.46</td></tr><tr><td>ScDCFNet, M = 8</td><td/><td/><td/><td/><td/><td/></tr><tr><td>K = 10, Kα = 2</td><td>0.14</td><td>93.68 ± 0.17</td><td>95.21 ± 0.12</td><td>96.51 ± 0.24</td><td>79.11 ± 0.76</td><td>82.92 ± 0.68</td></tr><tr><td>K = 8, Kα = 2</td><td>0.11</td><td>93.39 ± 0.25</td><td>95.25 ± 0.47</td><td>96.73 ± 0.16</td><td>78.43 ± 0.76</td><td>82.53 ± 0.58</td></tr><tr><td>K = 5, Kα = 2</td><td>0.09</td><td>93.21 ± 0.20</td><td>94.99 ± 0.12</td><td>96.35 ± 0.12</td><td>77.97 ± 0.37</td><td>82.21 ± 0.67</td></tr><tr><td>K = 10, Kα = 1</td><td>0.09</td><td>93.26 ± 0.52</td><td>95.22 ± 0.31</td><td>96.52 ± 0.21</td><td>78.71 ± 0.46</td><td>83.05 ± 0.51</td></tr><tr><td>K = 8, Kα = 1</td><td>0.06</td><td>93.61 ± 0.11</td><td>95.03 ± 0.31</td><td>96.61 ± 0.18</td><td>78.69 ± 0.72</td><td>82.96 ± 0.27</td></tr><tr><td>K = 5, Kα = 1</td><td>0.04</td><td>93.23 ± 0.13</td><td>94.84 ± 0.38</td><td>96.31 ± 0.17</td><td>78.38 ± 0.81</td><td>82.14 ± 0.25</td></tr><tr><td colspan="2">With batch-normalization</td><td colspan="3">SMNIST test accuracy (%)</td><td colspan="2">SFashion test accuracy (%)</td></tr><tr><td>Architectures</td><td>Ratio</td><td>Ntr = 2000</td><td>Ntr = 5000</td><td>Ntr = 10000</td><td>Ntr = 2000</td><td>Ntr = 5000</td></tr><tr><td>CNN, M = 32</td><td>1.00</td><td>94.78 ± 0.17</td><td>96.58 ± 0.17</td><td>97.41 ± 0.21</td><td>79.79 ± 0.40</td><td>84.38 ± 0.17</td></tr><tr><td>ScDCFNet, M = 16</td><td/><td/><td/><td/><td/><td/></tr><tr><td>K = 10, Kα = 3</td><td>0.84</td><td>95.69 ± 0.15</td><td>96.99 ± 0.23</td><td>97.71 ± 0.11</td><td>81.12 ± 0.42</td><td>84.97 ± 0.16</td></tr><tr><td>K = 8, Kα = 3</td><td>0.67</td><td>95.72 ± 0.29</td><td>97.15 ± 0.24</td><td>97.72 ± 0.07</td><td>81.41 ± 0.35</td><td>85.11 ± 0.26</td></tr><tr><td>K = 5, Kα = 3</td><td>0.42</td><td>95.31 ± 0.21</td><td>96.75 ± 0.13</td><td>97.38 ± 0.07</td><td>81.73 ± 0.14</td><td>84.70 ± 0.19</td></tr><tr><td>K = 10, Kα = 2</td><td>0.56</td><td>95.58 ± 0.16</td><td>96.92 ± 0.07</td><td>97.61 ± 0.09</td><td>81.21 ± 0.20</td><td>84.77 ± 0.15</td></tr><tr><td>K = 8, Kα = 2</td><td>0.45</td><td>95.76 ± 0.17</td><td>96.74 ± 0.22</td><td>97.68 ± 0.09</td><td>80.84 ± 0.28</td><td>84.70 ± 0.18</td></tr><tr><td>K = 5, Kα = 2</td><td>0.28</td><td>95.43 ± 0.09</td><td>96.54 ± 0.20</td><td>97.43 ± 0.13</td><td>81.23 ± 0.23</td><td>84.65 ± 0.36</td></tr><tr><td>SI-CNN</td><td>1.02</td><td>-</td><td>-</td><td>97.25 ± 0.09</td><td>-</td><td>-</td></tr><tr><td>VF-SECNN</td><td>1.02</td><td>-</td><td>-</td><td>97.56 ± 0.07</td><td>-</td><td>-</td></tr></table>

Maurice Weiler, Fred A Hamprecht, and Martin Storath. Learning steerable filters for rotation equivariant cnns. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 849-858, 2018b. Qixiang Ye, Qiang Qiu, and Jianbin Jiao. Oriented response networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 519-528, 2017.

Table content: <table><tr><td colspan="3">Daniel E Worrall and Max Welling. Deep scale-spaces: Equivariance over scale. arXiv preprint</td></tr><tr><td colspan="2">arXiv:1905.11697, 2019.</td><td/></tr><tr><td colspan="3">Daniel E Worrall, Stephan J Garbin, Daniyar Turmukhambetov, and Gabriel J Brostow. Harmonic</td></tr><tr><td colspan="3">networks: Deep translation and rotation equivariance. In Proceedings of the IEEE Conference on</td></tr><tr><td colspan="2">Computer Vision and Pattern Recognition, pp. 5028-5037, 2017.</td><td/></tr><tr><td colspan="3">Han Xiao, Kashif Rasul, and Roland Vollgraf. Fashion-mnist: a novel image dataset for benchmarking</td></tr><tr><td colspan="2">machine learning algorithms, 2017.</td><td/></tr><tr><td colspan="3">Yichong Xu, Tianjun Xiao, Jiaxing Zhang, Kuiyuan Yang, and Zheng Zhang. Scale-invariant</td></tr><tr><td colspan="2">convolutional neural networks. arXiv preprint arXiv:1411.6369, 2014.</td><td/></tr><tr><td colspan="3">Fisher Yu and Vladlen Koltun. Multi-scale context aggregation by dilated convolutions. In Interna-</td></tr><tr><td colspan="2">tional Conference on Learning Representations, 2016.</td><td/></tr><tr><td colspan="3">Fisher Yu, Vladlen Koltun, and Thomas Funkhouser. Dilated residual networks. In The IEEE</td></tr><tr><td colspan="2">Conference on Computer Vision and Pattern Recognition (CVPR), July 2017.</td><td/></tr><tr><td>Richard Zhang.</td><td>Making convolutional networks shift-invariant again.</td><td>arXiv preprint</td></tr><tr><td colspan="2">arXiv:1904.11486, 2019.</td><td/></tr><tr><td>Yanzhao Zhou,</td><td/><td/></tr></table>

Architectures of the auto-encoders used for the experiment in Section 5.3. The encoded representation is the output of the second layer. ctLxLxM'xM: transposed-convolutional layers with M' input channels, M output channels, and LxL spatial kernels. us2x2: 2x2 spatial upsampling. See the caption of Table2for the definitions of other symbols. Batch-normalization (not shown in the table) is used after each convolutional layer.

Table content: <table/>

Peer review (iclr2020):
The paper proposes a scale-equivariant Neural Networks model to solve the multi-scale image classification task. The main contributions are the proposed joint convolution across the spatial and scale space, and the decomposed filters to reduce computation cost and improve robustness. The paper is generally well-written and well placed in the literature. Different from existing work on the scale-equivariance CNNs, they build a more general model that allows different scale information to transfer through different layers. The experiments also suggest the model achieving scale-equivariance and the superior performance of the proposed method compared with several baselines. However, for the novelty part of the proposed method (the separable basis decomposition), it is not convincing enough because the differences between this paper and Cheng et al. (2019) and Weiler et al. (2018b) are not clear. Questions: 1. The authors claim that the joint convolutions across the space and the scaling group are both *sufficient* and *necessary*. Although the experiments show that the proposed method achieves better performance, which might indicate the *sufficiency* of the architecture, however, how should the *necessity* be proved? 2. How should *K* and *K_alpha* be selected (Table 1)? When data is enough (e.g., 5000), it seems that only some specific values can improve performance. 3. How much can the model size be reduced compared with other multiscale image classification models? And could you provide some concrete comparisons about the computation cost? Typos: - 1st line in 2nd paragraph of Introduction: rotation-equivarianc(e)