Title: STEERABLE CNNS

Abstract: It has long been recognized that the invariance and equivariance properties of a representation are critically important for success in many vision tasks. In this paper we present Steerable Convolutional Neural Networks, an efficient and flexible class of equivariant convolutional networks. We show that steerable CNNs achieve state of the art results on the CIFAR image classification benchmark. The mathematical theory of steerable representations reveals a type system in which any steerable representation is a composition of elementary feature types, each one associated with a particular kind of symmetry. We show how the parameter cost of a steerable filter bank depends on the types of the input and output features, and show how to use this knowledge to construct CNNs that utilize parameters effectively.

1. INTRODUCTION:

Much of the recent progress in computer vision can be attributed to the availability of large labelled datasets and deep neural networks capable of absorbing large amounts of information. While many practical problems can now be solved, the requirement for big (labelled) data is a fundamentally unsatisfactory state of affairs. Human beings are able to learn new concepts with very few labels, and reproducing this ability is an important challenge for artificial intelligence research. From an applied perspective, improving the statistical efficiency of deep learning is vital because in many domains (e.g. medical image analysis), acquiring large amounts of labelled data is costly.

To improve the statistical efficiency of machine learning methods, many have sought to learn invariant representations. In deep learning, however, intermediate layers should not be invariant, because the relative pose of local features must be preserved for further layers (Cohen & Welling, 2016; Hinton et al., 2011) . Thus, one is led to the idea of equivariance: a network is equivariant if the representations it produces transform in a predictable way under transformations of the input. In other words, equivariant networks produce representations that are steerable. Steerability makes it possible to apply filters not just in every position (as in a standard convolution layer), but in every pose, thus allowing for increased parameter sharing.

Previous work has shown that equivariant CNNs yield state of the art results on classification tasks (Cohen & Welling, 2016; Dieleman et al., 2016) , even though they only enforce equivariance to small groups of transformations like rotations by multiples of 90 degrees. Learning representations that are equivariant to larger groups is likely to result in further gains, but the computational cost of current methods scales linearly with the size of the group, making this impractical. In this paper we present the general theory of steerable CNNs, which covers previous approaches but also shows how the computational cost can be decoupled from the size of the symmetry group, thus paving the way for future scaling.

To better understand the structure of steerable representations, we analyze them mathematically. We show that any steerable representation is a composition of low-dimensional elementary feature types. Each elementary feature can be steered independently of the others, and captures a distinct characteristic of the input that has an invariant or "objective" meaning. This doctrine of "observerindependent quantities" was put forward by (Weyl, 1939, ch. 1.4) and is used throughout physics. It has been applied to vision and representation learning by Kanatani (1990) ; Cohen (2013) . The mentioned type system puts constraints on the network weights and architecture. Specifically, since an equivariant filter bank is required to map given input feature types to given output feature types, the number of parameters required by such a filter bank is reduced. Furthermore, by the same logic that tells us not to add meters to seconds, steerability considerations prevent us from adding features of different types (e.g. for residual learning (He et al., 2016a) ).

The rest of this paper is organized as follows. The theory of steerable CNNs is introduced in Section 2. Related work is discussed in Section 3, which is followed by classification experiments (Section 4) and a discussion and conclusion in Section 5.

2. STEERABLE CNNS:



2.1. FEATURE MAPS AND FIBERS:

Consider a 2D signal f : Z 2 → R K with K channels. The signal may be an input to the network or a feature representation computed by a CNN. Since signals can be added and multiplied by scalars, the set of signals of this signature forms a linear space F. Each layer of the network has its own feature space F l , but we will often suppress the layer index to reduce clutter.

It is customary in deep learning to describe f ∈ F as a stack of feature maps f k (for k = 1, . . . , K).

In this paper we also consider another decomposition of F into fibers. The fiber F x at position x in the "base space" Z 2 is the K-dimensional vector space spanned by all channels at position x. Thus, f ∈ F is comprised of feature vectors f (x) that live in the fibers F x (see Figure 1(a) ). Given some group of transformations G that acts on points in Z 2 , we can transform signals f ∈ F 0 :

EQUATION

This says that the pixel at g -1 x gets moved to x by the transformation g ∈ G. We note that π 0 (g) is a linear operator.

