Original: T RELLIS N ETWORKS FOR S EQUENCE M ODELING
Revised: T RELLIS N ETWORKS FOR S EQUENCE M ODELING

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: We present trellis networks, a new architecture for sequence modeling.
Revised: We present trellis networks, a new architecture for sequence modeling.

Original: On the one hand, a trellis network is a temporal convolutional network with special structure, characterized by weight tying across depth and direct injection of the input into deep layers.
Revised: On the one hand, a trellis network is a temporal convolutional network with special structure, characterized by weight tying across depth and direct injection of the input into deep layers.

Original: On the other hand, we show that truncated recurrent networks are equivalent to trellis networks with special sparsity structure in their weight matrices.
Revised: On the other hand, we show that truncated recurrent networks are equivalent to trellis networks with special sparsity structure in their weight matrices.

Original: Thus trellis networks with general weight matrices generalize truncated recurrent networks.
Revised: Thus trellis networks with general weight matrices generalize truncated recurrent networks.

Original: We leverage these connections to design high-performing trellis networks that absorb structural and algorithmic elements from both recurrent and convolutional models.
Revised: We leverage these connections to design high-performing trellis networks that absorb structural and algorithmic elements from both recurrent and convolutional models.

Original: Experiments demonstrate that trellis networks outperform the current state of the art on a variety of challenging benchmarks, including word-level language modeling on Penn Treebank and WikiText-103, characterlevel language modeling on Penn Treebank, and stress tests designed to evaluate long-term memory retention.
Revised: Experiments demonstrate that trellis networks outperform the current state of the art on a variety of challenging benchmarks, including word-level language modeling on Penn Treebank and WikiText-103, characterlevel language modeling on Penn Treebank, and stress tests designed to evaluate long-term memory retention.

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: What is the best architecture for sequence modeling?
Revised: What is the best architecture for sequence modeling?

Original: Recent research has produced signiﬁcant progress on multiple fronts.
Revised: Recent research has produced signiﬁcant progress on multiple fronts.

Original: Recurrent networks, such as LSTMs, continue to be optimized and extended (Merity et al., 2018b; Melis et al., 2018;
Revised: Recurrent networks, such as LSTMs, continue to be optimized and extended (Merity et al., 2018b; Melis et al., 2018;

Original: Yang et al., 2018; Trinh et al., 2018).
Revised: Yang et al., 2018; Trinh et al., 2018).

Original: Temporal convolutional networks have demonstrated impressive performance, particularly in modeling longrange context (van den Oord et al., 2016; Dauphin et al., 2017; Bai et al., 2018).
Revised: Temporal convolutional networks have demonstrated impressive performance, particularly in modeling longrange context (van den Oord et al., 2016; Dauphin et al., 2017; Bai et al., 2018).

Original: And architectures based on self-attention are gaining ground (Vaswani et al., 2017; Santoro et al., 2018).
Revised: And architectures based on self-attention are gaining ground (Vaswani et al., 2017; Santoro et al., 2018).

Original: In this paper, we introduce a new architecture for sequence modeling, the Trellis Network.
Revised: In this paper, we introduce a new architecture for sequence modeling, the Trellis Network.

Original: We aim to both improve empirical performance on sequence modeling benchmarks and shed light on the relationship between two existing model families: recurrent and convolutional networks.
Revised: We aim to both improve empirical performance on sequence modeling benchmarks and shed light on the relationship between two existing model families: recurrent and convolutional networks.

Original: On the one hand, a trellis network is a special temporal convolutional network, distinguished by two unusual characteristics.
Revised: On the one hand, a trellis network is a special temporal convolutional network, distinguished by two unusual characteristics.

Original: First, the weights are tied across layers.
Revised: First, the weights are tied across layers.

Original: That is, weights are shared not only by all time steps but also by all network layers, tying them into a regular trellis pattern.
Revised: That is, weights are shared not only by all time steps but also by all network layers, tying them into a regular trellis pattern.

Original: Second, the input is injected into all network layers.
Revised: Second, the input is injected into all network layers.

Original: That is, the input at a given time-step is provided not only to the ﬁrst layer, but directly to all layers in the network.
Revised: That is, the input at a given time-step is provided not only to the ﬁrst layer, but directly to all layers in the network.

Original: So far, this may seem merely as a peculiar convolutional network for processing sequences, and not one that would be expected to perform particularly well.
Revised: So far, this may seem merely as a peculiar convolutional network for processing sequences, and not one that would be expected to perform particularly well.

Original: Yet on the other hand, we show that trellis networks generalize truncated recurrent networks (recurrent networks with bounded memory horizon).
Revised: Yet on the other hand, we show that trellis networks generalize truncated recurrent networks (recurrent networks with bounded memory horizon).

Original: The precise derivation of this connection is one of the key contributions of our work.
Revised: The precise derivation of this connection is one of the key contributions of our work.

Original: It allows trellis networks to serve as bridge between recurrent and convolutional architectures, beneﬁtting from algorithmic and architectural techniques developed in either context.
Revised: It allows trellis networks to serve as bridge between recurrent and convolutional architectures, beneﬁtting from algorithmic and architectural techniques developed in either context.

Original: We leverage these relationships to design high-performing trellis networks that absorb ideas from both architectural families.
Revised: We leverage these relationships to design high-performing trellis networks that absorb ideas from both architectural families.

Original: Beyond immediate empirical gains, these connections may serve as a step towards uniﬁcation in sequence modeling.
Revised: Beyond immediate empirical gains, these connections may serve as a step towards uniﬁcation in sequence modeling.

Original: We evaluate trellis networks on challenging benchmarks, including word-level language modeling on the standard Penn Treebank and the much larger WikiText-103 datasets; character-level language modeling on Penn Treebank; and standard stress tests designed to evaluate long-term memory retention.
Revised: We evaluate trellis networks on challenging benchmarks, including word-level language modeling on the standard Penn Treebank and the much larger WikiText-103 datasets; character-level language modeling on Penn Treebank; and standard stress tests designed to evaluate long-term memory retention.

Original: Trellis networks outperform state-of-the-art models across the board.
Revised: Trellis networks outperform state-of-the-art models across the board.

Original: On word-level Penn
Revised: On word-level Penn

Original: Treebank, a trellis network outperforms by more than a unit of perplexity the recent architecture search work of Pham et al.
Revised: Treebank, a trellis network outperforms by more than a unit of perplexity the recent architecture search work of Pham et al.

Original: (2018), as well as the recent results of Melis et al.
Revised: (2018), as well as the recent results of Melis et al.

Original: (2018), which leveraged the Google Vizier service for exhaustive hyperparameter search.
Revised: (2018), which leveraged the Google Vizier service for exhaustive hyperparameter search.

Original: On character-level Penn Tree- bank, a trellis network outperforms the thorough optimization work of Merity et al.
Revised: On character-level Penn Tree- bank, a trellis network outperforms the thorough optimization work of Merity et al.

Original: (2018a).
Revised: (2018a).

Original: On word-level WikiText-103, a trellis network outperforms by 4% in perplexity the contemporaneous self-attention-based Relational Memory Core (Santoro et al., 2018), and by 8% the work of Merity et al.
Revised: On word-level WikiText-103, a trellis network outperforms by 4% in perplexity the contemporaneous self-attention-based Relational Memory Core (Santoro et al., 2018), and by 8% the work of Merity et al.

Original: (2018a).
Revised: (2018a).

Original: On stress tests, trellis networks outperform recent state-of-the-art results achieved by recurrent networks and self-attention (Transformer) (Trinh et al., 2018).
Revised: On stress tests, trellis networks outperform recent state-of-the-art results achieved by recurrent networks and self-attention (Transformer) (Trinh et al., 2018).

Original: It is notable that the state of the art across these benchmarks was held by models with sometimes dramatic mutual differences.
Revised: It is notable that the state of the art across these benchmarks was held by models with sometimes dramatic mutual differences.

Original:  B ACKGROUND
Revised:  B ACKGROUND

Original: Recurrent networks (Elman, 1990; Werbos, 1990; Graves, 2012), particularly with gated cells such as LSTMs (Hochreiter & Schmidhuber, 1997) and GRUs (Cho et al., 2014), are perhaps the most popular architecture for modeling temporal sequences.
Revised: Recurrent networks (Elman, 1990; Werbos, 1990; Graves, 2012), particularly with gated cells such as LSTMs (Hochreiter & Schmidhuber, 1997) and GRUs (Cho et al., 2014), are perhaps the most popular architecture for modeling temporal sequences.

Original: Recurrent architectures have been used to achieve breakthrough results in natural language processing and other domains (Sutskever et al., 2011; Graves, 2013; Sutskever et al., 2014;
Revised: Recurrent architectures have been used to achieve breakthrough results in natural language processing and other domains (Sutskever et al., 2011; Graves, 2013; Sutskever et al., 2014;

Original: Bahdanau et al., 2015; Vinyals et al., 2015; Karpathy & Li, 2015).
Revised: Bahdanau et al., 2015; Vinyals et al., 2015; Karpathy & Li, 2015).

Original: Convolutional networks have also been widely used for sequence processing (Waibel et al., 1989; Collobert et al., 2011).
Revised: Convolutional networks have also been widely used for sequence processing (Waibel et al., 1989; Collobert et al., 2011).

Original: Recent work indicates that convolutional networks are effective on a variety of sequence modeling tasks, particularly ones that demand long-range information propagation (van den Oord et al., 2016; Kalchbrenner et al., 2016;
Revised: Recent work indicates that convolutional networks are effective on a variety of sequence modeling tasks, particularly ones that demand long-range information propagation (van den Oord et al., 2016; Kalchbrenner et al., 2016;

Original: Dauphin et al., 2017; Gehring et al., 2017; Bai et al., 2018).
Revised: Dauphin et al., 2017; Gehring et al., 2017; Bai et al., 2018).

Original: A third notable approach to sequence processing that has recently gained ground is based on self-attention (Vaswani et al., 2017; Santoro et al., 2018;
Revised: A third notable approach to sequence processing that has recently gained ground is based on self-attention (Vaswani et al., 2017; Santoro et al., 2018;

Original: Chen et al., 2018).
Revised: Chen et al., 2018).

Original: Our work is most closely related to the ﬁrst two approaches.
Revised: Our work is most closely related to the ﬁrst two approaches.

Original: In particular, we establish a strong connection between recurrent and convolutional networks and introduce a model that serves as a bridge between the two.
Revised: In particular, we establish a strong connection between recurrent and convolutional networks and introduce a model that serves as a bridge between the two.

Original: A related recent theoretical investigation showed that under a certain stability condition, recurrent networks can be well-approximated by feed-forward models (Miller &
Revised: A related recent theoretical investigation showed that under a certain stability condition, recurrent networks can be well-approximated by feed-forward models (Miller &

Original: Hardt, 2018).
Revised: Hardt, 2018).

Original: There have been many combinations of convolutional and recurrent networks (Sainath et al., 2015).
Revised: There have been many combinations of convolutional and recurrent networks (Sainath et al., 2015).

Original: For example, convolutional LSTMs combine convolutional and recurrent units (Donahue et al., 2015; Venugopalan et al., 2015; Shi et al., 2015).
Revised: For example, convolutional LSTMs combine convolutional and recurrent units (Donahue et al., 2015; Venugopalan et al., 2015; Shi et al., 2015).

Original: Quasi-recurrent neural networks interleave convolutional and recurrent layers (Bradbury et al., 2017).
Revised: Quasi-recurrent neural networks interleave convolutional and recurrent layers (Bradbury et al., 2017).

