In our case,d is usually very high (e.g., 512 or 2048 in [35, 16]), which results in much higher dimensional representations [28, 38] and suffering from high computation and memory costs.
To overcome this problem, we adopt polynomial kernel approximation based high-order methods [4], which can efficiently generate low-dimensional high-order representations. To this end, the kernel representation can be reformulated with1×1 convolution operation followed by element-wise product
您好,读了您的paper和code,有些疑问想咨询下:
1节4段指出:
有2个疑问:
麻烦了!!