An important property of π 0 is that π 0 (gh) = π 0 (g)π 0 (h). Here, gh means composition of transformations in G, while π 0 (g)π 0 (h) denotes matrix multiplication. A vector space such as F 0 equipped with a set of linear operators π 0 satisfying this condition is known as a group representation (or just representation, for short). A lot is known about group representations (Serre, 1977) , and we will make extensive use of the theory, explaining the relevant concepts as needed.

2.2. STEERABLE REPRESENTATIONS:

Let (F, π) be a feature space with a group representation and Φ : F → F a convolutional network.

The feature space F is said to be (linearly) steerable with respect to G, if for all transformations g ∈ G, the features Φf and Φπ(g)f are related by a linear transformation π (g) that does not depend on f . So π (g) allows us to "steer" the features in F without referring to the input in F from which they were computed.

Combining the definition of steerability (i.e. Φπ(g) = π (g)Φ) with the fact that π is a group representation, we find that π must also be a group representation:

π (gh)Φf = Φπ(gh)f = Φπ(g)π(h)f = π (g)Φπ(h)f = π (g)π (h)Φf (2)

Figure 2 : Diagram showing the structural consistency that follows from equivariance of the network Φ and the group representation structure of π 0 . The result of following any path in this diagram depends only on the beginning and endpoint but is independent of the path itself, c.f. eq. 2

That is, π (gh) = π (g)π (h) (at least in the span of the image of Φ). Figure 2 gives an illustration.

For simplicity, we will restrict our attention to discrete groups of transformations. The theory for continuous groups is almost completely analogous. Our running example will be the group p4m which consists of translations, rotations by 90 degrees around any point, and reflections. We further restrict our attention to groups that are constructed1 from the group of translations Z 2 and a group H of transformations that fixes the origin 0 ∈ Z 2 . For p4m, we have H = D4, the 8-element group of reflections and rotations about the origin.

Using this division, we can first construct a filter bank that generates H-steerable fibers, and then show that convolution with such a filter bank produces a feature space that is steerable with respect to the whole group G.

2.3. EQUIVARIANT FILTER BANKS:

A filter bank can be described as an array of dimension (K , K, s, s), where K, K denote the number of input / output channels and s is the kernel size. For our purposes it is useful to think of a filter bank as a linear map Ψ : F → R K that takes as input a signal f ∈ F and produces a K -dimensional feature vector. The filter bank only looks at an s × s patch in F, so the matrix representing Ψ has shape K × K • s 2 . To correlate a signal f using Ψ, one would simply apply Ψ to translated copies of f , producing the output signal one fiber at a time.

We assume (by induction) that we have a representation π that allows us to steer F. In order to make the output of the convolution steerable, we need the filter bank Ψ : F → R K to be H-equivariant:

EQUATION

Figure 3 : A filter bank Ψ that is H-equivariant. In this example, ρ 1 represents the 90-degree rotation r by a permutation matrix that cyclicly shifts the 4 channels.

for some representation ρ of H that acts on the output fibers (see Figure 3 ). Note that we only require equivariance with respect to H (which excludes translations) and not G, because translations can move patterns into and out of the receptive field of a fiber, making full translation equivariance impossible.

The space of maps satisfying the equivariance constraint is denoted Hom H (π, ρ), because an equivariant map Ψ is a "homomorphism of group representations", meaning it respects the structure of the representations. Equivariant maps are also sometimes called intertwiners (Serre, 1977) .

Since the equivariance constraint (eq. 3) is linear in Ψ, the space Hom H (π, ρ) of admissible filter banks is a vector space: any linear combination of maps Ψ, Ψ ∈ Hom H (π, ρ) is again an intertwiner. Hence, given π and ρ, we can compute a basis for Hom H (π, ρ) by solving a linear system.

Computation of the intertwiner basis is done offline, before training. Once we have such a basis ψ 1 , . . . , ψ n for Hom H (π, ρ), we can express any equivariant filter bank Ψ as a linear combination Ψ = i α i ψ i using parameters α i . As shown in Section 2.8, this can be done efficiently even in high dimensions.

2.4. INDUCTION:

We have shown how to parameterize filter banks that intertwine π and ρ, making the output fibers Hsteerable by ρ if the input space F is H-steerable by π. In this section we show how H-steerability of fibers F x leads to G-steerability of the whole feature space F . This happens through a natural and important construction known as the induced representation (Mackey, 1952; 1953; 1968; Serre, 1977; Taylor, 1986; Folland, 1995; Kaniuth & Taylor, 2013) .