Original: Techniques introduced for convolutional networks, such as dilation, have been applied to RNNs (Chang et al., 2017).
Revised: Techniques introduced for convolutional networks, such as dilation, have been applied to RNNs (Chang et al., 2017).

Original: Our work establishes a deeper connection, deriving a direct mapping across the two architectural families and providing a structural bridge that can incorporate techniques from both sides.
Revised: Our work establishes a deeper connection, deriving a direct mapping across the two architectural families and providing a structural bridge that can incorporate techniques from both sides.

Original:  S EQUENCE M ODELING AND T RELLIS N ETWORKS
Revised:  S EQUENCE M ODELING AND T RELLIS N ETWORKS

Original: Sequence modeling.
Revised: Sequence modeling.

Original: Given an input x 1: T = x 1 , . . .
Revised: Given an input x 1: T = x 1 , . . .

Original: , x T , a sequence model is any function
Revised: , x T , a sequence model is any function

Original: G : X T → Y T such that
Revised: G : X T → Y T such that

Original: [Equation]
Revised: [Equation]

Original: where y t should only depend on x 1: t and not on x t +1:
Revised: where y t should only depend on x 1: t and not on x t +1:

Original: T (i.e. no leakage of information from the future).
Revised: T (i.e. no leakage of information from the future).

Original: This causality constraint is essential for autoregressive modeling.
Revised: This causality constraint is essential for autoregressive modeling.

Original: In this section, we describe a new architecture for sequence modeling, referred to as a trellis network or TrellisNet.
Revised: In this section, we describe a new architecture for sequence modeling, referred to as a trellis network or TrellisNet.

Original: In particular, we provide an atomic view of TrellisNet, present its fundamental features, and highlight the relationship to convolutional networks.
Revised: In particular, we provide an atomic view of TrellisNet, present its fundamental features, and highlight the relationship to convolutional networks.

Original: Section 4 will then elaborate on the relationship of trellis networks to convolutional and recurrent models.
Revised: Section 4 will then elaborate on the relationship of trellis networks to convolutional and recurrent models.

Original: Notation.
Revised: Notation.

Original: We use x 1: T = ( x 1 , . . .
Revised: We use x 1: T = ( x 1 , . . .

Original: , x T ) to denote a length- T input sequence, where vector x t ∈ R p is the input at time step t .
Revised: , x T ) to denote a length- T input sequence, where vector x t ∈ R p is the input at time step t .

Original: Thus x 1: T ∈ R T × p .
Revised: Thus x 1: T ∈ R T × p .

Original: We use z ( i ) t ∈
Revised: We use z ( i ) t ∈

Original: R q to represent the hidden unit at time t in layer i of the network.
Revised: R q to represent the hidden unit at time t in layer i of the network.

Original: We use Conv1D ( x ; W ) to denote a 1D convolution with a kernel
Revised: We use Conv1D ( x ; W ) to denote a 1D convolution with a kernel

Original: W applied to input x = x 1: T .
Revised: W applied to input x = x 1: T .

Original: A basic trellis network.
Revised: A basic trellis network.

Original: At the most basic level, a feature vector z ( i +1) t +1 at time step t + 

Revised: At the most basic level, a feature vector z ( i +1) t +1 at time step t +

Original: and level i + 1 of TrellisNet is computed via three steps, illustrated in Figure 1a:
Revised: and level i + 1 of TrellisNet is computed via three steps, illustrated in Figure 1a:

Original: The hidden input comprises the hidden outputs z ( i ) t , z ( i ) t +1 ∈ R q from the previous layer i , as well as an injection of the input vectors x t , x t +1 .
Revised: The hidden input comprises the hidden outputs z ( i ) t , z ( i ) t +1 ∈ R q from the previous layer i , as well as an injection of the input vectors x t , x t +1 .

Original: At level 0 , we initialize to z (0) t = 0 .
Revised: At level 0 , we initialize to z (0) t = 0 .

Original: [Table]
Revised: [Table]

Original: /latexit>
Revised: /latexit>

Original: [Table]
Revised: [Table]

Original: latexit> z
Revised: latexit> z

Original: ( i +1)8 <latexit
Revised: ( i +1)8 <latexit

Original: [Table]
Revised: [Table]

Original: +wRCa6H1DDpVC8gwIl76ea0ziQvBdM75d+b8a1EYl6wnnK/ZiOlYgEo2ilXpuGoVDjUbXm1t0VyDbxClKDAu1R9WsYJiyLuUImqTEDz03Rz6lGwSRfVIaZ4SllUzrmA0sVjbnx89W5C3JjlZBEibalkKzU3xM5jY2Zx4HtjClOzKa3FP/zBhlGTT8XKs2QK7ZeFGWSYEKWv5NQaM5Qzi2hTAt7K2ETqilDm1DFhuBtvrxNuo2659a9x0at1SziKMMVXMMteHAHLXiANnSAwRSe4RXenNR5cd6dj3VrySlmLuEPnM8fL5WPaw==</latexit> <latexit sha1_base64="oAHphkycPZbicq7JUsel5512G2E=">AAAB7nicbVBNS8NAEJ3Ur1q/qh69LBbBU0l6sceCF48V7Ae0oWw2m3bpZhN2J4US+iO8eFDEq7/Hm//GbZuDtj4YeLw3w8y8IJXCoOt+O6Wd3b39g/Jh5ej45PSsen7RNUmmGe+wRCa6H1DDpVC8gwIl76ea0ziQvBdM75d+
Revised: +wRCa6H1DDpVC8gwIl76ea0ziQvBdM75d+b8a1EYl6wnnK/ZiOlYgEo2ilXpuGoVDjUbXm1t0VyDbxClKDAu1R9WsYJiyLuUImqTEDz03Rz6lGwSRfVIaZ4SllUzrmA0sVjbnx89W5C3JjlZBEibalkKzU3xM5jY2Zx4HtjClOzKa3FP/zBhlGTT8XKs2QK7ZeFGWSYEKWv5NQaM5Qzi2hTAt7K2ETqilDm1DFhuBtvrxNuo2659a9x0at1SziKMMVXMMteHAHLXiANnSAwRSe4RXenNR5cd6dj3VrySlmLuEPnM8fL5WPaw==</latexit> <latexit sha1_base64="oAHphkycPZbicq7JUsel5512G2E=">AAAB7nicbVBNS8NAEJ3Ur1q/qh69LBbBU0l6sceCF48V7Ae0oWw2m3bpZhN2J4US+iO8eFDEq7/Hm//GbZuDtj4YeLw3w8y8IJXCoOt+O6Wd3b39g/Jh5ej45PSsen7RNUmmGe+wRCa6H1DDpVC8gwIl76ea0ziQvBdM75d+

Original: [Figure]
Revised: [Figure]

Original: A pre-activation output ˆ z ( i +1)
Revised: A pre-activation output ˆ z ( i +1)

Original: t +1 ∈ R r is produced by a feed-forward linear transformation:
Revised: t +1 ∈ R r is produced by a feed-forward linear transformation:

Original: [Equation]
Revised: [Equation]

Original: where W 1 , W 2 ∈ R r × ( p + q ) are weights, and r is the size of the pre-activation output
Revised: where W 1 , W 2 ∈ R r × ( p + q ) are weights, and r is the size of the pre-activation output

Original: ˆ z ( i +1) t +1 .
Revised: ˆ z ( i +1) t +1 .

Original: (Here and throughout the paper, all linear transformations can include additive biases.
Revised: (Here and throughout the paper, all linear transformations can include additive biases.

Original: We omit these for clarity.)
Revised: We omit these for clarity.)

Original: The output z ( i +1) t +1 is produced by a nonlinear activation function f : R r × R q → R q applied to the pre-activation output ˆ z
Revised: The output z ( i +1) t +1 is produced by a nonlinear activation function f : R r × R q → R q applied to the pre-activation output ˆ z

Original: ( i +1)
Revised: ( i +1)

Original: t +1 and the output z ( i ) t from the previous layer
Revised: t +1 and the output z ( i ) t from the previous layer

Original: More formally, z ( i +1)
Revised: More formally, z ( i +1)

Original: t +1 = f (cid:16) ˆ z
Revised: t +1 = f (cid:16) ˆ z

Original: ( i +1)
Revised: ( i +1)

Original: t +1 , z ( i ) t (cid:17) .
Revised: t +1 , z ( i ) t (cid:17) .

Original: A full trellis network can be built by tiling this elementary procedure across time and depth.
Revised: A full trellis network can be built by tiling this elementary procedure across time and depth.

Original: Given an input sequence x 1: T , we apply the same production procedure across all time steps and all layers, using the same weights.
Revised: Given an input sequence x 1: T , we apply the same production procedure across all time steps and all layers, using the same weights.

Original: The transformation is the same for all elements in the temporal dimension and in the depth dimension.
Revised: The transformation is the same for all elements in the temporal dimension and in the depth dimension.

Original: This is illustrated in Figure 1b.
Revised: This is illustrated in Figure 1b.

Original: Note that since we inject the same input sequence at every layer of the TrellisNet, we can precompute the linear transformation ˜ x t
Revised: Note that since we inject the same input sequence at every layer of the TrellisNet, we can precompute the linear transformation ˜ x t

Original: +1 =
Revised: +1 =

Original: W x 1 x t + W x 2 x t +1 for all layers i .
Revised: W x 1 x t + W x 2 x t +1 for all layers i .

Original: This identical linear combination of the input can then be added in each layer i to the appropriate linear combination of the hidden units, W z 1 z ( i ) t
Revised: This identical linear combination of the input can then be added in each layer i to the appropriate linear combination of the hidden units, W z 1 z ( i ) t

Original: + W z 2 z ( i ) t +1 , where W xj ∈ R r × p , W zj ∈ R r × q .
Revised: + W z 2 z ( i ) t +1 , where W xj ∈ R r × p , W zj ∈ R r × q .

Original: Now observe that in each level of the network, we are in effect performing a 1D convolution over the hidden units z ( i ) 1: T .
Revised: Now observe that in each level of the network, we are in effect performing a 1D convolution over the hidden units z ( i ) 1: T .

Original: The output of this convolution is then passed through the activation function f .
Revised: The output of this convolution is then passed through the activation function f .

Original: Formally, with W ∈ R r × q as the kernel weight matrix, the computation in layer i can be summarized as follows (Figure 1b):
Revised: Formally, with W ∈ R r × q as the kernel weight matrix, the computation in layer i can be summarized as follows (Figure 1b):

Original: [Equation]
Revised: [Equation]

Original: The resulting network operates in feed-forward fashion, with deeper elements having progressively larger receptive ﬁelds.
Revised: The resulting network operates in feed-forward fashion, with deeper elements having progressively larger receptive ﬁelds.

Original: There are, however, important differences from typical (temporal) convolutional networks.
Revised: There are, however, important differences from typical (temporal) convolutional networks.

Original: Notably, the ﬁlter matrix is shared across all layers.
Revised: Notably, the ﬁlter matrix is shared across all layers.

Original: That is, the weights are tied not only across time but also across depth.
Revised: That is, the weights are tied not only across time but also across depth.

Original: (Vogel & Pock (2017) have previously tied weights across depth in image processing.)
Revised: (Vogel & Pock (2017) have previously tied weights across depth in image processing.)

Original: Another difference is that the transformed input sequence ˜ x 1: T is directly injected into each hidden layer.
Revised: Another difference is that the transformed input sequence ˜ x 1: T is directly injected into each hidden layer.

Original: These differences and their importance will be analyzed further in Section 4.
Revised: These differences and their importance will be analyzed further in Section 4.

Original: The activation function f in Equation (3) can be any nonlinearity that processes the pre-activation output ˆ z ( i +1) 1: T and the output from the previous layer
Revised: The activation function f in Equation (3) can be any nonlinearity that processes the pre-activation output ˆ z ( i +1) 1: T and the output from the previous layer

