We first apply a narrow convolution between C and a filter F ∈ R d×n of width n to obtain a feature map f ∈ R k−n+1 .
the computation of the j-th element of f is defined as where A, B = Tr(AB T ) is the Frobenius inner product and b is a bias.