As stated before, the correlation Ψ f could be computed by translating f before applying Ψ:

EQUATION

Where x ∈ Z 2 is interpreted as a translation when given as input to π.

We can now calculate the transformation law of the output space. To do so, we apply a translation t and transformation r ∈ H to f ∈ F, yielding π(tr)f , and then perform the correlation with Ψ.

With a some algebra (Appendix A), we find:

EQUATION

then Ψ π(g)f = π (g)Ψ f (see Fig. 4 ). This representation π is known as the representation of G induced by the representation ρ of H, and is denoted π = Ind G H ρ. When parsing eq. 6, it is important to keep in mind that (as indicated by the square brackets) π acts on the whole feature space F while ρ acts on individual fibers.

If we compare the induced representation (eq. 6) to the representation π 0 defined in eq. 1, we see that the difference lies only in the presence of a factor ρ(r) applied to the fibers. This factor describes how the feature channels are mixed by the transformation. The color channels in the input space do not get mixed by geometrical transformations, so we say that π 0 is induced from the trivial representation ρ 0 (h) = I.

Now that we have a G-steerable feature space F , we can iterate the procedure by computing a basis for the space of intertwiners between π (restricted to H) and some ρ of our choosing.

2.5. FEATURE TYPES AND CHARACTER THEORY:

By now, the reader may be wondering how to choose ρ, or indeed what the space of representations that we can choose from looks like in the first place. We will answer these questions in this section by showing that each representation has a type (encoded as a short list of integers) that corresponds to a certain symmetry or invariance of the feature. We further show how the number of parameters of an equivariant filter bank depends on the types of the representations π and ρ that it intertwines. Our discussion will make use of a number of important elementary results from group representation theory which are stated but not proved. The reader wishing to go deeper may consult chapters 1 and 2 of the excellent book by Serre (1977) .

Recall that a group representation is a set of invertible linear maps ρ(g) : R K → R K satisfying ρ(gh) = ρ(g)ρ(h) for all elements g, h ∈ H. It can be shown that any representation is a direct sum (i.e. block_diag plus change of basis) of a number of "elementary" representations associated with G. These building blocks are called irreducible representations (or irreps), because they can

Irrep Basis in F 0 e r r 2 r 3 m mr mr 2 mr 3 A1 1 1 1 1 1 1 1 1 A2 1 1 1 1 -1 -1 -1 -1 B1 1 -1 1 -1 1 -1 1 -1 B2 1 -1 1 -1 -1 1 -1 1 E 1 0 0 1 0 -1 1 0 -1 0 0 -1 0 1 -1 0 -1 0 0 1 0 1 1 0 1 0 0 -1 0 -1 -1 0

Table 1: The irreducible representations of the roto-reflection group D4. This group is generated by 90-degree rotations r and mirror reflections m, and has 5 irreps labelled A1, A2, B1, B2, E. Left: decomposition of π 0 (eq. 1) in the space F 0 of 3×3 filters with one channel. This representation turns out to have type (3, 0, 1, 1, 2), meaning there are three copies of A1, one copy of B1, one copy of B2, and two copies of the 2D irrep E (A2 does not appear). Right: the representation matrices of each irrep, for each element of the group D4. The reader may verify that these are valid representations, and that the characters (traces) are orthogonal.

themselves not be block-diagonalized. In other words, if ϕ i are the irreducible representations of H, any representation ρ of H can be written in block-diagonal form:

EQUATION

for some basis matrix A, and some i k that index the irreps (each irrep may occur 0 or more times).

Each irreducible representation corresponds to a type of symmetry, as shown in table 1 . For example, as can be seen in this table, the representations B1 and B2 represent the 90-degree rotation r as the matrix [-1], so the basis filters for these representations change sign when rotated by r. It should be noted that in the higher layers l > 0, elementary basis filters can look different because they depend on the representation π l that is being decomposed.

The fact that all representations can be decomposed into a direct sum of irreducibles implies that each representation has a basis-independent type: which irreducible representations appear in it, and with what multiplicity. For example, the input representation π 0 (table 1 ) has type (3, 0, 1, 1, 2). This means that, for instance, π 0 (r) is block-diagonalized as:

EQUATION

Where the block matrix contains (3, 0, 1, 1, 2) copies of the irreps (A1, A2, B1, B2, E), evaluated at r (see column r in table 1). The change of basis matrix A is constructed from the basis filters shown in table 1 (and the same A block-diagonalizes π 0 (g) for all g).

So the most general way in which we can choose a representation ρ is to choose multiplicities m i ≥ 0 and a basis matrix A. In Section 2.7 we will find that there is an important restriction on this freedom, which alleviates the need to choose a basis. The choice of multiplicities is then the only hyperparameter, analogous to the choice of the number of channels in an ordinary CNN. Indeed, the multiplicities determine the number of channels: K = i m i dim ϕ i .

2.6. DETERMINING THE TYPE OF THE INDUCED REPRESENTATION:

By choosing the type of ρ, we also determine the type of π = Ind G H ρ (restricted to H), but what is it? Explicit formulas exist (Reeder (2014) ; Serre (1977) ) but are rather complicated, so we will present a simple computational procedure that can be used to determine the type of any representation. This procedure relies on the character χ ρ (g) = Tr(ρ(g)) of the representation to be decomposed. The most important fact about characters is that the characters of irreps ϕ i , ϕ j are orthogonal:

EQUATION

Furthermore, since the trace of a direct sum equals the sum of the traces (i.e. χ ρ⊕ρ = χ ρ + χ ρ ), and every representation ρ is a direct sum of irreps, it follows that we can obtain the multiplicity of irrep ϕ i in ρ by computing the inner product with the i-th character:

χ ρ , χ ϕi = χ ⊕j mj ϕj , χ ϕi = j m j χ ϕj , χ ϕi = j m j χ ϕj , χ ϕi = m i (10)

So a simple dot product of characters is all we need to determine the type of a representation. As we will see next, the type of the input and output representation of a layer determines the parameter cost of that layer.

2.6.1. THE PARAMETER COST OF EQUIVARIANT CONVOLUTION LAYERS:

Steerable CNNs use parameters much more efficiently than ordinary CNNs. In this section we show how the number of parameters required by an equivariant layer is determined by the feature types of the input and output space, and how the efficiency of a choice of feature types may be evaluated.

In section 2.3, we found that a filter bank Ψ is equivariant if and only if it lies in the vector space called Hom H (π, ρ). It follows that the number of parameters for such a filter bank is equal to the dimensionality of this space, n = dim Hom H (π, ρ). This number is known as the intertwining number of π and ρ and plays an important role in the theory of group representations.

As with multiplicities, the intertwining number is easily computed using characters. It can be shown (Reeder, 2014) that the intertwining number equals: dim Hom H (π, ρ) = χ π , χ ρ .

(11) By linearity and the orthogonality of characters, we find that dim Hom H (π, ρ) = i m i m i , for representations π, ρ of type (m 1 , . . . , m J ) and (m 1 , . . . , m J ), respectively. Thus, as far as the number of parameters of a steerable convolution layer is concerned, the only choice we have to make for ρ is its type -a short list of integers m i .

The efficiency of a choice of type can be assessed using a quantity we call the parameter utilization:

EQUATION

)

The numerator equals s 2 K • K : the number of parameters for a non-equivariant filter bank. The denominator equals the parameter cost of an equivariant filter bank with the same filter size and number of input/output channels. Typical values of µ in effective architectures are around |H|, e.g. µ = 8 for H = D4. Such a layer utilizes its parameters 8 times more intensively than an ordinary convolution layer.

2.7. EQUIVARIANT NONLINEARITIES & CAPSULES:

In the previous section we showed that only the basis-independent types of π and ρ play a role in determining the parameter cost of an equivariant filter bank. An equivalent representation ρ (g) = Aρ(g)A -1 will have the same type, and hence the same parameter cost as ρ. However, when it comes to nonlinearities, different bases behave differently.

Just like a convolution layer (eq. 3), a layer of nonlinearities must commute with the group action. An elementwise nonlinearity ν : R → R (or more generally, a fiber-wise nonlinearity ν : R K → R K ) is admissible for an input representation ρ if there exists an output representation ρ such that ν applied after ρ equals ρ applied after ν.