Original: z ( i ) 1: T − 1 .
Revised: z ( i ) 1: T − 1 .

Original: We will later describe an activation function based on the LSTM cell.
Revised: We will later describe an activation function based on the LSTM cell.

Original: The rationale for its use will become clearer in light of the analysis presented in the next section.
Revised: The rationale for its use will become clearer in light of the analysis presented in the next section.

Original:  T RELLIS N ET , TCN, AND RNN
Revised:  T RELLIS N ET , TCN, AND RNN

Original: In this section we analyze the relationships between trellis networks, convolutional networks, and recurrent networks.
Revised: In this section we analyze the relationships between trellis networks, convolutional networks, and recurrent networks.

Original: In particular, we show that trellis networks can serve as a bridge between convolutional and recurrent networks.
Revised: In particular, we show that trellis networks can serve as a bridge between convolutional and recurrent networks.

Original: On the one hand, TrellisNet is a special form of TCN; this has already been clear in Section 3 and will be discussed further in Section 4.1.
Revised: On the one hand, TrellisNet is a special form of temporal convolutional networks (TCN); this has already been clear in Section 3 and will be discussed further in Section 4.1.

Original: On the other hand, any truncated RNN can be represented as a TrellisNet with special structure in the interlayer transformations; this will be the subject of Section 4.2.
Revised: On the other hand, any truncated RNN can be represented as a TrellisNet with special structure in the interlayer transformations; this will be the subject of Section 4.2.

Original: These connections allow TrellisNet to harness architectural elements and regularization techniques from both TCNs and RNNs; this will be summarized in Section 4.3.
Revised: These connections allow TrellisNet to harness architectural elements and regularization techniques from both TCNs and RNNs; this will be summarized in Section 4.3.

Original: 4. T RELLIS N ET AND TCN
Revised: 4. T RELLIS N ET AND TCN

Revised: We brieﬂy introduce TCNs here, and refer the readers to Bai et al.

Revised: for a more thorough discussion.

Revised: Brieﬂy, a temporal convolutional network (TCN) is a ConvNet that uses one dimensional convolutions over the sequence.

Revised: The convolutions are causal , meaning that, at each layer, the transformation at time t can only depend on previous layer units at times t or earlier, not from later points in time.

Revised: Such approaches were used going back to the late 1980s, under the name of “time-delay neural networks” (Waibel et al., 1989), and have received signiﬁcant interest in recent years due to their application in architectures such as WaveNet (van den Oord et al., 2016).

Original: In essence, TrellisNet is a special kind of temporal convolutional network.
Revised: In essence, TrellisNet is a special kind of temporal convolutional network.

Original: TCNs have two distinctive characteristics: 1) causal convolution in each layer to satisfy the causality constraint and 2) deep stacking of layers to increase the effective history length (i.e. receptive ﬁeld).
Revised: TCNs have two distinctive characteristics: 1) causal convolution in each layer to satisfy the causality constraint and 2) deep stacking of layers to increase the effective history length (i.e. receptive ﬁeld).

Original: Trellis networks have both of these characteristics.
Revised: Trellis networks have both of these characteristics.

Original: The basic model presented in Section 3 can easily be elaborated with larger kernel sizes, dilated convolutions, and other architectural elements used in TCNs; some of these are reviewed further in Section 4.3.
Revised: The basic model presented in Section 3 can easily be elaborated with larger kernel sizes, dilated convolutions, and other architectural elements used in TCNs; some of these are reviewed further in Section 4.3.

Original: However, TrellisNet is not a general TCN.
Revised: However, TrellisNet is not a general TCN.

Original: As mentioned in Section 3, two important differences are: 1) the weights are tied across layers and 2) the linearly transformed input ˜ x 1: T is injected into each layer.
Revised: As mentioned in Section 3, two important differences are: 1) the weights are tied across layers and 2) the linearly transformed input ˜ x 1: T is injected into each layer.

Original: Weight tying can be viewed as a form of regularization that can stabilize training, support generalization, and signiﬁcantly reduce the size of the model.
Revised: Weight tying can be viewed as a form of regularization that can stabilize training, support generalization, and signiﬁcantly reduce the size of the model.

Original: Input injection mixes deep features with the original sequence.
Revised: Input injection mixes deep features with the original sequence.

Original: These structural characteristics will be further illuminated by the connection between trellis networks and recurrent networks, presented next.
Revised: These structural characteristics will be further illuminated by the connection between trellis networks and recurrent networks, presented next.

Original: 4. T RELLIS N ET AND RNN
Revised: 4. T RELLIS N ET AND RNN

Original: Recurrent networks appear fundamentally different from convolutional networks.
Revised: Recurrent networks appear fundamentally different from convolutional networks.

Original: Instead of operating on all elements of a sequence in parallel in each layer, an RNN processes one input element at a time and unrolls in the time dimension.
Revised: Instead of operating on all elements of a sequence in parallel in each layer, an RNN processes one input element at a time and unrolls in the time dimension.

Original: Given a non-linearity g (which could be a sigmoid or a more elaborate cell), we can summarize the transformations in an L -layer RNN at time-step t as follows:
Revised: Given a non-linearity g (which could be a sigmoid or a more elaborate cell), we can summarize the transformations in an L -layer RNN at time-step t as follows:

Original: [Equation]
Revised: [Equation]

Original: Despite the apparent differences, we will now show that any RNN unrolled to a ﬁnite length is equivalent to a TrellisNet with special sparsity structure in the kernel matrix W .
Revised: Despite the apparent differences, we will now show that any RNN unrolled to a ﬁnite length is equivalent to a TrellisNet with special sparsity structure in the kernel matrix W .

Original: We begin by formally deﬁning the notion of a truncated (i.e. ﬁnite-horizon) RNN.
Revised: We begin by formally deﬁning the notion of a truncated (i.e. ﬁnite-horizon) RNN.

Original: Deﬁnition 1.
Revised: Deﬁnition 1.

Original: Given an RNN ρ , a corresponding M -truncated RNN ρ M , applied to the sequence x 1: T , produces at time step t the output y t by applying ρ to the sequence x t − M +1: t (here x < 0 = 0 ).
Revised: Given an RNN ρ , a corresponding M -truncated RNN ρ M , applied to the sequence x 1: T , produces at time step t the output y t by applying ρ to the sequence x t − M +1: t (here x < 0 = 0 ).

Original: Theorem 1.
Revised: Theorem 1.

Original: Let ρ M be an M -truncated RNN with L layers and hidden unit dimensionality d .
Revised: Let ρ M be an M -truncated RNN with L layers and hidden unit dimensionality d .

Original: Then there exists an equivalent TrellisNet τ with depth ( M + L − 1) and layer width (i.e. number of channels in each hidden layer)
Revised: Then there exists an equivalent TrellisNet τ with depth ( M + L − 1) and layer width (i.e. number of channels in each hidden layer)

Original: Ld .
Revised: Ld .

Original: That is, for any x 1: T , τ ( x 1: T ) =
Revised: That is, for any x 1: T , τ ( x 1: T ) =

Original: ρ M ( x 1: T ) .
Revised: ρ M ( x 1: T ) .

Original: Theorem 1 states that any M -truncated RNN can be represented as a TrellisNet.
Revised: Theorem 1 states that any M -truncated RNN can be represented as a TrellisNet.

Original: How severe of a restriction is M -truncation?
Revised: How severe of a restriction is M -truncation?

Original: Note that M -truncation is intimately related to truncated backpropagation-through-time (BPTT), used pervasively in training recurrent networks on long sequences.
Revised: Note that M -truncation is intimately related to truncated backpropagation-through-time (BPTT), used pervasively in training recurrent networks on long sequences.

Original: While RNNs can in principle retain unlimited history, there is both empirical and theoretical evidence that the memory horizon of RNNs is bounded (Bai et al., 2018; Khandelwal et al., 2018;
Revised: While RNNs can in principle retain unlimited history, there is both empirical and theoretical evidence that the memory horizon of RNNs is bounded (Bai et al., 2018; Khandelwal et al., 2018;

Original: Miller & Hardt, 2018).
Revised: Miller & Hardt, 2018).

Original: Furthermore, if desired, TrellisNets can recover exactly a common method of applying RNNs to long sequences – hidden state repackaging, i.e. copying the hidden state across subsequences.
Revised: Furthermore, if desired, TrellisNets can recover exactly a common method of applying RNNs to long sequences – hidden state repackaging, i.e. copying the hidden state across subsequences.

Original: This is accomplished using an analogous form of hidden state repackaging, detailed in Appendix B.
Revised: This is accomplished using an analogous form of hidden state repackaging, detailed in Appendix B.

Original: Proof of Theorem 1.
Revised: Proof of Theorem 1.

Original: We deﬁne h t,t (cid:48)
Revised: We deﬁne h t,t (cid:48)

Original: ∈ R d as the RNN hidden state at time t
Revised: ∈ R d as the RNN hidden state at time t

Original: but when the history started at time t (cid:48) .
Revised: but when the history started at time t (cid:48) .

Original: Note that in typical RNNs, we assume the history starts at time t = 1 , so h ( i ) t, 1 = h ( i ) t .
Revised: Note that in typical RNNs, we assume the history starts at time t = 1 , so h ( i ) t, 1 = h ( i ) t .

Original: When t (cid:48) >
Revised: When t (cid:48) >

Original: t , we assume h t,t (cid:48)
Revised: t , we assume h t,t (cid:48)

Original: = 

Revised: =

Original: (i.e., no history information if the clock starts in the future).
Revised: (i.e., no history information if the clock starts in the future).

Original: By assumption, ρ M is an RNN deﬁned by the following parameters: { W ( i ) hx , W ( i ) hh , g, M } , where
Revised: By assumption, ρ M is an RNN deﬁned by the following parameters: { W ( i ) hx , W ( i ) hh , g, M } , where

Original: W ( i ) hh ∈ R w ×
Revised: W ( i ) hh ∈ R w ×

Original: d
Revised: d

Original: for all i , W (1) hx ∈ R w × p , and W ( i ) hx ∈ R w × d for all i = 2 , . . .
Revised: for all i , W (1) hx ∈ R w × p , and W ( i ) hx ∈ R w × d for all i = 2 , . . .

Original: , L are the weight matrices at each layer ( w is the dimension of pre-activation output).
Revised: , L are the weight matrices at each layer ( w is the dimension of pre-activation output).

Original: We now construct a TrellisNet τ according to the exact deﬁnition in Section 3, with parameters { W 1 , W 2 , f } , where[Equation] [Equation] 
Revised: We now construct a TrellisNet τ according to the exact deﬁnition in Section 3, with parameters { W 1 , W 2 , f } , where

Original: W

Original: [Equation]
Revised: [Equation]

