Therefore, we define the following reward: where u is the node where the agent is located and u * is the closest tree node that contains the answer (n(u) is the node index as defined above).
word-level embedding For every i = 1, ..., n, every j = 1, ..., m and every k = 1, ..., r, we create an embedding of the input tokens q i , o j , z k in two steps.