Since commutation with nonlinearities depends on the basis, we need a more granular notion than the feature type. We define a ρ-capsule as a (typically low-dimensional) feature vector that transforms according to a representation ρ (we may also refer to ρ as the capsule). Thus, while a capsule has a type, not all representations of that type are equivalent as capsules. Given a catalogue of capsules ρ i (for i = 1, . . . , C) with multiplicities m i , we can construct a fiber as a stack of capsules that is steerable by a block-diagonal representation ρ with m i copies of ρ i on the diagonal.

Like the capsules of Hinton et al. (2011) , our capsules encode the pose of a pattern in the input, and consist of a number of units (dimensions) that do not get mixed with the units of other capsules by symmetries. In this sense, a stack of capsules is disentangled (Cohen & Welling, 2014) .

We have found a few simple types of capsules and corresponding admissible nonlinearities. It is easy to see that any nonlinearity is admissible for ρ when the latter is realized by permutation matrices: permuting a list of coordinates and then applying a nonlinearity is the same as applying the nonlinearity and then permuting. If ρ is realized by a signed permutation matrix, then CReLU(α) = (ReLU(α), ReLU(-α)) introduced by Shang et al. (2016) , or any concatenated nonlinearity ν (α) = (ν(α), ν(-α)), will be admissible. Any scale-free concatenated nonlinearity such as CReLU is admissible for a representation realized by monomial matrices (having the same nonzero pattern as a permutation matrix). Finally, we can always make a representation of a finite group orthogonal by a suitable choice of basis, which means that we can use any nonlinearity that acts only on the length of the vector.

For many groups, the irreps can be realized using signed permutation matrices, so we can use irreducible ϕ i -capsules with concatenated nonlinearities such as CReLU. Another class of capsules, which we call quotient capsules, are naturally realized by permutation matrices, and are thus compatible with any nonlinearity. These are described in Appendix C.

2.8. COMPUTATIONAL EFFICIENCY:

Modern convolutional networks often use on the order of hundreds of channels K per layer Zagoruyko & Komodakis (2016). When using 3 × 3 filters, a filter bank can have on the order of 9K 2 ≈ 10 6 dimensions. The number of parameters for an equivariant filter bank is about µ ≈ 10 times smaller, but a basis for the space of equivariant filter banks would still be about 10 6 × 10 5 , which is too large to be practical.

Fortunately, the block-diagonal structure of π and ρ induces a block structure in Ψ. Suppose π = block_diag(π 1 , . . . , π P ) and ρ = block_diag(ρ 1 , . . . , ρ Q ). Then an intertwiner is a matrix of shape K × Ks 2 , where K = i dim ρ i and Ks 2 = i dim π i . This matrix has the following block structure:

EQUATION

Each block h ij corresponds to an input-output pair of capsules, and can be parameterized by a linear combination of basis matrices ψ ij k ∈ Hom H (ρ i , π j ). In practice, we typically use many copies of the same capsule (say n i copies of ρ i and m j copies of π j ). Therefore, many of the blocks h ij can be constructed using the same intertwiner basis. If we order equivalent capsules to be adjacent, the intertwiner consists of "blocks of blocks". Each superblock H ij has shape n i dim ρ i × m j dim π j , and consists of subblocks of shape dim ρ i × dim π j .

The computation graph for an equivariant convolution layer is constructed as follows. Given a catalogue of capsules ρ i and corresponding post-activation capsules Act ν ρ i , we compute the induced representations π i = Ind G H Act ν ρ i and the bases for Hom H (ρ i , π j ) in an offline step. The bases are stored as matrices ψ ij of shape dim ρ i • dim π j × dim Hom H (ρ i , π j ). Then, given a list of input / output multiplicities n i , m j for the capsules, a parameter matrix Θ ij of shape dim Hom H (ρ i , π j ) × n i m j is instantiated. The superblocks H ij are obtained by a matrix multiplication ψ ij Θ ij plus reshaping to shape dim ρ i • dim π j × n i m j . Once all superblocks are filled in, the matrix Ψ is reshaped from K × Ks 2 to K × K × s × s and convolved with the input.

2.9. USING STEERABLE CNNS IN PRACTICE:

A full understanding of the theory of steerable CNNs requires some knowledge of group representation theory, but using steerable CNN technology is not much harder than using ordinary CNNs. Instead of choosing a number of channels for a given layer, one chooses a list of multiplicities m i for each capsule in a library of capsules provided by the developer. To preserve equivariance, the activation function applied to a capsule must be chosen from a list of admissible nonlinearities for that capsule (which sometimes includes all nonlinearities). Finally, one must respect the type system and only add identical capsules (e.g. in ResNets). These constraints can all be checked automatically.

3. RELATED WORK:

Steerable filters were first studied for applications in signal processing and low-level vision (Freeman & Adelson, 1991; Greenspan et al., 1994; Simoncelli & Freeman, 1995) . More or less explicit connections between steerability and group representation theory have been observed by Lenz (1989) ; Koenderink & Van Doorn (1990) ; Teo (1998) ; Krajsek & Mester (2007) . As we have tried to demonstrate in this paper, representation theory is indeed the natural mathematical framework in which to study steerability.

In machine learning, equivariant kernels were studied by Reisert (2008) ; Skibbe (2013) . In the context of neural networks, various authors have studied equivariant representations. Capsules were introduced in Hinton et al. (2011) , and significantly improved by Tieleman (2014) . A theoretical account of equivariant representation learning in the brain is given by Anselmi et al. (2014) . Group equivariant scattering networks were defined and studied by Mallat (2012) for compact groups, and by Sifre & Mallat (2013) ; Oyallon & Mallat (2015) for the roto-translation group. Jacobsen et al. (2016) describe a network that uses a fixed set of (possibly steerable) basis filters with learned weights. Lenc & Vedaldi (2015) showed empirically that convolutional networks tend to learn equivariant representations, which suggests that equivariance could be a good inductive bias.

Invariant and equivariant CNNs have been studied by Gens & Domingos (2014) ; Kanazawa et al. (2014) ; Dieleman et al. (2015; 2016) ; Cohen & Welling (2016) ; Marcos et al. (2016) . All of these models, as well as scattering networks, implicitly use the regular representation: feature maps are (often implicitly) conceived of as functions on G, and the action of G on the space of functions on G is known as the regular representation (Serre (1977) , Appendix B). Our work is the first to consider other kinds of equivariance in the context of CNNs.

The idea of adding a type system to neural networks has been explored by Olah (2015) ; Balduzzi & Ghifary (2016) . We have shown that a type system emerges naturally from the decomposition of a linear representation of a mathematical structure (a group, in our case) associated with the representation learned by a neural network.

4. EXPERIMENTS:

We implemented steerable CNNs in Chainer (Tokui et al., 2015) and performed experiments on the CIFAR10 dataset (Krizhevsky, 2009) to determine if steerability is a useful inductive bias, and to determine the relative merits of the various types of capsules. In order to run experiments faster, and to see how steerable CNNs perform in the small-data regime, we used only 2000 training samples for our initial experiments.

As a baseline, we used the competitive wide residual networks (ResNets) architecture (He et al., 2016a; b; Zagoruyko & Komodakis, 2016) . We tuned the capacity of this network for the reduced dataset size and settled on a 20 layer architecture (three residual blocks per stage, with two layers each, for three stages with feature maps of size 32 × 32, 16 × 16 and 8 × 8, various widths). We compared the baseline architecture to various kinds of steerable CNN, obtained by replacing the convolution layers by steerable convolution layers. To make sure that differences in performance were not simply due to underfitting or overfitting, we tuned the width (number of channels, K) using a validation set. The rest of the training procedure is identical to Cohen & Welling (2016) , and is fixed for all of our experiments.

We first tested steerable CNNs that consist entirely of a single kind of capsule. We found that architectures with only one type do not perform very well (roughly 30-40% error, vs. 30% for plain ResNets trained on 2k samples from CIFAR10), except for those that use the regular representation capsule (Appendix C), which outperforms standard CNNs (26.75% error). This is not too surprising, because many capsules are quite restrictive in the spatial patterns they can express. The strong performance of regular capsules is consistent with the results of Cohen & Welling (2016) , and can be explained by the fact that the regular representation contains all other (irreducible and quotient) representations as subrepresentations, and can therefore learn arbitrary spatial patterns.