Original: W (

Original: [Equation] hx ... [Equation] ... W ( L ) hx   (5) and where W 1 , W 2 ∈ R Lw × ( p + Ld ) .
Revised: (5) and where W 1 , W 2 ∈ R Lw × ( p + Ld ) .

Original: Meanwhile, we deﬁne non-linearity f by f ( α, β )
Revised: Meanwhile, we deﬁne non-linearity f by f ( α, β )

Original: =
Revised: =

Original: g ( α ) (i.e., applying g only on the ﬁrst entry).
Revised: g ( α ) (i.e., applying g only on the ﬁrst entry).

Original: Let t ∈
Revised: Let t ∈

Original: [ T ] be arbitrary and ﬁxed.
Revised: [ T ] be arbitrary and ﬁxed.

Original: We now claim that the hidden unit at time t and layer j of
Revised: We now claim that the hidden unit at time t and layer j of

Original: TrellisNet τ can be expressed in terms of hidden units in RNN ρ M (note: j is the layer in τ , while i in h ( i ) t,t is the layer index in ρ M ):
Revised: TrellisNet τ can be expressed in terms of hidden units in RNN ρ M (note: j is the layer in τ , while i in h ( i ) t,t is the layer index in ρ M ):

Original: [Equation]
Revised: [Equation]

Original: We prove this claim by induction on j .
Revised: We prove this claim by induction on j .

Original: As a base case, consider j = 0 ; i.e., the input level of τ .
Revised: As a base case, consider j = 0 ; i.e., the input level of τ .

Original: Since h t,t (cid:48)
Revised: Since h t,t (cid:48)

Original: = 

Revised: =

Original: when t (cid:48) > t , we have that z (0) j
Revised: when t (cid:48) > t , we have that z (0) j

Original: = [0 0 . . .
Revised: = [0 0 . . .

Original: 0] (cid:62) indeed (recall that in the input level of TrellisNet we initialize z (0) t = 0 ).
Revised: 0] (cid:62) indeed (recall that in the input level of TrellisNet we initialize z (0) t = 0 ).

Original: For the inductive step, suppose Eq.
Revised: For the inductive step, suppose Eq.

Original: (6) holds for level j , and consider level j + 1 .
Revised: (6) holds for level j , and consider level j + 1 .

Original: By the feed-forward transformation of TrellisNet deﬁned in Eq.
Revised: By the feed-forward transformation of TrellisNet deﬁned in Eq.

Original: (2) and the nonlinearity f we deﬁned above, we have that:
Revised: (2) and the nonlinearity f we deﬁned above, we have that:

Original: [Equation]
Revised: [Equation]

Revised: t − j ... h ( L ) t − 1 ,t − j + L − 

Original: [Equation]
Revised: [Equation]

Revised:  

Revised: W (1) hx ...

Original: [Equation]
Revised: [Equation]

Original: 
Revised: (2) hx ...

Original: [Equation]
Revised: [Equation]

Revised: ( L ) hx 

Revised:    x t h (1) t,t − j +1 .

Revised: h ( L ) t

Original: [Equation]
Revised: [Equation]

Revised: t − j

Original: (11) where W ( i ) =
Revised: + [Equation] [Equation] where W ( i ) =

Original: ( W ( i ) hh , W
Revised: ( W ( i ) hh , W

Original: ( i ) hx ) .
Revised: ( i ) hx ) .

Original: Therefore, by induction, we have shown that Eq.
Revised: Therefore, by induction, we have shown that Eq.

Original: (6) holds for all j ≥ 0 .
Revised: (6) holds for all j ≥ 0 .

Original: If TrellisNet τ has M + L − 1 layers, then at the ﬁnal layer we would eventually have z ( M + L − 1) t
Revised: If TrellisNet τ has M + L − 1 layers, then at the ﬁnal layer we would eventually have z ( M + L − 1) t

Original: = [ . . . . . .
Revised: = [ . . . . . .

Original: h ( L ) t,t +1 − M ] (cid:62) .
Revised: h ( L ) t,t +1 − M ] (cid:62) .

Original: Since ρ M is an L -layer M -truncated RNN, this (taking the last d channels) is exactly the output of ρ M at time t .
Revised: Since ρ M is an L -layer M -truncated RNN, this (taking the last d channels) is exactly the output of ρ M at time t .

Original: In other words, we have shown that ρ M is equivalent to a TrellisNet with a sparse kernel matrix.
Revised: In other words, we have shown that ρ M is equivalent to a TrellisNet with a sparse kernel matrix.

Original: This completes the proof.
Revised: This completes the proof.

Original: Note that the convolutions in the TrellisNet τ constructed in Theorem 1 are sparse, as shown in
Revised: Note that the convolutions in the TrellisNet τ constructed in Theorem 1 are sparse, as shown in

Original: Eq.
Revised: Eq.

Original: They are related to group convolutions (Krizhevsky et al., 2012), but have an unusual form because group k at time t is convolved with group k − 1 at time t
Revised: They are related to group convolutions (Krizhevsky et al., 2012), but have an unusual form [Table] [Table] [Figure]

Original:  + 1 .
Revised: [Table] [Figure] because group k at time t is convolved with group k − 1 at time t + 1 .

Original: We refer to these as mixed group convolutions.
Revised: We refer to these as mixed group convolutions.

Original: For didactic purposes, we recap and illustrate the construction in the case of a 2-layer RNN.
Revised: For didactic purposes, we recap and illustrate the construction in the case of a 2-layer RNN.

Original: The key challenge is that a na¨ıve unrolling of the RNN into a feed-forward network does not produce a convolutional network, since the linear transformation weights are not constant across a layer.
Revised: The key challenge is that a na ¨ ıve unrolling of the RNN into a feed-forward network does not produce a convolutional network, since the linear transformation weights are not constant across a layer.

Original: The solution, illustrated in Figure 2a, is to organize each hidden unit into groups of channels, such [Table] [Table] [Figure]
Revised: The solution, illustrated in Figure 2a, is to organize each hidden unit into groups of channels, such that each TrellisNet unit represents 3 RNN units simultaneously (for x t , h (1) t , h (2) t ).

Original: [Table]

Original: [Figure]

Original: that each TrellisNet unit represents 3 RNN units simultaneously (for x t , h (1) t , h (2) t ).

Original: Each TrellisNet unit thus has ( p + 2 d ) channels.
Revised: Each TrellisNet unit thus has ( p + 2 d ) channels.

Original: The interlayer transformation can then be expressed as a mixed group convolution, illustrated in Figure 2b.
Revised: The interlayer transformation can then be expressed as a mixed group convolution, illustrated in Figure 2b.

Original: This can be represented as a sparse convolution with the structure given in Eq.
Revised: This can be represented as a sparse convolution with the structure given in Eq.

Original: (5) (with L = 2 ).
Revised: (5) (with L = 2 ).

Original: Applying the nonlinearity g on the pre-activation output, this exactly reproduces the transformations in the original 2-layer RNN.
Revised: Applying the nonlinearity g on the pre-activation output, this exactly reproduces the transformations in the original 2-layer RNN.

Original: The TrellisNet that emerges from this construction has special sparsity structure in the weight matrix.
Revised: The TrellisNet that emerges from this construction has special sparsity structure in the weight matrix.

Original: It stands to reason that a general TrellisNet with an unconstrained (dense) weight matrix W may have greater expressive power: it can model a broader class of transformations than the original
Revised: It stands to reason that a general TrellisNet with an unconstrained (dense) weight matrix W may have greater expressive power: it can model a broader class of transformations than the original

Original: RNN ρ M .
Revised: RNN ρ M .

Original: Note that while the hidden channels of the TrellisNet τ constructed in the proof of
Revised: Note that while the hidden channels of the TrellisNet τ constructed in the proof of

Original: Theorem 1 are naturally arranged into groups that represent different layers of the RNN ρ M (Eq.
Revised: Theorem 1 are naturally arranged into groups that represent different layers of the RNN ρ M (Eq.

Original: (6), an unconstrained dense weight matrix W no longer admits such an interpretation.
Revised: (6), an unconstrained dense weight matrix W no longer admits such an interpretation.

Original: A model deﬁned by a dense weight matrix is fundamentally distinct from the RNN ρ M that served as our point of departure.
Revised: A model deﬁned by a dense weight matrix is fundamentally distinct from the RNN ρ M that served as our point of departure.

Original: We take advantage of this expressivity and use general weight matrices W , as presented in Section 3, in our experiments.
Revised: We take advantage of this expressivity and use general weight matrices W , as presented in Section 3, in our experiments.

Original: Our ablation analysis will show that such generalized dense transformations are beneﬁcial, even when model capacity is controlled for.
Revised: Our ablation analysis will show that such generalized dense transformations are beneﬁcial, even when model capacity is controlled for.

Original: The proof of Theorem 1 did not delve into the inner structure of the nonlinear transformation g in
Revised: The proof of Theorem 1 did not delve into the inner structure of the nonlinear transformation g in

Original: RNN (or f in the constructed TrellisNet).
Revised: RNN (or f in the constructed TrellisNet).

Original: For a vanilla RNN, for instance, f is usually an elementwise sigmoid or tanh function that is applied to ˆ h t .
Revised: For a vanilla RNN, for instance, f is usually an elementwise sigmoid or tanh function that is applied to ˆ h t .

Original: But the construction in Theorem 1 applies just as well to RNNs with structured cells, such as LSTMs and GRUs.
Revised: But the construction in Theorem 1 applies just as well to RNNs with structured cells, such as LSTMs and GRUs.

Original: We adopt LSTM cells for the
Revised: We adopt LSTM cells for the

Original: TrellisNets in our experiments and provide a detailed treatment of this nonlinearity in Section 5.
Revised: TrellisNets in our experiments and provide a detailed treatment of this nonlinearity in Section 5.

Original: and Appendix A.
Revised: and Appendix A.

Original: 4. T RELLIS N ET AS A B RIDGE B ETWEEN R ECURRENT AND C ONVOLUTIONAL M ODELS
Revised: 4. T RELLIS N ET AS A B RIDGE B ETWEEN R ECURRENT AND C ONVOLUTIONAL M ODELS

Original: In Section 4.1 we concluded that TrellisNet is a special kind of TCN, characterized by weight tying and input injection.
Revised: In Section 4.1 we concluded that TrellisNet is a special kind of TCN, characterized by weight tying and input injection.

Original: In Section 4.2 we established that TrellisNet is a generalization of truncated
Revised: In Section 4.2 we established that TrellisNet is a generalization of truncated

Original: RNNs.
Revised: RNNs.

Original: These connections along with the construction in our proof of Theorem 1 allow TrellisNets to beneﬁt signiﬁcantly from techniques developed originally for RNNs, while also incorporating architectural and algorithmic motifs developed for convolutional networks.
Revised: These connections along with the construction in our proof of Theorem 1 allow TrellisNets to beneﬁt signiﬁcantly from techniques developed originally for RNNs, while also incorporating architectural and algorithmic motifs developed for convolutional networks.

Original: We summarize a number of techniques here.
Revised: We summarize a number of techniques here.

Original: From recurrent networks, we can integrate 1) structured nonlinear activations (e.g. LSTM and GRU gates); 2) variational RNN dropout (Gal & Ghahramani, 2016); 3) recurrent
Revised: From recurrent networks, we can integrate 1) structured nonlinear activations (e.g. LSTM and GRU gates); 2) variational RNN dropout (Gal & Ghahramani, 2016); 3) recurrent

Original: DropConnect (Merity et al., 2018b); and 4) history compression and repackaging.
Revised: DropConnect (Merity et al., 2018b); and 4) history compression and repackaging.

Original: From convolutional networks, we can adapt 1) larger kernels and dilated convolutions (Yu & Koltun, 2016); 2) auxiliary losses at intermediate layers (Lee et al., 2015; Xie & Tu, 2015); 3) weight normalization (Salimans & Kingma, 2016); and 4) parallel convolutional processing.
Revised: From convolutional networks, we can adapt 1) larger kernels and dilated convolutions (Yu & Koltun, 2016); 2) auxiliary losses at intermediate layers (Lee et al., 2015; Xie & Tu, 2015); 3) weight normalization (Salimans & Kingma, 2016); and 4) parallel convolutional processing.

Original: Being able to directly incorporate techniques from both streams of research is one of the beneﬁts of trellis networks.
Revised: Being able to directly incorporate techniques from both streams of research is one of the beneﬁts of trellis networks.

