1 Introduction
In recent years, sequencetosequence recurrent neural networks (RNNs) with long shortterm memory (LSTM) cells
(Hochreiter and Schmidhuber, 1997)have proven successful at many natural language processing (NLP) tasks, including machine translation
(Sutskever et al., 2014; Bahdanau et al., 2014; Cho et al., 2014b). In fact, the results they yielded have been so good that the gap between human translations and machine translations has narrowed significantly Wu et al. (2016) and LSTMbased recurrent neural networks have become standard in natural language processing. Even more recently, autoregressive convolutional models have proven highly effective when applied to audio (van den Oord et al., 2016a), image (van den Oord et al., 2016b)and text generation
(Kalchbrenner et al., 2016). Their success on sequence data in particular rivals or surpasses that of previous recurrent models (Kalchbrenner et al., 2016; Gehring et al., 2017). Convolutions provide the means for efficient nonlocal referencing across time without the need for the fully sequential processing of RNNs. However, a major critique of such models is their computational complexity and large parameter count. These are the principal concerns addressed within this work: inspired by the efficiency of depthwise separable convolutions demonstrated in the domain of vision, in particular the Xception architecture (Chollet, 2016) and MobileNets (Howard et al., 2017), we generalize these techniques and apply them to the language domain, with great success.2 Our contribution
We present a new convolutional sequencetosequence architecture, dubbed SliceNet, and apply it to machine translation tasks, achieving stateoftheart results. Our architecture features two key ideas:

Inspired by the Xception network Chollet (2016)
, our model is a stack of depthwise separable convolution layers with residual connections. Such an architecture has been previously shown to perform well for image classification. We also experimented with using grouped convolutions (or "subseparable convolutions") and add even more separation with our new superseparable convolutions.

We do away with filter dilation in our architecture, after exploring the tradeoff between filter dilation and larger convolution windows. Filter dilation was previously a key component of successful 1D convolutional architectures for sequencetosequence tasks, such as ByteNet (Kalchbrenner et al., 2016) and WaveNet (van den Oord et al., 2016a), but we obtain better results without dilation thanks to separability.
2.1 Separable convolutions and grouped convolutions
The depthwise separable convolution operation can be understood as related to both grouped convolutions and the "inception modules" used by the Inception family of convolutional network architectures, a connection explored in Xception
(Chollet, 2016). It consists of a depthwise convolution, i.e. a spatial convolution performed independently over every channel of an input, followed by a pointwise convolution, i.e. a regular convolution with 1x1 windows, projecting the channels computed by the depthwise convolution onto a new channel space. The depthwise separable convolution operation should not be confused with spatially separable convolutions, which are also often called “separable convolutions” in the image processing community. Their mathematical formulation is as follow (we use to denote the elementwise product):Thus, the fundamental idea behind depthwise separable convolutions is to replace the feature learning operated by regular convolutions over a joint "spacecrosschannels realm" into two simpler steps, a spatial feature learning step, and a channel combination step. This is a powerful simplification under the oftverified assumption that the 2D or 3D inputs that convolutions operate on will feature both fairly independent channels and highly correlated spatial locations. A deep neural network forms a chain of differentiable feature learning modules, structured as a discrete set of units, each trained to learn a particular feature. These units are subsequently composed and combined, gradually learning higher and higher levels of feature abstraction with increasing depth. Of significance is the availability of dedicated feature pathways that are merged together later in the network; this is one property enabled by depthwise separable convolutions, which define independent feature pathways that are later merged. In contrast, regular convolutional layers break this creed by learning filters that must simultaneously perform the extraction of spatial features and their merger into channel dimensions; an inefficient and ineffective use of parameters. Grouped convolutions (or "subseparable convolutions") are an intermediary step between regular convolutions and depthwise separable convolutions. They consist in splitting the channels of an input into several nonoverlapping segments (or "groups"), performing a regular spatial convolution over each segment independently, then concatenating the resulting feature maps along the channel axis. Depthwise separable convolutions have been previously shown in Xception (Chollet, 2016) to allow for image classification models that outperform similar architectures with the same number of parameters, by making more efficient use of the parameters available for representation learning. In MobileNets (Howard et al., 2017), depthwise separable convolutions allowed to create very small image classification models (e.g. 4.2M parameters for 1.0 MobileNet224) that retained much of the capabilities of architectures that are far larger (e.g. 138M parameters for VGG16), again, by making more efficient use of parameters. The theoretical justifications for replacing regular convolution with depthwise separable convolution, as well as the strong gains achieved in practice by such architectures, are a significant motivation for applying them to 1D sequencetosequence models. The key gains from separability can be seen when comparing the number of parameters (which in this case corresponds to the computational cost too) of separable convolutions, group convolutions, and regular convolutions. Assume we have channels and filters (often or more) and a receptive field of size (often but we will use upto ). The number of parameters for a regular convolution, separable convolution, and group convolution with groups is:
2.2 Superseparable convolutions
As can be seen above, the size (and cost) of a separable convolution with channels and a receptive field of size is . When is small compared to (as is usuallty the case) the term dominates, which raises the question how it could be reduced. We use the idea from group convolutions and the recent separableLSTM paper Kuchaiev and Ginsburg (2017) to further reduce this size by factoring the final convolution, and we call the result a superseparable convolution. We define a superseparable convolution (noted ) with
groups as follows. Applied to a tensor
, we first split on the depth dimension into groups, then apply a separable convolution to each group separately, and then concatenate the results on the depth dimension.where is split on the depth axis and for are the parameters of each separable convolution. Since each is of size and each is of size , the final size of a superseparable convolution is . Parameter counts (or computational budget per position) for all convolution types are summarized in Table 1.
Convolution type  Parameters and approximate floating point operations per position 