We then created networks that use a mix of the more successful kinds of capsules. After a few preliminary experiments, we settled on a residual network that uses one mix of capsules for the input and output layer of a residual block, and another for the intermediate layer. When tested on CIFAR10 with 4k labels (table 2), the method comes close to the state of the art in semi-supervised methods, that use additional unlabelled data (Rasmus et al., 2015) , and better than transfer learning approaches such as DCGAN which achieves 26.2% error (Radford et al., 2015) . When tested on the full CIFAR10 and CIFAR100 dataset, the steerable CNN substantially outperforms the ResNet (He et al., 2016b) baseline and achieves state of the art results (improving over wide and dense nets (Zagoruyko & Komodakis, 2016; Huang et al., 2016) ).

5. CONCLUSION & FUTURE WORK:

We have presented a theoretical framework for understanding steerable representations in convolutional networks, and have shown that steerability is a useful inductive bias that can improve model accuracy, particularly when little data is available. Our experiments show that a simple steerable architecture achieves state of the art results on CIFAR10 and CIFAR100, outperforming recent architectures such as wide and dense residual networks.

The mathematical connection between representation learning and representation theory that we have established improves our understanding of the inner workings of (equivariant) convolutional networks, revealing the humble CNN as an elegant geometrical computation engine. We expect that this new tool (representation theory), developed over more than a century by mathematicians and physicists, will greatly benefit future investigations in this area.

For concreteness, we have used the group of flips and rotations by multiples of 90 degrees as a running example throughout this paper. This group already has some nontrivial characteristics (such as non-commutativity), but it is still small and discrete. The theory of steerable CNNs, however, readily extends to the continuous setting. Evaluating steerable CNNs for large, continuous and high-dimensional groups is an important piece of future work.

Another direction for future work is learning the feature types, which may be easier in the continuous setting because (for non-compact groups) the irreps live in a continuous space where optimization may be possible. Beyond classification, steerable CNNs are likely to be useful in geometrical tasks such as action recognition, pose and motion estimation, and continuous control tasks. 

APPENDIX A: INDUCTION:

In this section we will show that a stack of feature maps produced by convolution with an Hequivariant filter bank transforms according to the induced representation. That is, we will derive eq. 5, repeated here for convenience:

EQUATION

In the main text, we mentioned that x ∈ Z 2 can be interpreted as a point or as a translation. Here we make this difference explicit, by writing x ∈ Z 2 for a point and x ∈ G for a translation. (The operation • defines a section of the projection map G → Z 2 that forgets the non-translational part of the transformation (Kaniuth & Taylor, 2013) ).

With this notation, the convolution is defined as:

EQUATION

Although the induced representation can be described in a more general setting, we will use an explicit matrix representation of G to make it easier to check our computations. A general element of G is written as:

EQUATION

)

Where R is the matrix representation of r (e.g. a 2 × 2 rotation / reflection matrix), and T is a translation vector. The section we use is:

x = I x 0 1 (17)

Finally, we will distinguish the action of G on itself, written gh for g, h ∈ G (implemented as matrix-matrix multiplication) and its action on Z 2 , written g • x for g ∈ G and x ∈ Z 2 (implemented as matrix-vector multiplication by adding a homogeneous coordinate to x).

To keep notation uncluttered, we will write π = π l and ρ = ρ l+1 . In full detail, the derivation of the transformation law for the feature space induced by ρ proceeds as follows:

[Ψ [π(tr)f ]] (x) = Ψπ(x -1 )π(tr)f = Ψπ(x -1 tr)f = Ψπ(rr -1 x-1 tr)f = Ψπ(r)π(r -1 x-1 tr)f = ρ(r)Ψπ(r -1 x-1 tr)f = ρ(r)Ψπ((r -1 t -1 xr) -1 )f = ρ(r)Ψπ (tr) -1 • x)

EQUATION

The last line is the result shown in the paper. The justification of each step is:

1. Definition of 2. π is a homomorphism / group representation

:

as a semi-direct product

Figures and Tables:

(a) The feature space F is decomposed into a stack of feature maps (left) and a bundle of fibers (right).(b) An image f ∈ F0 is rotated by r using π0(r).

Figure 1: Feature maps, fibers, and the transformation law π 0 of F 0 .

Figure 4: The representation π 1 induced from the permutation representation ρ 1 shown in fig. 3. A single fiber is highlighted. It is transported to a new location, and acted on by ρ 1 .

The first representation