Original: We leverage this in our experiments and provide a more comprehensive treatment of these adaptations in Appendix B.
Revised: We leverage this in our experiments and provide a more comprehensive treatment of these adaptations in Appendix B [Table]

Original:  E XPERIMENTS 5. A T RELLIS N ET WITH G ATED A CTIVATION
Revised:  E XPERIMENTS 5. A T RELLIS N ET WITH G ATED A CTIVATION

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: In our description of generic trellis networks in Section 3, the activation function f can be any nonlinearity that computes [Figure] based on ˆ [Figure]
Revised: In our description of generic trellis networks in Section 3, the activation function f can be any nonlinearity that computes z ( i +1) 1: T based on ˆ z ( i +1) 1: T and z ( i ) 1: T − 1 .

Original: and z ( i ) 1: T − 1 .

Original: In experiments, we use a gated activation based on the LSTM cell.
Revised: In experiments, we use a gated activation based on the LSTM cell.

Original: Gated activations have been used before in convolutional networks for sequence modeling (van den Oord et al., 2016; Dauphin et al., 2017).
Revised: Gated activations have been used before in convolutional networks for sequence modeling (van den Oord et al., 2016; Dauphin et al., 2017).

Original: Our choice is inspired directly by Theorem 1, which suggests incorporating an existing RNN cell into TrellisNet.
Revised: Our choice is inspired directly by Theorem 1, which suggests incorporating an existing RNN cell into TrellisNet.

Original: We use the LSTM cell due to its effectiveness in recurrent networks (Jozefowicz et al., 2015;
Revised: We use the LSTM cell due to its effectiveness in recurrent networks (Jozefowicz et al., 2015;

Original: Greff et al., 2017; Melis et al., 2018).
Revised: Greff et al., 2017; Melis et al., 2018).

Original: We summarize the construction here; a more detailed treatment can be found in Appendix A.
Revised: We summarize the construction here; a more detailed treatment can be found in Appendix A.

Original: In an LSTM cell, three information-controlling gates are computed at time t .
Revised: In an LSTM cell, three information-controlling gates are computed at time t .

Original: Moreover, there is a cell state that does not participate in the hidden-to-hidden transformations but is updated in every step using the result from the gated activations.
Revised: Moreover, there is a cell state that does not participate in the hidden-to-hidden transformations but is updated in every step using the result from the gated activations.

Original: We integrate the LSTM cell into the TrellisNet as follows (Figure 3):
Revised: We integrate the LSTM cell into the TrellisNet as follows (Figure 3):

Original: [Equation]
Revised: [Equation]

Original: Thus the linear transformation in each layer of the TrellisNet produces a pre-activation feature ˆ z t +1 with r = 4 q feature channels, which are then processed by elementwise transformations and
Revised: Thus the linear transformation in each layer of the TrellisNet produces a pre-activation feature ˆ z t +1 with r = 4 q feature channels, which are then processed by elementwise transformations and

Original: Hadamard products to yield the ﬁnal output z ( i +1) [Equation] 1 = 
Revised: Hadamard products to yield the ﬁnal output z ( i +1) t +1 = (cid:16) z

Original: [Equation]
Revised: [Equation]

Original: z
Revised: i

Original: [Equation]
Revised: [Equation]

Original: [Equation] + [Equation]
Revised: t +1 , 1 , z ( i +1)

Original:  2 (cid:17) of the layer.
Revised: t +1 , 2 (cid:17) of the layer.

Original: 5. R ESULTS
Revised: 5. R ESULTS

Original: We evaluate trellis networks on word-level and character-level language modeling on the standard
Revised: We evaluate trellis networks on word-level and character-level language modeling on the standard

Original: Penn Treebank (PTB) dataset (Marcus et al., 1993; Mikolov et al., 2010), large-scale word-level modeling on WikiText-103 (WT103) (Merity et al., 2017), and standard stress tests used to study long-range information propagation in sequence models: sequential MNIST, permuted MNIST (PMNIST), and sequential CIFAR-10 (Chang et al., 2017; Bai et al., 2018; Trinh et al., 2018).
Revised: Penn Treebank (PTB) dataset (Marcus et al., 1993; Mikolov et al., 2010), large-scale word-level modeling on WikiText-103 (WT103) (Merity et al., 2017), and standard stress tests used to study long-range information propagation in sequence models: sequential MNIST, permuted MNIST (PMNIST), and sequential CIFAR-10 (Chang et al., 2017; Bai et al., 2018; Trinh et al., 2018).

Original: Note that these tasks are on very different scales, with unique properties that challenge sequence models in different ways.
Revised: Note that these tasks are on very different scales, with unique properties that challenge sequence models in different ways.

Original: For example, word-level PTB is a small dataset that a typical model easily overﬁts, so judicious regularization is essential.
Revised: For example, word-level PTB is a small dataset that a typical model easily overﬁts, so judicious regularization is essential.

Original: WT103 is a hundred times larger, with less danger of overﬁtting, but with a vocabulary size of 268K that makes training more challenging (and precludes the application of techniques such mixture of softmaxes (Yang et al., 2018)).
Revised: WT103 is a hundred times larger, with less danger of overﬁtting, but with a vocabulary size of 268K that makes training more challenging (and precludes the application of techniques such mixture of softmaxes (Yang et al., 2018)).

Original: A more complete description of these tasks and their characteristics can be found in Appendix C.
Revised: A more complete description of these tasks and their characteristics can be found in Appendix C.

Original: The prior state of the art on these tasks was set by completely different models, such as AWD-LSTM on character-level PTB (Merity et al., 2018a), neural architecture search on word-level PTB (Pham et al., 2018), and the self-attention-based Relational Memory Core on WikiText-103 (Santoro et al., 2018).
Revised: The prior state of the art on these tasks was set by completely different models, such as AWD-LSTM on character-level PTB (Merity et al., 2018a), neural architecture search on word-level PTB (Pham et al., 2018), and the self-attention-based Relational Memory Core on WikiText-103 (Santoro et al., 2018).

Original: We use trellis networks on all tasks and outperform the respective state-of-the-art models on each.
Revised: We use trellis networks on all tasks and outperform the respective state-of-the-art models on each.

Original: For example, on word-level Penn Treebank, TrellisNet outperforms by a good margin the  recent results of Melis et al.
Revised: For example, on word-level Penn Treebank, TrellisNet outperforms by a good margin the [Table] [Table] recent results of Melis et al.

Original: (2018), which used the Google Vizier service for exhaustive hyperparameter tuning, as well as the recent neural architecture search work of Pham et al.
Revised: (2018), which used the Google Vizier service for exhaustive hyperparameter tuning, as well as the recent neural architecture search work of Pham et al.

Original: On
Revised: On

Original: WikiText-103, a trellis network outperforms by 4% the Relational Memory Core (Santoro et al., 2018) and by 8% the thorough optimization work of Merity et al.
Revised: WikiText-103, a trellis network outperforms by 4% the Relational Memory Core (Santoro et al., 2018) and by 8% the thorough optimization work of Merity et al.

Original: (2018a).
Revised: (2018a).

Original: Many hyperparameters we use are adapted directly from prior work on recurrent networks.
Revised: Many hyperparameters we use are adapted directly from prior work on recurrent networks.

Original: (As highlighted in Section 4.3, many techniques can be carried over directly from RNNs).
Revised: (As highlighted in Section 4.3, many techniques can be carried over directly from RNNs).

Original: For others, we perform a basic grid search.
Revised: For others, we perform a basic grid search.

Original: We decay the learning rate by a ﬁxed factor once validation error plateaus.
Revised: We decay the learning rate by a ﬁxed factor once validation error plateaus.

Original: All hyperparameters are reported in Appendix D, along with an ablation study.
Revised: All hyperparameters are reported in Appendix D, along with an ablation study.

Original: A complete implementation will be released.
Revised: A complete implementation will be released.

Original: [Table]

Original: [Table]

Original: Word-level language modeling.
Revised: Word-level language modeling.

Original: For word-level language modeling, we use PTB and WT103.
Revised: For word-level language modeling, we use PTB and WT103.

Original: The results on PTB are listed in Table 1.
Revised: The results on PTB are listed in Table 1.

Original: TrellisNet sets a new state of the art on PTB, both with and without mixture of softmaxes (Yang et al., 2018), outperforming all previously published results by more than one unit of perplexity.
Revised: TrellisNet sets a new state of the art on PTB, both with and without mixture of softmaxes (Yang et al., 2018), outperforming all previously published results by more than one unit of perplexity.

Original: WT103 is 110 times larger than PTB, with vocabulary size 268K. We follow prior work and use the adaptive softmax (Grave et al., 2017a), which improves memory efﬁciency by assigning higher capacity to more frequent words.
Revised: WT103 is 110 times larger than PTB, with vocabulary size 268K. We follow prior work and use the adaptive softmax (Grave et al., 2017a), which improves memory efﬁciency by assigning higher capacity to more frequent words.

Original: The results are listed in Table 2 (left).
Revised: The results are listed in Table 2.

Original: TrellisNet sets a new state of the art on this dataset as well, with perplexity 30.35: about 4% better than the contemporaneous self-attention-based Relational Memory Core (RMC) (Santoro et al., 2018).
Revised: TrellisNet sets a new state of the art on this dataset as well, with perplexity 30.35: about 4% better than the contemporaneous self-attention-based Relational Memory Core (RMC) (Santoro et al., 2018).

Original: TrellisNet achieves this better accuracy with much faster convergence: 22 epochs, versus 90 for RMC.
Revised: TrellisNet achieves this better accuracy with much faster convergence: 22 epochs, versus 90 for RMC.

Original: Character-level language modeling.
Revised: Character-level language modeling.

Original: When used for character-level modeling, PTB is a mediumscale dataset.
Revised: When used for character-level modeling, PTB is a mediumscale dataset.

Original: We thus use a deeper network as well as techniques such as weight normalization (Salimans & Kingma, 2016) and deep supervision (Lee et al., 2015; Xie & Tu, 2015).
Revised: We thus use a deeper network as well as techniques such as weight normalization (Salimans & Kingma, 2016) and deep supervision (Lee et al., 2015; Xie & Tu, 2015).

Original: The results are  listed in Table 2 (right).
Revised: The results are [Table] [Table] listed in Table 3.

Original: TrellisNet sets a new state of the art, outperforming the recent results of Merity et al.
Revised: TrellisNet sets a new state of the art, outperforming the recent results of Merity et al.

Original: (2018a) by a comfortable margin.
Revised: (2018a) by a comfortable margin.

Original: Long-range modeling with Sequential MNIST, PMNIST, and CIFAR-10.
Revised: Long-range modeling with Sequential MNIST, PMNIST, and CIFAR-10.

Original: We also evaluate the
Revised: We also evaluate the

Original: TrellisNet for ability to model long-term dependencies.
Revised: TrellisNet for ability to model long-term dependencies.

Original: In the Sequential MNIST, PMNIST, and
Revised: In the Sequential MNIST, PMNIST, and

Original: CIFAR-10 tasks, images are processed as long sequences, one pixel at a time (Chang et al., 2017;
Revised: CIFAR-10 tasks, images are processed as long sequences, one pixel at a time (Chang et al., 2017;

Original: Bai et al., 2018; Trinh et al., 2018).
Revised: Bai et al., 2018; Trinh et al., 2018).

Original: Our model has 8M parameters, in alignment with prior work.
Revised: Our model has 8M parameters, in alignment with prior work.

Original: To cover the larger context, we use dilated convolutions in intermediate layers, adopting a common architectural element from TCNs (Yu & Koltun, 2016; van den Oord et al., 2016; Bai et al., 2018).
Revised: To cover the larger context, we use dilated convolutions in intermediate layers, adopting a common architectural element from TCNs (Yu & Koltun, 2016; van den Oord et al., 2016; Bai et al., 2018).

