File tree Expand file tree Collapse file tree 1 file changed +5
-5
lines changed Expand file tree Collapse file tree 1 file changed +5
-5
lines changed Original file line number Diff line number Diff line change @@ -109,23 +109,23 @@ from future subsequences in a computationally efficient manner to improve
109
109
unidirectional recurrent neural networks. The row convolution operator is
110
110
different from the 1D sequence convolution, and is computed as follows:
111
111
112
- Given an input sequence $in $ of length $t$ and input dimension $d $,
113
- and a filter ($W$) of size $context \times d$,
112
+ Given an input sequence $X $ of length $t$ and input dimension $D $,
113
+ and a filter ($W$) of size $context \times D$,
114
114
the output sequence is convolved as:
115
115
116
116
$$
117
- out_{i, : } = \\sum_{j=i}^{i + context} in_{j,: } \\cdot W_{i-j, : }
117
+ out_{i} = \\sum_{j=i}^{i + context - 1} X_{j } \\cdot W_{j-i }
118
118
$$
119
119
120
120
In the above equation:
121
121
122
122
* $Out_{i}$: The i-th row of output variable with shape [1, D].
123
123
124
- * $\\tau $: Future context size.
124
+ * $context $: Future context size.
125
125
126
126
* $X_{j}$: The j-th row of input variable with shape [1, D].
127
127
128
- * $W_{i-j }$: The (i-j )-th row of parameters with shape [1, D].
128
+ * $W_{j-i }$: The (j-i )-th row of parameters with shape [1, D].
129
129
130
130
More details about row_conv please refer to
131
131
the design document
You can’t perform that action at this time.
0 commit comments