Table content: <table><tr><td>Net</td><td>Depth</td><td>Width</td><td colspan="4">#Params #Labels Dataset Test error</td></tr><tr><td>Ladder</td><td>10</td><td>96</td><td/><td>4k</td><td>C10ss</td><td>20.4</td></tr><tr><td>steer</td><td>14</td><td>(280, 112)</td><td>4.4M</td><td>4k</td><td>C10</td><td>23.66</td></tr><tr><td>steer</td><td>20</td><td>(160, 64)</td><td>2.2M</td><td>4k</td><td>C10</td><td>24.56</td></tr><tr><td>steer</td><td>14</td><td>(280, 112)</td><td>4.4M</td><td>4k</td><td>C10+</td><td>16.44</td></tr><tr><td>steer</td><td>20</td><td>(160, 64)</td><td>2.2M</td><td>4k</td><td>C10+</td><td>16.42</td></tr><tr><td>ResNet</td><td>1001</td><td>16</td><td>10.2M</td><td>50k</td><td>C10+</td><td>4.62</td></tr><tr><td>Wide</td><td>28</td><td>160</td><td>36.5M</td><td>50k</td><td>C10+</td><td>4.17</td></tr><tr><td>Dense</td><td>100</td><td>2400</td><td>27.2M</td><td>50k</td><td>C10+</td><td>3.74</td></tr><tr><td>steer</td><td>26</td><td>(280, 112)</td><td>9.1M</td><td>50k</td><td>C10+</td><td>3.74</td></tr><tr><td>steer</td><td>20</td><td>(440, 176)</td><td>16.7M</td><td>50k</td><td>C10+</td><td>3.95</td></tr><tr><td>steer</td><td>14</td><td>(400, 160)</td><td>9.1M</td><td>50k</td><td>C10+</td><td>3.65</td></tr><tr><td>ResNet</td><td>1001</td><td>16</td><td>10.2M</td><td>50k</td><td colspan="2">C100+ 22.71</td></tr><tr><td>Wide</td><td>28</td><td>160</td><td>36.5M</td><td>50k</td><td colspan="2">C100+ 20.50</td></tr><tr><td>Dense</td><td>100</td><td>2400</td><td>27.2M</td><td>50k</td><td colspan="2">C100+ 19.25</td></tr><tr><td>steer</td><td>20</td><td>(280, 112)</td><td>6.9M</td><td>50k</td><td colspan="2">C100+ 19.84</td></tr><tr><td>steer</td><td>14</td><td>(400, 160)</td><td>9.1M</td><td>50k</td><td colspan="2">C100+ 18.82</td></tr></table>

Comparison of results of steerable CNNs vs. previous state of the art methods. A plus (+) indicates modest data augmentation (shifts and flips). Width for steerable CNNs is reported as a pair of numbers, one for the input / output layer of a ResNet block, and one for the intermediate layer.

Table content: <table/>

S. Tokui, K. Oono, S. Hido, and J. Clayton. Chainer: a Next-Generation Open Source Framework for Deep Learning. Proceedings of Workshop on Machine Learning Systems (LearningSys) in The Twenty-ninth Annual Conference on Neural Information Processing Systems (NIPS), pp. 1-6, 2015. H. Weyl. The classical groups: their invariants and representations. Princeton University Press, 1939. S. Zagoruyko and N. Komodakis. Wide Residual Networks. arXiv:1605.07146, 2016.

Table content: <table/>

Peer review (iclr2017):
This paper presents a theoretical treatment of transformation groups applied to convnets, and presents some empirical results showing more efficient usage of network parameters. The basic idea of steerability makes huge sense and seems like a very important idea to develop. It is also a very old idea in image processing and goes back to Simoncelli, Freeman, Adelson, as well as Perona/Greenspan and others in the early 1990s. This paper approaches it through a formal treatment of group theory. But at the end of the day the idea seems pretty simple - the feature representation of a transformed image should be equivalent to a transformed feature representation of the original image. Given that the authors are limiting their analysis to discrete groups - for example rotations of 0, 90, 180, and 270 deg. - the formalities brought in from the group theoretic analysis seem a bit overkill. I*m not sure what this buys us in the end. it seems the real challenge lies in implementing continuous transformations, so if the theory could guide us in that direction it would be immensely helpful. Also the description of the experiments is fairly opaque. I would have a hard time replicating what exactly the authors did here in terms of implementing capsules or transformation groups.