/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserved. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */ #include "paddle/fluid/operators/conv_shift_op.h" #include "paddle/fluid/framework/eigen.h" namespace paddle { namespace operators { using framework::Tensor; template using EigenMatrix = framework::EigenMatrix; class ConvShiftOp : public framework::OperatorWithKernel { public: using framework::OperatorWithKernel::OperatorWithKernel; void InferShape(framework::InferShapeContext *ctx) const override { PADDLE_ENFORCE(ctx->HasInput("X"), "Input(X) should be not null."); PADDLE_ENFORCE(ctx->HasInput("Y"), "Input(Y) should be not null."); PADDLE_ENFORCE(ctx->HasOutput("Out"), "Output(Out) should be not null."); auto x_dims = ctx->GetInputDim("X"); auto y_dims = ctx->GetInputDim("Y"); PADDLE_ENFORCE_EQ(x_dims.size(), 2, "Input(X)'s rank should be 2."); PADDLE_ENFORCE_EQ(y_dims.size(), 2, "Input(Y)'s rank should be 2."); PADDLE_ENFORCE_EQ(x_dims[0], y_dims[0], "The 1st dimension of Input(X) and Input(Y) should " "be equal."); PADDLE_ENFORCE_EQ(y_dims[1] % 2, 1, "The 2nd dimension of Input(Y) should be odd."); PADDLE_ENFORCE_LE(y_dims[1], x_dims[1], "The 2nd dimension of Input(Y) should be less than or " "equal to the 2nd dimension of Input(X)."); ctx->SetOutputDim("Out", x_dims); ctx->ShareLoD("X", /*->*/ "Out"); } }; class ConvShiftGradOp : public framework::OperatorWithKernel { public: using framework::OperatorWithKernel::OperatorWithKernel; void InferShape(framework::InferShapeContext *ctx) const override { PADDLE_ENFORCE(ctx->HasInput("X"), "Input(X) should be not null."); PADDLE_ENFORCE(ctx->HasInput("Y"), "Input(Y) should be not null."); PADDLE_ENFORCE(ctx->HasInput(framework::GradVarName("Out")), "Input(Out@GRAD) should be not null."); auto x_grad_name = framework::GradVarName("X"); if (ctx->HasOutput(x_grad_name)) { auto x_dims = ctx->GetInputDim("X"); ctx->SetOutputDim(x_grad_name, x_dims); } auto y_grad_name = framework::GradVarName("Y"); if (ctx->HasOutput(y_grad_name)) { auto y_dims = ctx->GetInputDim("Y"); ctx->SetOutputDim(y_grad_name, y_dims); } } }; class ConvShiftOpMaker : public framework::OpProtoAndCheckerMaker { public: ConvShiftOpMaker(OpProto *proto, OpAttrChecker *op_checker) : framework::OpProtoAndCheckerMaker(proto, op_checker) { AddInput("X", "(Tensor, default Tensor), a 2-D tensor with shape B x M, " "where B is the batch size and M is the data dimension."); AddInput("Y", "(Tensor, default Tensor), a 2-D tensor with shape B x N, " "where B is the batch size and N is the data dimension. N must " "be odd."); AddOutput("Out", "(Tensor, default Tensor), a 2-D tensor with shape B x M, " "i.e., the same shape as X."); AddComment(R"DOC( ConvShift Operator. A layer for circular convolution of two vectors, as used in the Neural Turing Machine: https://arxiv.org/abs/1410.5401 The equation is: $$Out[i] = \sum_{j=-(N-1)/2}^{(N-1)/2} X_{i+j} * Y_{j}$$ where X's index is computed modulo M, and Y's index is computed modulo N. Both inputs X and Y can carry LoD (Level of Details) information. However, the output only shares the LoD information with input X. )DOC"); } }; template class ConvShiftKernel : public framework::OpKernel { public: void Compute(const framework::ExecutionContext &context) const override { auto *X = context.Input("X"); auto *Y = context.Input("Y"); auto *Out = context.Output("Out"); Out->mutable_data(context.GetPlace()); auto x = EigenMatrix::From(*X); auto y = EigenMatrix::From(*Y); auto out = EigenMatrix::From(*Out); out.setZero(); size_t batch_size = X->dims()[0]; size_t x_width = X->dims()[1]; size_t y_width = Y->dims()[1]; size_t y_half_width = (y_width - 1) / 2; for (size_t k = 0; k < batch_size; ++k) { for (size_t i = 0; i < x_width; ++i) { for (size_t j = 0; j < y_width; ++j) { int index = (i + j - y_half_width + x_width) % x_width; out(k, i) += x(k, index) * y(k, j); } } } } }; template class ConvShiftGradKernel : public framework::OpKernel { public: void Compute(const framework::ExecutionContext &context) const override { auto *X = context.Input("X"); auto *Y = context.Input("Y"); auto *dOut = context.Input(framework::GradVarName("Out")); auto *dX = context.Output(framework::GradVarName("X")); auto *dY = context.Output(framework::GradVarName("Y")); auto x = EigenMatrix::From(*X); auto y = EigenMatrix::From(*Y); auto dout = EigenMatrix::From(*dOut); auto x_dims = X->dims(); auto y_dims = Y->dims(); size_t batch_size = x_dims[0]; size_t x_width = x_dims[1]; size_t y_width = y_dims[1]; size_t y_half_width = (y_width - 1) / 2; // The below trades code duplication for efficiency (keeping the if // statement outside of the loop). if (dX) { dX->mutable_data(context.GetPlace()); auto dx = EigenMatrix::From(*dX); dx.setZero(); for (size_t k = 0; k < batch_size; ++k) { for (size_t i = 0; i < x_width; ++i) { for (size_t j = 0; j < y_width; ++j) { int index = (i + j - y_half_width + x_width) % x_width; dx(k, index) += dout(k, i) * y(k, j); } } } } if (dY) { dY->mutable_data(context.GetPlace()); auto dy = EigenMatrix::From(*dY); dy.setZero(); for (size_t k = 0; k < batch_size; ++k) { for (size_t i = 0; i < x_width; ++i) { for (size_t j = 0; j < y_width; ++j) { int index = (i + j - y_half_width + x_width) % x_width; dy(k, j) += x(k, index) * dout(k, i); } } } } } }; } // namespace operators } // namespace paddle namespace ops = paddle::operators; REGISTER_OPERATOR(conv_shift, ops::ConvShiftOp, ops::ConvShiftOpMaker, paddle::framework::DefaultGradOpDescMaker) REGISTER_OPERATOR(conv_shift_grad, ops::ConvShiftGradOp) REGISTER_OP_CPU_KERNEL(conv_shift, ops::ConvShiftKernel); REGISTER_OP_CPU_KERNEL( conv_shift_grad, ops::ConvShiftGradKernel);