user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: Geometry of Deep Convolutional Networks

Paper content:
We give a formal procedure for computing preimages of convolutional
  network outputs using the dual basis defined from the set of
  hyperplanes associated with the layers of the network.
We point out
  the special symmetry associated with arrangements of hyperplanes of
  convolutional networks that take the form of regular
  multidimensional polyhedral cones.
We discuss  the efficiency of of
  large number of layers of nested cones that result from incremental
  small size convolutions in order to give a good compromise between
  efficient contraction of data to low dimensions and shaping of
  preimage manifolds.
We demonstrate how a specific network flattens a
  non linear input manifold to an affine output manifold and discuss
  it's relevance to understanding classification properties of deep
  networks.
Deep convolutional networks for classification map input data domains to output domains that ideally correspond to various classes.
The ability of deep networks to construct various mappings has been the subject of several studies over the years (1; 3; 10) and in general resulted in various estimates of capacity given a network structure.
The actual mappings that are learnt by training a specific network however, often raise a set of questions such as why are increasingly deeper networks advantageous (13; 14) ?
What are the mechanisms responsible for the successful generalisation properties of deep networks ?
Also the basic question why deep learning over large datasets is so much more effective than earlier machine learning approaches is still essentially open, BID6 .
These questions are not in general answered by studies of capacity.
A more direct approach based on actual trained networks and the mappings they are efficiently able to produce seems needed in order to answer these questions.
It seems ever more likely e.g that the ability of deep networks to generalize is connected with some sort of restriction of mappings that they theoretically can produce and that these mappings are ideally adapted to the problem for which deep learning has proven successful, Due to the complexity of deep networks the actual computation of how input domains are mapped to output classifiers has been considered prohibitively difficult.
From general considerations of networks with rectifier (ReLU) non linearities we know that these functions must be piecewise linear BID9 but the relation between network parameters such has convolutional filter weights and fully connected layer parameters and the actual functions remains largely obscure.
In general, work has therefore been concentrated on empirical studies of actual trained networks (6; 8; 9) Recently however there have been attempts to understand the relation between networks and their mapping properties from a more general and theoretical point of view.
This has included specific procedures for generating preimages of network outputs BID3 and more systematic studies of the nature of piecewise linear functions and mappings involved in deep networks, (2; 11; 15) .In
this work we will make the assertion that understanding the geometry of deep networks and the manifolds of data they process is an effective way to understand the comparative success of deep networks. We
will consider convolutional networks with ReLU non linearities. These
can be completely characterised by the corresponding hyperplanes associated with individual convolutional kernels . We will
demonstrate that the individual arrangement of hyperplanes inside a layer and the relative arrangement between layers is crucial to the understanding the success of various deep network structures and how they map data from input domains to output classifiers.We will consider only the convolutional part of a deep network with a single channel. We will
assume no subsampling or max pooling. This will
allow us to get a clear understanding of the role of the convolutional part. A more complete
analysis involving multiple channels and fully connected layers is possible but more complex and will be left to future work.The focus of our study is to analyse how domains of input data are mapped through a deep network. A complete understanding
of this mapping and its inverse or preimage will give a detailed description of the workings of the network. Since we are not considering
the final fully connected layers we will demonstrate how to compute in detail the structure of input data manifold that can be mapped to a specified reduced dimensionality affine manifold in the activity space of the final convolutional output layer. This flattening of input data
is often considered as a necessary preprocessing step for efficient classification.The understanding of mappings between layers will be based on the specific understanding of how to compute preimages for networks activities. We will recapitulate and extend
the work in (4) based on the construction of a dual basis from an arrangement of hyperplanes. By specialising to convolutional
networks we will demonstrate that the arrangement of hyperplanes associated with a specific layer can be effectively described by a regular multidimensional polyhedral cone oriented in the identity direction in the input space of the layer. Cones associated with successive
layers are then in general partly nested inside their predecessor. This leads to efficient contraction
and shaping of the input domain data manifold. In general however contraction and
shaping are in conflict in the sense that efficient contraction implies less efficient shaping. We will argue that this' conflict
is resolved by extending the number of layers of the network with small incremental updates of filters at each layer.The main contribution of the paper is the exploitation of the properties of nested cones in order to explain how non linear manifolds can be shaped and contracted in order to comply with the distribution of actual class manifolds and to enable efficient preprocessing for the final classifier stages of the network. We will specifically demonstrate
the capability of the convolutional part of the network to flatten non linear input manifolds which has previously been suggested as an important preprocessing step in object recognition, (5; 12)
We have defined a formal procedure for computing preimages of deep linear transformation networks with ReLU non linearities using the dual basis extracted from the set of hyperplanes representing the transformation.
Specialising to convolutional networks we demonstrate that the complexity and the symmetry of the arrangement of corresponding hyperplanes is substantially reduced and we show that these arrangements can be modelled closely with multidimensisional regular polyhedral cones around the identity line in input space.
We point out the crucial property of nested cones which guarantees efficient contraction of data to lower dimensions and argue that this property could be relevant in the design of real networks.
By increasing the number of layers to shape input manifolds in the form of preimages we can retain the nested cone property that most efficiently exploits network data in order to construct input manifolds that comply with manifolds corresponding to real classes and would explain the success of ever deeper networks for deep learning.
The retaining of the nested cone property can be expressed as a limitation of the degrees of freedom of multidimensional rotation of the cones.
Since convolutional networks essentially always have limited spatial support convolutions, this is to a high degree built in to existing systems.
The desire to retain the property of nesting could however act as an extra constraint to further reduce the complexity of the convolutions.
This of course means that the degrees of freedom are reduced for a network which could act as a regularization constraint and potentially explain the puzzling efficiency of generalisation of deep networks in spite of a high number of parameters.We demonstrate that it is in principle possible to compute non linear input manifolds that map to affine output manifolds.
This demonstrates the possibility of deep convolutional networks to achieve flattening of input data which is generally considered as an important preprocessing step for classification.
Since we do not consider a complete network with fully connected layers at the end we cannot give details how classification is achieved.
The explicit demonstration of non linear manifolds that map to affine outputs however indicates a possible basic structure of input manifolds for classes.
It is easy to see that a parallel translation of the affine output manifold would result in two linearly separable manifolds that would be generated by essentially parallel translated non linear manifolds in the input space.
This demonstrates that convolutional networks can be designed to exactly separate sufficiently "covariant " classes.
and that this could be the reason for the relative success of convolutional networks over previous machine learning approaches to classification and explain why using a large number of classes for training is advantageous since they all contribute to very similar individual manifolds.Disregarding these speculations the fact remains that these manifolds will always exist since they are derived on purely formal grounds from the structure of the network.
If they have no role in classification their presence will have to be explained in other ways.

assistant: text: Analysis of deep convolutional networks in terms of associated arrangement of hyperplanes