Nonseparable  
Fullyseparable  
Subseparable  
Superseparable 
Note that a superseparable convolution doesn’t allow channels in separate groups to exchange information. To avoid making a bottleneck of this kind, we use stack superseparable convolutions in layer with coprime . In particular, in our experiments we always alternate and .
2.3 Filter dilation and convolution window size
Filter dilation, as introduced in Yu and Koltun (2015), is a technique for aggregating multiscale information across considerably larger receptive fields in convolution operations, while avoiding an explosion in parameter count for the convolution kernels. It has been presented in Kalchbrenner et al. (2016) and van den Oord et al. (2016a) as a key component of convolutional sequencetosequence autoregressive architectures. When dilated convolution layers are stacked such that consecutive layers’ dilation values have common divisors, an issue similar to the checkerboard artifacts in deconvolutions (Odena et al., 2016) appears. Uneven filter coverage results in dead zones where filter coverage is reduced (as displayed in the plaidlike appearance of Figure 1 in (Yu and Koltun, 2015)). Choosing dilation factors that are coprime can indeed offer some relief from these artifacts, however, it would be preferable to do away with the necessity for dilation entirely. The purpose of filter dilation is to increase the receptive field of the convolution operation, i.e. the spatial extent from which feature information can be gathered, at a reasonable computational cost. A similar effect would be achieved by simply using larger convolution windows. Besides, the use of larger windows would avoid an important shortcoming of filter dilation, unequal convolutional coverage of the input space. Notably, the use of depthwise separable convolutions in our network in place of regular convolutions makes each convolution operation significantly cheaper (we are able to cut the number of nonembedding model parameters by half), thus lifting the computational and memory limitations that guided the development of filter dilation in the first place. In our experiments, we explore the tradeoff between using lower dilation rates and increasing the size of the convolution windows for our depthwise separable convolution layers. In contrast to the conclusions drawn in WaveNet and ByteNet, we find that the computational savings brought on by depthwise separable convolutions allow us to do away with dilation entirely. In fact, we observe no benefits of dilations: our best models feature larger filters and no dilation (see Table 2). A comparison of the parameter count for different convolution operations is found in Table 1.
3 SliceNet architecture
Here we present the model we use for our experiments, called SliceNet in reference to the way separable convolutions operate on channelwise slices of their inputs. Our model follows the convolutional autoregressive structure introduced by ByteNet (Kalchbrenner et al., 2016), WaveNet (van den Oord et al., 2016a) and PixelCNN (van den Oord et al., 2016b). Inputs and outputs are embedded into the same feature depth, encoded by two separate subnetworks and concatenated before being fed into a decoder that autoregressively generates each element of the output. At each step, the autoregressive decoder produces a new output prediction given the encoded inputs and the encoding of the existing predicted outputs. The encoders and the decoder (described in Section 3.3) are constructed from stacks of convolutional modules (described in Section 3.1) and attention (described in Section 3.2) is used to allow the decoder to get information from the encoder.
3.1 Convolutional modules
To perform local computation, we use modules of convolutions with ReLU nonlinearities and layer normalization. A module of convolutions gets as input a tensor of shape [sequence length, feature channels] and returns a tensor of the same shape. Each step in our module consist of three components: a
activation of the inputs, followed by a depthwise separable convolution , followed by layer normalization. Layer normalization (Ba et al., 2016) acts over the hidden units of the layer below, computing layerwise statistics and normalizing accordingly. These normalized units are then scaled and shifted by scalar learned parameters and respectively, producing the final units to be activated by a nonlinearity:where the sum are taken only over the last (depth) dimension of , and and are learned scalars. A complete convolution step is therefore defined as:
The convolutional steps are composed into modules by stacking them and adding residual connections as depicted in Figure 1. We use stacks of four convolutional steps with two skipconnections between the stack input and the outputs of the second and fourth convolutional steps:
ConvModules are used in stacks in our module, the output of the last feeding into the next. We denote a stack with modules by
3.2 Attention modules
For attention, we use a simple innerproduct attention that takes as input two tensors: of shape and of shape
. The attention mechanism computes the feature vector similarities at each position and rescales according to the depth:
To allow the attention to access positional information, we add a signal that carries it. We call this signal the timing, it is a tensor of any shape defined by concatenating sine and cosine functions of different frequencies calculated upto :
Our full attention mechanism consists of adding the timing signal to the targets, performing two convolutional steps, and then attending to the source:
3.3 Autoregressive structure
As previously discussed, the outputs of our model are generated in an autoregressive manner. Unlike RNNs, autoregressive sequence generation depends not only on the previously generated output, but potentially all previously generated outputs. This notion of long term dependencies has proven highly effect in NMT before. By using attention, establishing long term dependencies has been shown to significantly boost task performance of RNNs for NMT Cho et al. (2014a). Similarly, a convolutional autoregressive generation scheme offer large receptive fields over the inputs and past outputs, capable of establishing these long term dependencies. Below we detail the structure of the InputEncoder, IOMixer and Decoder. The OutputEmbedding simply performs a learningembedding lookup. We denote the concatenation of tensors and along the dimension as .
4 Related Work
Machine translation using deep neural networks achieved great success with sequencetosequence models Sutskever et al. (2014); Bahdanau et al. (2014); Cho et al. (2014b) that used recurrent neural networks (RNNs) with long shortterm memory (LSTM, Hochreiter and Schmidhuber (1997)) cells. The basic sequencetosequence architecture is composed of an RNN encoder which reads the source sentence one token at a time and transforms it into a fixedsized state vector. This is followed by an RNN decoder, which generates the target sentence, one token at a time, from the state vector. While a pure sequencetosequence recurrent neural network can already obtain good translation results Sutskever et al. (2014); Cho et al. (2014b), it suffers from the fact that the whole input sentence needs to be encoded into a single fixedsize vector. This clearly manifests itself in the degradation of translation quality on longer sentences and was overcome in Bahdanau et al. (2014) by using a neural model of attention. We use a simplified version of this neural attention mechanism in SliceNet, as introduced above. Convolutional architectures have been used to obtain good results in wordlevel neural machine translation starting from Kalchbrenner and Blunsom (2013) and later in Meng et al. (2015). These early models used a standard RNN on top of the convolution to generate the output. The state of this RNN has a fixed size, and in the first one the sentence representation generated by the convolutional network is also a fixedsize vector, which creates a bottleneck and hurts performance, especially on longer sentences, similarly to the limitations of RNN sequencetosequence models without attention Sutskever et al. (2014); Cho et al. (2014b) discussed above. Fully convolutional neural machine translation without this bottleneck was first achieved in Łukasz Kaiser (2016) and Kalchbrenner et al. (2016). The model in Łukasz Kaiser (2016) (Extended Neural GPU) used a recurrent stack of gated convolutional layers, while the model in Kalchbrenner et al. (2016)
(ByteNet) did away with recursion and used leftpadded convolutions in the decoder. This idea, introduced in WaveNet
van den Oord et al. (2016a), significantly improves efficiency of the model. The same technique is used in SliceNet as well, and it has been used in a number of neural translation models recently, most notably in Gehring et al. (2017) where it is combined with an attention mechanism in a way similar to SliceNet. Depthwise separable convolutions were first studied by Sifre Sifre and Mallat (2013) during a 2013 internship at Google Brain, and were first introduced in an ICLR 2014 presentation Vanhoucke (2014). In 2016, they were demonstrated to yield strong results on largescale image classification in Xception Chollet (2016), and in 2017 they were shown to lead to small and parameterefficient image classification models in MobileNets Howard et al. (2017).5 Experiments
We design our experiments with the goal to answer two key questions:

What is the performance impact of replacing convolutions in a ByteNetlike model with depthwise separable convolutions?

What is the performance tradeoff of reducing dilation while correspondingly increasing convolution window size?
In addition, we make two auxiliary experiments:

One experiment to test the performance of an intermediate separability point inbetween regular convolutions and full depthwise separability: we replace depthwise separable convolutions with grouped convolutions (subseparable convolutions) with groups of size 16.

One experiment to test the performance impact of our newlyintroduced superseparable convolutions compared to depthwise separable convolutions.
Dilations  Filter Size  Separability  Parameters (NonEmb.)  Neg. Log  Accuracy 
1248  3333  None  314 M (230 M)  1.92  62.41 
1248  3333  Full  196 M (112 M)  1.83  63.87 
1124  3777  Full  197 M (113 M)  1.80  64.37 
1112  371515  Full  197 M (113 M)  1.80  64.30 
1111  371531  Full  197 M (113 M)  1.80  64.36 
1248  3333  16 Groups  207 M (123 M)  1.86  63.46 
1111  371531  Super 2/3  253 M (141 M)  1.78  64.71 
1111  37153163  Full (2048)  349 M (265 M)  1.68  66.71 
1111  371531  Super 2/3 (3072)  348 M (222 M)  1.64  67.27 
We evaluate all models on the WMT English to German translation task and use newstest2013 evaluation set for this purpose. For two best large models, we also provide results on the standard test set, newstest2014, to compare with other works. For tokenization, we use subword units, and follow the same tokenization process as Sennrich Sennrich et al. (2015)
. All of our experiments are implemented using the TensorFlow framework
Abadi et al. (2015). A comparison of our different models in terms of parameter count and Negative Log Perplexity as well as pertoken Accuracy on our task are provided in Table 2. The parameter count (and computation cost) of the different types of convolution operations used was already presented in Table 1. Our experimental results allow us to draw the following conclusions:
Depthwise separable convolutions are strictly superior to regular convolutions in a ByteNetlike architecture, resulting in models that are more accurate while requiring fewer parameters and being computationally cheaper to train and run.

