A GAN-like architecture for text generation is proposed in 'Generative Adversarial Networks for Text Generation'.
The setup is the following:
- The generator of the GAN is proposed to be a recurrent neural network that its by itself a text generator.
- The internal latent vectors of the GAN ( denoted by $G(\vec{z})$ ) are the outputs of the generator RNN.
- The discriminator is not made explicit; but let's imagine that is "any architecture that can classify text into two categories" ("real" and "fake" in our case).
- The generator RNN is trained to minimize $(1- D(G(\vec{z})))$ (where $D(G(\vec{z})))$ is the discriminator output) as usual.
Now it comes a somewhat obscure statement:
Remember that while decoding using an RNN, at every time step we make the choice of the next word by picking the word corresponding to the maximum probability from the output of the softmax function. This “picking” operation is non-differentiable.
Question:
What is the precise statement of that vague paragraph?
My expectation is to explicitly write the function that is just continuous but not differentiable.
Thanks in advance!