Original: The results are listed in Table 3.
Revised: The results are listed in Table 4.

Original: Note that the performance of prior models is inconsistent.
Revised: Note that the performance of prior models is inconsistent.

Original: The
Revised: The

Original: Transformer works well on MNIST but fairs poorly on CIFAR-10, while r -LSTM with unsupervised auxiliary losses achieves good results on CIFAR-10 but underperforms on Permuted MNIST.
Revised: Transformer works well on MNIST but fairs poorly on CIFAR-10, while r -LSTM with unsupervised auxiliary losses achieves good results on CIFAR-10 but underperforms on Permuted MNIST.

Original: TrellisNet outperforms all these models on all three tasks.
Revised: TrellisNet outperforms all these models on all three tasks.

Original:  D ISCUSSION
Revised:  D ISCUSSION

Original: We presented trellis networks, a new architecture for sequence modeling.
Revised: We presented trellis networks, a new architecture for sequence modeling.

Original: Trellis networks form a structural bridge between convolutional and recurrent models.
Revised: Trellis networks form a structural bridge between convolutional and recurrent models.

Original: This enables direct assimilation of many techniques designed for either of these two architectural families.
Revised: This enables direct assimilation of many techniques designed for either of these two architectural families.

Original: We leverage these connections to train high-performing trellis networks that set a new state of the art on highly competitive language modeling benchmarks.
Revised: We leverage these connections to train high-performing trellis networks that set a new state of the art on highly competitive language modeling benchmarks.

Original: Beyond the empirical gains, we hope that trellis networks will serve as a step towards deeper and more uniﬁed understanding of sequence modeling.[Table]
Revised: Beyond the empirical gains, we hope that trellis networks will serve as a step towards deeper and more uniﬁed understanding of sequence modeling.

Original: There are many exciting opportunities for future work.
Revised: There are many exciting opportunities for future work.

Original: First, we have not conducted thorough performance optimizations on trellis networks.
Revised: First, we have not conducted thorough performance optimizations on trellis networks.

Original: For example, architecture search on the structure of the gated activation f may yield a higher-performing activation function than the classic LSTM cell we used (Zoph & Le, 2017; Pham et al., 2018).
Revised: For example, architecture search on the structure of the gated activation f may yield a higher-performing activation function than the classic LSTM cell we used (Zoph & Le, 2017; Pham et al., 2018).

Original: Likewise, principled hyperparameter tuning will likely improve modeling accuracy beyond the levels we have observed (Melis et al., 2018).
Revised: Likewise, principled hyperparameter tuning will likely improve modeling accuracy beyond the levels we have observed (Melis et al., 2018).

Original: Future work can also explore acceleration schemes that speed up training and inference.
Revised: Future work can also explore acceleration schemes that speed up training and inference.

Original: Another signiﬁcant opportunity is to establish connections between trellis networks and self-attention-based architectures (Transformers) (Vaswani et al., 2017; Santoro et al., 2018;
Revised: Another signiﬁcant opportunity is to establish connections between trellis networks and self-attention-based architectures (Transformers) (Vaswani et al., 2017; Santoro et al., 2018;

Original: Chen et al., 2018), thus unifying all three major contemporary approaches to sequence modeling.
Revised: Chen et al., 2018), thus unifying all three major contemporary approaches to sequence modeling.

Original: Finally we look forward to seeing applications of trellis networks to industrial-scale challenges such as machine translation
Revised: Finally, we look forward to seeing applications of trellis networks to industrial-scale challenges such as machine translation.

Original: A E XPRESSING AN LSTM AS A T RELLIS N ET
Revised: A E XPRESSING AN LSTM AS A T RELLIS N ET

Original: [Table] [Table]
Revised: [Table] [Table]

Original: /lDRLGESqSDGBL6XYjgnGjkVbFHuZ4alhE7IiAUWJUmYCefLlRfutXWGbqy0fRLdpft7Yk4SY2ZJZDsTgmOzXsvN/2pBhvF9OOcyzZBJuvoozoSLys3vd4dcM4piZoFQze2uLh0TTSjalMo2BH/95E3o1Gu+V/Mf69XGbRFHCS7hCm7AhztowAO0oA0UFDzDK7w56Lw4787HqnXLKWYu4I+czx+2E5F4</latexit>
Revised: /lDRLGESqSDGBL6XYjgnGjkVbFHuZ4alhE7IiAUWJUmYCefLlRfutXWGbqy0fRLdpft7Yk4SY2ZJZDsTgmOzXsvN/2pBhvF9OOcyzZBJuvoozoSLys3vd4dcM4piZoFQze2uLh0TTSjalMo2BH/95E3o1Gu+V/Mf69XGbRFHCS7hCm7AhztowAO0oA0UFDzDK7w56Lw4787HqnXLKWYu4I+czx+2E5F4</latexit>

Original: z ( i )1 ,z
Revised: z ( i )1 ,z

Original: ( i )2 ,z ( i )3 ,z
Revised: ( i )2 ,z ( i )3 ,z

Original: ( i )4 ,z ( i )5 ,z
Revised: ( i )4 ,z ( i )5 ,z

Original: ( i )6 ,z ( i )7 ,z
Revised: ( i )6 ,z ( i )7 ,z

Original: ( i )8 ,z ( i )1 ,z
Revised: ( i )8 ,z ( i )1 ,z

Original: ( i )2 ,z ( i )3 ,z
Revised: ( i )2 ,z ( i )3 ,z

Original: ( i )4 ,z ( i )5 ,z
Revised: ( i )4 ,z ( i )5 ,z

Original: ( i )6 ,z ( i )7 ,z
Revised: ( i )6 ,z ( i )7 ,z

Original: ( i )8 ,z
Revised: ( i )8 ,z

Original: ( i )1: T =
Revised: ( i )1: T =

Original: ( z ( i )1: T, 1 ,z ( i )1: T, 2 )
Revised: ( z ( i )1: T, 1 ,z ( i )1: T, 2 )

Original: z ( i +1)1 ,z
Revised: z ( i +1)1 ,z

Original: ( i +1)2 ,z
Revised: ( i +1)2 ,z

Original: ( i +1)3 ,z ( i +1)4 ,
Revised: ( i +1)3 ,z ( i +1)4 ,

Original: z ( i +1)5 ,z
Revised: z ( i +1)5 ,z

Original: ( i +1)6 ,
Revised: ( i +1)6 ,

Original: z ( i +1)7 ,z
Revised: z ( i +1)7 ,z

Original: ( i +1)8 ,
Revised: ( i +1)8 ,

Original: [Figure]
Revised: [Figure]

Original: Here we trace in more detail the transformation of an LSTM into a TrellisNet.
Revised: Here we trace in more detail the transformation of an LSTM into a TrellisNet.

Original: This is an application of Theorem 1.
Revised: This is an application of Theorem 1.

Original: The nonlinear activation has been examined in Section 5.1.
Revised: The nonlinear activation has been examined in Section 5.1.

Original: We will walk through the construction again here.
Revised: We will walk through the construction again here.

Original: In each time step, an LSTM cell computes the following:
Revised: In each time step, an LSTM cell computes the following:

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: where h (0) t = x t , and f t , i t , o t are typically called the forget , input , and output gates.
Revised: where h (0) t = x t , and f t , i t , o t are typically called the forget , input , and output gates.

Original: By a similar construction to how we deﬁned τ in Theorem 1, to recover an LSTM the mixed group convolution needs to produce 3 q more channels for these gated outputs, which have the form f t,t (cid:48) , i t,t (cid:48) and g t,t (cid:48)
Revised: By a similar construction to how we deﬁned τ in Theorem 1, to recover an LSTM the mixed group convolution needs to produce 3 q more channels for these gated outputs, which have the form f t,t (cid:48) , i t,t (cid:48) and g t,t (cid:48)

Original: (see Figure 5 for an example).
Revised: (see Figure 5 for an example).

Original: In addition, at each layer of the mixed group convolution, the network also needs to maintain a group of channels for cell states c t,t (cid:48) .
Revised: In addition, at each layer of the mixed group convolution, the network also needs to maintain a group of channels for cell states c t,t (cid:48) .

Original: Note that in an LSTM network c t is updated “synchronously” with h t , so we can similarly write
Revised: Note that in an LSTM network c t is updated “synchronously” with h t , so we can similarly write

Original: [Equation]
Revised: [Equation]

Original: Based on these changes
Revised: Based on these changes

Original: [Equation]
Revised: [Equation]

Original: we show in Figure 4 an atomic and a sequence view of TrellisNet with the
Revised: we show in Figure 4 an atomic and a sequence view of TrellisNet with the

Original: LSTM activation.
Revised: LSTM activation.

Original: The hidden units z 1: T consist of two parts: z 1: T, 1 , which gets updated directly via the gated activations (akin to LSTM cell states)
Revised: The hidden units z 1: T consist of two parts: z 1: T, 1 , which gets updated directly via the gated activations (akin to LSTM cell states)

Original: [Equation]
Revised: [Equation]

Original: and z 1: T, 2 , which is processed by parameterized convolutions (akin to LSTM hidden states).
Revised: and z 1: T, 2 , which is processed by parameterized convolutions (akin to LSTM hidden states).

Original: Formally, in layer i :
Revised: Formally, in layer i :

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: +48VfcuFDErRt3/o2TNgttPXDhcM693HuPHzMqlWV9GwuLS8srq6W18vrG5ta2ubPbllEiMGnhiEWi6yNJGOWkpahipBsLgkKfkY4/usj9zj0Rkkb8Ro1j4oZowGlAMVJa8szjjpcOH7LbtGofZdChHDohUkPfT

Revised: +48VfcuFDErRt3/o2TNgttPXDhcM693HuPHzMqlWV9GwuLS8srq6W18vrG5ta2ubPbllEiMGnhiEWi6yNJGOWkpahipBsLgkKfkY4/usj9zj0Rkkb8Ro1j4oZowGlAMVJa8szjjpcOH7LbtGofZdChHDohUkPfT

Original: +1WL+DjqIhkTDOoGdWrJo1AZwndkEqoEDTM7+cfoSTkHCFGZKyZ1uxclMkFMWMZGUnkSRGeIQGpKcpR3qRm05+yuChVvowiIQuruBE/T2RolDKcejrzvxgOevl4n9eL1HBmZtSHieKcDxdFCQMqgjmAcE+FQQrNtYEYUH1rRAPkUBY6RjLOgR79uV50j6p2VbNvqpXGudFHCWwDw5AFdjgFDTAJWiCFsDgETyDV/BmPBkvxrvxMW1dMIqZPfAHxucP4VudfQ==</latexit>
Revised: +1WL+DjqIhkTDOoGdWrJo1AZwndkEqoEDTM7+cfoSTkHCFGZKyZ1uxclMkFMWMZGUnkSRGeIQGpKcpR3qRm05+yuChVvowiIQuruBE/T2RolDKcejrzvxgOevl4n9eL1HBmZtSHieKcDxdFCQMqgjmAcE+FQQrNtYEYUH1rRAPkUBY6RjLOgR79uV50j6p2VbNvqpXGudFHCWwDw5AFdjgFDTAJWiCFsDgETyDV/BmPBkvxrvxMW1dMIqZPfAHxucP4VudfQ==</latexit>

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table]
Revised: [Table]

Original: T +1 <
Revised: T +1 <

Original: [Table]
Revised: [Table]

Original: x T +1 <latexit sha
Revised: x T +1 <latexit sha

Original: [Table]
Revised: [Table]