Using subseparable convolutions with groups of size 16 instead of full depthwise separable convolutions results in a performance dip, which may indicate that higher separability (i.e. groups as small as possible, tending to full depthwise separable convolutions) is preferable in this setup, this further confirming the advantages of depthwise separable convolutions.

The need for dilation can be completely removed by using correspondingly larger convolution windows, which is made computationally tractable by the use of depthwise separable convolutions.

The newlyintroduced superseparable convolution operation seems to offer an incremental performance improvement.
Finally, we run two larger models with a design based on the conclusions drawn from our first round of experiments: a SliceNet model which uses depthwise separable convolutions and a SliceNet model which uses superseparable convolutions, with significantly higher feature depth in both cases. We achieve stateoftheart results, as shown in Table 3, where we also include previously reported results for comparison. For getting the BLEU, we used a beamsearch decoder with a beam size of and a length penalty tuned on the evaluation set (newstest2013).
Model  BLEU (newstest14) 

SliceNet (Full, 2048)  25.5 
SliceNet (Super 2/3, 3072)  26.1 
ByteNet Kalchbrenner et al. (2016)  23.8 
GNMT Wu et al. (2016)  24.6 
ConvS2S Gehring et al. (2017)  25.1 
GNMT+Mixture of Experts Shazeer et al. (2017)  26.0 
5.1 Conclusions
In this work, we introduced a new convolutional architecture for sequencetosequence tasks, called SliceNet, based on the use of depthwise separable convolutions. We showed how this architecture achieves results beating not only ByteNet but also the previous stateoftheart, while using over two times less (nonembedding) parameters and floating point operations than the ByteNet architecture. Additionally, we have shown that filter dilation, previously thought to be a key component of successful convolutional sequencetosequence architectures, was not a requirement. The use of depthwise separable convolutions makes much larger convolution window sizes possible, and we found that we could achieve the best results by using larger windows instead of dilated filters. We have also introduced a new type of depthwise separable convolution, the superseparable convolution, which shows incremental performance improvements over depthwise separable convolutions. Our work is one more point on a significant trendline started with Xception and MobileNets, that indicates that in any convolutional model, whether for 1D or 2D data, it is possible to replace convolutions with depthwise separable convolutions and obtain a model that is simultaneously cheaper to run, smaller, and performs a few percentage points better. This trend is backed by both solid theoretical foundations and strong experimental results. We expect our current work to play a significant role in affirming and accelerating this trend, and we hope to see depthwise separable convolutions replace regular convolutions for an increasing number of use cases in the future.
References

Abadi et al. (2015)
Martín Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig
Citro, Greg Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay
Ghemawat, Ian Goodfellow, Andrew Harp, Geoffrey Irving, Michael Isard,
Yangqing Jia, Rafal Jozefowicz, Lukasz Kaiser, Manjunath Kudlur, Josh
Levenberg, Dan Mané, Rajat Monga, Sherry Moore, Derek Murray, Chris Olah,
Mike Schuster, Jonathon Shlens, Benoit Steiner, Ilya Sutskever, Kunal Talwar,
Paul Tucker, Vincent Vanhoucke, Vijay Vasudevan, Fernanda Viégas, Oriol
Vinyals, Pete Warden, Martin Wattenberg, Martin Wicke, Yuan Yu, and Xiaoqiang
Zheng.
Tensorflow: Largescale machine learning on heterogeneous distributed systems, 2015.
URL http://download.tensorflow.org/paper/whitepaper2015.pdf.  Ba et al. (2016) Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint arXiv:1607.06450, 2016.
 Bahdanau et al. (2014) Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly learning to align and translate. CoRR, abs/1409.0473, 2014. URL http://arxiv.org/abs/1409.0473.
 Cho et al. (2014a) K. Cho, B. van Merrienboer, D. Bahdanau, and Y. Bengio. On the properties of neural machine translation: Encoderdecoder approaches. CoRR, abs/1409.1259, 2014a.
 Cho et al. (2014b) Kyunghyun Cho, Bart van Merrienboer, Caglar Gulcehre, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. Learning phrase representations using rnn encoderdecoder for statistical machine translation. CoRR, abs/1406.1078, 2014b. URL http://arxiv.org/abs/1406.1078.
 Chollet (2016) François Chollet. Xception: Deep learning with depthwise separable convolutions. arXiv preprint arXiv:1610.02357, 2016.
 Gehring et al. (2017) Jonas Gehring, Michael Auli, David Grangier, Denis Yarats, and Yann N Dauphin. Convolutional sequence to sequence learning. arXiv preprint arXiv:1705.03122, 2017.
 Hochreiter and Schmidhuber (1997) Sepp Hochreiter and Jürgen Schmidhuber. Long shortterm memory. Neural computation, 9(8):1735–1780, 1997.
 Howard et al. (2017) Andrew G Howard, Menglong Zhu, Bo Chen, Dmitry Kalenichenko, Weijun Wang, Tobias Weyand, Marco Andreetto, and Hartwig Adam. Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861, 2017.
 Kalchbrenner and Blunsom (2013) Nal Kalchbrenner and Phil Blunsom. Recurrent continuous translation models. In Proceedings EMNLP 2013, pages 1700–1709, 2013. URL http://nal.co/papers/KalchbrennerBlunsom_EMNLP13.
 Kalchbrenner et al. (2016) Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Koray Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099, 2016.
 Kuchaiev and Ginsburg (2017) Oleksii Kuchaiev and Boris Ginsburg. Factorization tricks for LSTM networks. CoRR, abs/1703.10722, 2017. URL http://arxiv.org/abs/1703.10722.
 Łukasz Kaiser (2016) Samy Bengio Łukasz Kaiser. Can active memory replace attention? In Advances in Neural Information Processing Systems, (NIPS), 2016.