Original: base
Revised: base

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: In Section 4, we formally described the relationship between TrellisNets, RNNs, and temporal convolutional networks (TCN).
Revised: In Section 4, we formally described the relationship between TrellisNets, RNNs, and temporal convolutional networks (TCN).

Original: On the one hand, TrellisNet is a special TCN (with weight-tying and injected inputs), while on the other hand it can also express any structured RNN via a sparse convolutional kernel.
Revised: On the one hand, TrellisNet is a special TCN (with weight-tying and injected inputs), while on the other hand it can also express any structured RNN via a sparse convolutional kernel.

Original: These relationships open clear paths for applying techniques developed for either recurrent or convolutional networks.
Revised: These relationships open clear paths for applying techniques developed for either recurrent or convolutional networks.

Original: We summarize below some of the techniques that can be applied in this way to TrellisNet, categorizing them as either inspired by RNNs or TCNs.
Revised: We summarize below some of the techniques that can be applied in this way to TrellisNet, categorizing them as either inspired by RNNs or TCNs.

Original: B. F ROM R ECURRENT N ETWORKS
Revised: B. F ROM R ECURRENT N ETWORKS

Original: History repackaging.
Revised: History repackaging.

Original: One theoretical advantage of RNNs is their ability to represent a history of inﬁnite length.
Revised: One theoretical advantage of RNNs is their ability to represent a history of inﬁnite length.

Original: However, in many applications, sequence lengths are too long for inﬁnite backpropagation during training.
Revised: However, in many applications, sequence lengths are too long for inﬁnite backpropagation during training.

Original: A typical solution is to partition the sequence into smaller subsequences and perform truncated backpropagation through time (BPTT) on each.
Revised: A typical solution is to partition the sequence into smaller subsequences and perform truncated backpropagation through time (BPTT) on each.

Original: At sequence boundaries, the hidden state h t is “repackaged” and passed onto the next RNN sequence.
Revised: At sequence boundaries, the hidden state h t is “repackaged” and passed onto the next RNN sequence.

Original: Thus gradient ﬂow stops at sequence boundaries (see Figure 6a).
Revised: Thus gradient ﬂow stops at sequence boundaries (see Figure 6a).

Original: Such repackaging is also sometimes used at test time.
Revised: Such repackaging is also sometimes used at test time.

Original: We can now map this repackaging procedure to trellis networks.
Revised: We can now map this repackaging procedure to trellis networks.

Original: As shown in Figure 6, the notion of passing the compressed history vector h t in an RNN corresponds to speciﬁc non-zero padding in the mixed group convolution of the corresponding TrellisNet.
Revised: As shown in Figure 6, the notion of passing the compressed history vector h t in an RNN corresponds to speciﬁc non-zero padding in the mixed group convolution of the corresponding TrellisNet.

Original: The padding is simply the channels from the last step of the ﬁnal layer applied on the previous sequence (see Figure 6b, where without the repackaging padding, at layer 2 we will have h (1) T +1 ,T +1 instead of h (1) T +1 , 1 ).
Revised: The padding is simply the channels from the last step of the ﬁnal layer applied on the previous sequence (see Figure 6b, where without the repackaging padding, at layer 2 we will have h (1) T +1 ,T +1 instead of h (1) T +1 , 1 ).

Original: We illustrate this in
Revised: We illustrate this in

Original: Figure 6b, where we have written out z ( i ) t in TrellisNet explicitly in the form of h t,t (cid:48) according to Eq.
Revised: Figure 6b, where we have written out z ( i ) t in TrellisNet explicitly in the form of h t,t (cid:48) according to Eq.

Original: This suggests that instead of storing all effective history in memory, we can compress history in a feed-forward network to extend its history as well.
Revised: This suggests that instead of storing all effective history in memory, we can compress history in a feed-forward network to extend its history as well.

Original: For a general TrellisNet that employs a dense kernel, similarly, we can pass the hidden channels of the last step of the ﬁnal layer in the previous sequence as the “history” padding for the next TrellisNet sequence (this works in both training and testing).
Revised: For a general TrellisNet that employs a dense kernel, similarly, we can pass the hidden channels of the last step of the ﬁnal layer in the previous sequence as the “history” padding for the next TrellisNet sequence (this works in both training and testing).

Original: Gated activations.
Revised: Gated activations.

Original: In general, the structured gates in RNN cells can be translated to gated activations in temporal convolutions, as we did in Appendix A in the case of an LSTM.
Revised: In general, the structured gates in RNN cells can be translated to gated activations in temporal convolutions, as we did in Appendix A in the case of an LSTM.

Original: While in the experiments we adopted the LSTM gating, other activations (e.g. GRUs (Cho et al., 2014) or activations found via architecture search (Zoph & Le, 2017)) can also be applied in trellis networks via the equivalence established in Theorem 1.
Revised: While in the experiments we adopted the LSTM gating, other activations (e.g. GRUs (Cho et al., 2014) or activations found via architecture search (Zoph & Le, 2017)) can also be applied in trellis networks via the equivalence established in Theorem 1.

Original: RNN variational dropout.
Revised: RNN variational dropout.

Original: Variational dropout (VD) for RNNs (Gal & Ghahramani, 2016) is a useful regularization scheme that applies the same mask at every time step within a layer (see Figure 7a).
Revised: Variational dropout (VD) for RNNs (Gal & Ghahramani, 2016) is a useful regularization scheme that applies the same mask at every time step within a layer (see Figure 7a).

Original: A direct translation of this technique from RNN to the group temporal convolution implies that we need to create a different mask for each diagonal of the network (i.e., each history starting point), as well as for each group of the mixed group convolution.
Revised: A direct translation of this technique from RNN to the group temporal convolution implies that we need to create a different mask for each diagonal of the network (i.e., each history starting point), as well as for each group of the mixed group convolution.

Original: We propose an alternative (and extremely simple) dropout scheme for TrellisNet, which is inspired by VD in RNNs as well as Theorem 1.
Revised: We propose an alternative (and extremely simple) dropout scheme for TrellisNet, which is inspired by VD in RNNs as well as Theorem 1.

Original: In
Revised: In

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: each iteration, we apply the same mask on the post-activation outputs, at every time step in both the temporal dimension and depth dimension.
Revised: each iteration, we apply the same mask on the post-activation outputs, at every time step in both the temporal dimension and depth dimension.

Original: That is, based on Eq.
Revised: That is, based on Eq.

Original: (6) in Theorem 1, we adapt VD to the TrellisNet setting by assuming h t,t (cid:48) ±
Revised: (6) in Theorem 1, we adapt VD to the TrellisNet setting by assuming h t,t (cid:48) ±

Original: δ ≈ h t,t (cid:48)
Revised: δ ≈ h t,t (cid:48)

Original: ; see Figure 7a.
Revised: ; see Figure 7a.

Original: Empirically, we found this dropout to work signiﬁcantly better than other dropout schemes (e.g. drop certain channels entirely).
Revised: Empirically, we found this dropout to work signiﬁcantly better than other dropout schemes (e.g. drop certain channels entirely).

Original: Recurrent weight dropout/DropConnect.
Revised: Recurrent weight dropout/DropConnect.

Original: We apply DropConnect on the TrellisNet kernel.
Revised: We apply DropConnect on the TrellisNet kernel.

Original: Merity et al.
Revised: Merity et al.

Original: (2018b) showed that regularizing hidden-to-hidden weights W hh can be useful in optimizing
Revised: (2018b) showed that regularizing hidden-to-hidden weights W hh can be useful in optimizing

Original: LSTM language models, and we carry this scheme over to trellis networks.
Revised: LSTM language models, and we carry this scheme over to trellis networks.

Original: B. F ROM C ONVOLUTIONAL N ETWORKS
Revised: B. F ROM C ONVOLUTIONAL N ETWORKS

Original: Dense convolutional kernel.
Revised: Dense convolutional kernel.

Original: Generalizing the convolution from a mixed group (sparse) one to a general (dense) convolution means the connections are no longer recurrent and we are computing directly on the hidden units with a large kernel, just like any temporal ConvNet.
Revised: Generalizing the convolution from a mixed group (sparse) one to a general (dense) convolution means the connections are no longer recurrent and we are computing directly on the hidden units with a large kernel, just like any temporal ConvNet.

Original: Deep supervision.
Revised: Deep supervision.

Original: Recall that for sparse TrellisNet to recover truncated RNN, at each level the hidden units are of the form h t,t (cid:48) , representing the state at time t if we assume the history started at time t (cid:48)
Revised: Recall that for sparse TrellisNet to recover truncated RNN, at each level the hidden units are of the form h t,t (cid:48) , representing the state at time t if we assume the history started at time t (cid:48)