Meng et al. (2015)
Fandong Meng, Zhengdong Lu, Mingxuan Wang, Hang Li, Wenbin Jiang, and Qun Liu.
Encoding source language with convolutional neural network for machine translation.
In ACL, pages 20–30, 2015.  Odena et al. (2016) Augustus Odena, Vincent Dumoulin, and Chris Olah. Deconvolution and checkerboard artifacts. Distill, 1(10):e3, 2016.
 Sennrich et al. (2015) Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words with subword units. CoRR, 2015.
 Shazeer et al. (2017) Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Le, Geoffrey Hinton, and Jeff Dean. Outrageously large neural networks: The sparselygated mixtureofexperts layer. arXiv preprint arXiv:1701.06538, 2017.

Sifre and Mallat (2013)
Laurent Sifre and Stéphane Mallat.
Rotation, scaling and deformation invariant scattering for texture
discrimination.
In
2013 IEEE Conference on Computer Vision and Pattern Recognition, Portland, OR, USA, June 2328, 2013
, pages 1233–1240, 2013.  Sutskever et al. (2014) Ilya Sutskever, Oriol Vinyals, and Quoc VV Le. Sequence to sequence learning with neural networks. In Advances in Neural Information Processing Systems, pages 3104–3112, 2014. URL http://arxiv.org/abs/1409.3215.
 van den Oord et al. (2016a) Aäron van den Oord, Sander Dieleman, Heiga Zen, Karen Simonyan, Oriol Vinyals, Alex Graves, Nal Kalchbrenner, Andrew Senior, and Koray Kavukcuoglu. Wavenet: A generative model for raw audio. CoRR abs/1609.03499, 2016a.
 van den Oord et al. (2016b) Aaron van den Oord, Nal Kalchbrenner, Lasse Espeholt, Oriol Vinyals, Alex Graves, et al. Conditional image generation with pixelcnn decoders. In Advances in Neural Information Processing Systems, pages 4790–4798, 2016b.
 Vanhoucke (2014) Vincent Vanhoucke. Learning visual representations at scale. ICLR, 2014.
 Wu et al. (2016) Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V. Le, Mohammad Norouzi, Wolfgang Macherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, Jeff Klingner, Apurva Shah, Melvin Johnson, Xiaobing Liu, Lukasz Kaiser, Stephan Gouws, Yoshikiyo Kato, Taku Kudo, Hideto Kazawa, Keith Stevens, George Kurian, Nishant Patil, Wei Wang, Cliff Young, Jason Smith, Jason Riesa, Alex Rudnick, Oriol Vinyals, Greg Corrado, Macduff Hughes, and Jeffrey Dean. Google’s neural machine translation system: Bridging the gap between human and machine translation. CoRR, abs/1609.08144, 2016. URL http://arxiv.org/abs/1609.08144.
 Yu and Koltun (2015) Fisher Yu and Vladlen Koltun. Multiscale context aggregation by dilated convolutions. arXiv preprint arXiv:1511.07122, 2015.
Comments
There are no comments yet.