Original: (Eq.
Revised: (Eq.

Original: We propose to inject the loss function at intermediate layers of the convolutional network (e.g., after every (cid:96) layers of transformations, where we call (cid:96) the auxiliary loss frequency).
Revised: We propose to inject the loss function at intermediate layers of the convolutional network (e.g., after every (cid:96) layers of transformations, where we call (cid:96) the auxiliary loss frequency).

Original: For example, during training, to predict an output at time t with a L -layer TrellisNet, besides z ( L ) t in the last layer, we can also apply the loss function on z ( L − (cid:96)
Revised: For example, during training, to predict an output at time t with a L -layer TrellisNet, besides z ( L ) t in the last layer, we can also apply the loss function on z ( L − (cid:96)

Original: [Equation]
Revised: [Equation]

Original: , etc. – where hidden units will predict with a shorter history because they are at lower levels of the network.
Revised: , etc. – where hidden units will predict with a shorter history because they are at lower levels of the network.

Original: This had been introduced for convolutional models in computer vision (Lee et al., 2015; Xie & Tu, 2015).
Revised: This had been introduced for convolutional models in computer vision (Lee et al., 2015; Xie & Tu, 2015).

Original: The eventual loss of the network will be:
Revised: The eventual loss of the network will be:

Original: [Equation]
Revised: [Equation]

Original: (16) where λ is a ﬁxed scaling factor that controls the weight of the auxiliary loss.
Revised: (16) where λ is a ﬁxed scaling factor that controls the weight of the auxiliary loss.

Original: Note that this technique is not directly transferrable (or applicable) to RNNs.
Revised: Note that this technique is not directly transferrable (or applicable) to RNNs.

Original: Larger kernel and dilations (Yu & Koltun, 2016).
Revised: Larger kernel and dilations (Yu & Koltun, 2016).

Original: These techniques have been used in convolutional networks to more quickly increase the receptive ﬁeld.
Revised: These techniques have been used in convolutional networks to more quickly increase the receptive ﬁeld.

Original: They can be immediately applied to trellis networks.
Revised: They can be immediately applied to trellis networks.

Original: Note that the activation function f of TrellisNet may need to change if we change the kernel size or dilation settings (e.g., with dilation d and kernel size 2, the activation will be f
Revised: Note that the activation function f of TrellisNet may need to change if we change the kernel size or dilation settings (e.g., with dilation d and kernel size 2, the activation will be f

Original: (ˆ z ( i ) 1: T , z ( i ) 1: T − d ) ).
Revised: (ˆ z ( i ) 1: T , z ( i ) 1: T − d ) ).

Original: Weight normalization (Salimans & Kingma, 2016).
Revised: Weight normalization (Salimans & Kingma, 2016).

Original: Weight normalization (WN) is a technique that learns the direction and the magnitude of the weight matrix independently.
Revised: Weight normalization (WN) is a technique that learns the direction and the magnitude of the weight matrix independently.

Original: Applying WN on the convolutional kernel was used in some prior works on temporal convolutional architectures (Dauphin et al., 2017; Bai et al., 2018), and have been found useful in regularizing the convolutional ﬁlters and boosting convergence.
Revised: Applying WN on the convolutional kernel was used in some prior works on temporal convolutional architectures (Dauphin et al., 2017; Bai et al., 2018), and have been found useful in regularizing the convolutional ﬁlters and boosting convergence.

Original: Parallelism.
Revised: Parallelism.

Original: Because TrellisNet is convolutional in nature, it can easily leverage the parallel processing in the convolution operation (which slides the kernel across the input features).
Revised: Because TrellisNet is convolutional in nature, it can easily leverage the parallel processing in the convolution operation (which slides the kernel across the input features).

Original: We note that when the input sequence is relatively long, the predictions of the ﬁrst few time steps will have insufﬁcient history context compared to the predictions later in the sequence.
Revised: We note that when the input sequence is relatively long, the predictions of the ﬁrst few time steps will have insufﬁcient history context compared to the predictions later in the sequence.

Original: This can be addressed by either history padding (mentioned in Appendix B.1) or chopping off the loss incurred by the ﬁrst few time steps.
Revised: This can be addressed by either history padding (mentioned in Appendix B.1) or chopping off the loss incurred by the ﬁrst few time steps.

Original: C B ENCHMARK T ASKS
Revised: C B ENCHMARK T ASKS

Original: Word-level language modeling on Penn Treebank (PTB).
Revised: Word-level language modeling on Penn Treebank (PTB).

Original: The original Penn Treebank (PTB) dataset selected 2,499 stories from a collection of almost 100K stories published in Wall Street Journal (WSJ) (Marcus et al., 1993).
Revised: The original Penn Treebank (PTB) dataset selected 2,499 stories from a collection of almost 100K stories published in Wall Street Journal (WSJ) (Marcus et al., 1993).

Original: After Mikolov et al.
Revised: After Mikolov et al.

Original: (2010) processed the corpus, the PTB dataset contains 888K words for training, 70K for validation and 79K for testing, where each sentence is marked with an <eos> tag at its end.
Revised: (2010) processed the corpus, the PTB dataset contains 888K words for training, 70K for validation and 79K for testing, where each sentence is marked with an <eos> tag at its end.

Original: All of the numbers (e.g. in ﬁnancial news) were replaced with a ? symbol with many punctuations removed.
Revised: All of the numbers (e.g. in ﬁnancial news) were replaced with a ? symbol with many punctuations removed.

Original: Though small, PTB has been a highly studied dataset in the domain of language modeling (Miyamoto & Cho, 2016;
Revised: Though small, PTB has been a highly studied dataset in the domain of language modeling (Miyamoto & Cho, 2016;

Original: Zilly et al., 2017; Merity et al., 2018b; Melis et al., 2018;
Revised: Zilly et al., 2017; Merity et al., 2018b; Melis et al., 2018;

Original: Yang et al., 2018).
Revised: Yang et al., 2018).

Original: Due to its relatively small size, many computational models can easily overﬁt on word-level PTB.
Revised: Due to its relatively small size, many computational models can easily overﬁt on word-level PTB.

Original: Therefore, good regularization methods and optimization techniques designed for sequence models are especially important on this benchmark task (Merity et al., 2018b).
Revised: Therefore, good regularization methods and optimization techniques designed for sequence models are especially important on this benchmark task (Merity et al., 2018b).

Original: Word-level language modeling on WikiText-103.
Revised: Word-level language modeling on WikiText-103.

Original: WikiText-103 (WT103) is 110 times larger than
Revised: WikiText-103 (WT103) is 110 times larger than

Original: PTB, containing a training corpus from 28K lightly processed Wikipedia articles (Merity et al., 2017).
Revised: PTB, containing a training corpus from 28K lightly processed Wikipedia articles (Merity et al., 2017).

Original: In total, WT103 features a vocabulary size of about 268K 1 , with 103M words for training, 218K words for validation, and 246K words for testing/evaluation.
Revised: In total, WT103 features a vocabulary size of about 268K 1 , with 103M words for training, 218K words for validation, and 246K words for testing/evaluation.

Original: The WT103 corpus also retains the original case, punctuation and numbers in the raw data, all of which were removed from the
Revised: The WT103 corpus also retains the original case, punctuation and numbers in the raw data, all of which were removed from the

Original: PTB corpus.
Revised: PTB corpus.

Original: Moreover, since WT103 is composed of full articles (whereas PTB is sentence-based), it is better suited for testing long-term context retention.
Revised: Moreover, since WT103 is composed of full articles (whereas PTB is sentence-based), it is better suited for testing long-term context retention.

Original: For these reasons, WT103 is typically considered much more representative and realistic than PTB (Merity et al., 2018a).
Revised: For these reasons, WT103 is typically considered much more representative and realistic than PTB (Merity et al., 2018a).

Original: Character-level language modeling on Penn Treebank (PTB).
Revised: Character-level language modeling on Penn Treebank (PTB).

Original: When used for character-level language modeling, PTB is a medium size dataset that contains 5M chracters for training, 396K for validation, and 446K for testing, with an alphabet size of 50 (note: the <eos> tag that marks the end of a sentence in word-level tasks is now considered one character).
Revised: When used for character-level language modeling, PTB is a medium size dataset that contains 5M chracters for training, 396K for validation, and 446K for testing, with an alphabet size of 50 (note: the <eos> tag that marks the end of a sentence in word-level tasks is now considered one character).

Original: While the alphabet size of char-level PTB is much smaller compared to the word-level vocabulary size (10K), there is much longer sequential token dependency because a sentence contains many more characters than words.
Revised: While the alphabet size of char-level PTB is much smaller compared to the word-level vocabulary size (10K), there is much longer sequential token dependency because a sentence contains many more characters than words.

Original: Sequential and permuted MNIST classiﬁcation.
Revised: Sequential and permuted MNIST classiﬁcation.

Original: The MNIST handwritten digits dataset (LeCun et al., 1989) contains 60K normalized training images and 10K testing images, all of size 28 × 28 .
Revised: The MNIST handwritten digits dataset (LeCun et al., 1989) contains 60K normalized training images and 10K testing images, all of size 28 × 28 .

Original: In the sequential MNIST task, MNIST images are presented to the sequence model as a ﬂattened 784 × 1 sequence for digit classiﬁcation.
Revised: In the sequential MNIST task, MNIST images are presented to the sequence model as a ﬂattened 784 × 1 sequence for digit classiﬁcation.

Original: Accurate predictions therefore require good long-term memory of the ﬂattened pixels – longer than in most language modeling tasks.
Revised: Accurate predictions therefore require good long-term memory of the ﬂattened pixels – longer than in most language modeling tasks.

Original: In the setting of permuted MNIST (PMNIST), the order of the sequence is permuted at random, so the network can no longer rely on local pixel features for classiﬁcation.
Revised: In the setting of permuted MNIST (PMNIST), the order of the sequence is permuted at random, so the network can no longer rely on local pixel features for classiﬁcation.

Original: Sequential CIFAR-10 classiﬁcation.
Revised: Sequential CIFAR-10 classiﬁcation.

Original: The CIFAR-10 dataset (Krizhevsky & Hinton, 2009) contains 50K images for training and 10K for testing, all of size 32 × 32 .
Revised: The CIFAR-10 dataset (Krizhevsky & Hinton, 2009) contains 50K images for training and 10K for testing, all of size 32 × 32 .

Original: In the sequential CIFAR-10 task, these images are passed into the model one at each time step, ﬂattended as in the MNIST tasks.
Revised: In the sequential CIFAR-10 task, these images are passed into the model one at each time step, ﬂattended as in the MNIST tasks.

Original: Compared to sequential MNIST, this task is more challenging.
Revised: Compared to sequential MNIST, this task is more challenging.

Original: For instance, CIFAR-10 contains more complex image structures and intra-class variations, and there are 3 channels to the input.
Revised: For instance, CIFAR-10 contains more complex image structures and intra-class variations, and there are 3 channels to the input.

Original: Moreover, as the images are larger, a sequence model needs to have even longer memory than in sequential MNIST or PMNIST (Trinh et al., 2018).
Revised: Moreover, as the images are larger, a sequence model needs to have even longer memory than in sequential MNIST or PMNIST (Trinh et al., 2018).

Original: D H YPERPARAMETERS AND A BLATION S TUDY
Revised: D H YPERPARAMETERS AND A BLATION S TUDY

Original: Table 4 speciﬁes the trellis networks used for the various tasks.
Revised: Table 5 speciﬁes the trellis networks used for the various tasks.

Original: There are a few things to note while reading the table.
Revised: There are a few things to note while reading the table.

Original: First, in training, we decay the learning rate once the validation error plateaus for a while (or according to some ﬁxed schedule, such as after 100 epochs).
Revised: First, in training, we decay the learning rate once the validation error plateaus for a while (or according to some ﬁxed schedule, such as after 100 epochs).

Original: Second, for auxiliary loss (see Appendix B for more details), we insert the loss function after every ﬁxed number of layers in the network.
Revised: Second, for auxiliary loss (see Appendix B for more details), we insert the loss function after every ﬁxed number of layers in the network.

Original: This “frequency” is included below under the “Auxiliary Frequency” entry.
Revised: This “frequency” is included below under the “Auxiliary Frequency” entry.

Original: Finally, the hidden dropout in the Table refers to the variational dropout we translated from RNNs (see Appendix B), which is applied at all hidden layers of the TrellisNet.
Revised: Finally, the hidden dropout in the Table refers to the variational dropout we translated from RNNs (see Appendix B), which is applied at all hidden layers of the TrellisNet.

Original: Due to the insight from
Revised: Due to the insight from

Original: Theorem 1, many techniques in TrellisNet were translated directly from RNNs or TCNs.
Revised: Theorem 1, many techniques in TrellisNet were translated directly from RNNs or TCNs.

Original: Thus, most of the hyperparameters were based on the numbers reported in prior works (e.g., embedding size, embedding dropout, hidden dropout, output dropout, optimizer, weight-decay, etc.) with minor adjustments (Merity et al., 2018b; Yang et al., 2018; Bradbury et al., 2017; Merity et al., 2018a;
Revised: Thus, most of the hyperparameters were based on the numbers reported in prior works (e.g., embedding size, embedding dropout, hidden dropout, output dropout, optimizer, weight-decay, etc.) with minor adjustments (Merity et al., 2018b; Yang et al., 2018; Bradbury et al., 2017; Merity et al., 2018a;

Original: Trinh et al., 2018; Bai et al., 2018; Santoro et al., 2018).
Revised: Trinh et al., 2018; Bai et al., 2018; Santoro et al., 2018).

Original: For factors such as auxiliary loss weight and frequency, we perform a basic grid search
Revised: For factors such as auxiliary loss weight and frequency, we perform a basic grid search

Original: [Table] [Table]
Revised: [Table] [Table]

Original: We have also performed an ablation study on TrellisNet to study the inﬂuence of various ingredients and techniques on performance.
Revised: We have also performed an ablation study on TrellisNet to study the inﬂuence of various ingredients and techniques on performance.

Original: We conduct the study on word-level PTB using a TrellisNet with 24M parameters.
Revised: We conduct the study on word-level PTB using a TrellisNet with 24M parameters.

Original: When we study one factor (e [Table] g., removing hidden dropout), all hyperparameters and settings remain the same as in column 1 of Table 4 (except for the “Dense Kernel”, where we adjust the number of hidden units so that the model size remains the same).
Revised: When we study one factor (e.g., removing hidden dropout), all hyperparameters and settings remain the same as in column 1 of Table 5 (except for the “Dense Kernel”, where we adjust the number of hidden units so that the model size remains the same).

Original: The results are as follows:
Revised: The results are as follows:

Original: [Table]
Revised: [Table]