A Projection Discriminator is a type of discriminator for generative adversarial networks. It is motivated by a probabilistic model in which the distribution of the conditional variable y given x is discrete or uni-modal continuous distributions.
If we look at the original solution for the loss function L_D in the vanilla GANs, we can decompose it into the sum of two log-likelihood ratios:
f∗(x,y)=logp(x∣y)p(y)q(x∣y)q(y)=logp(y∣x)q(y∣x)+logp(x)q(x)=r(y∣x)+r(x)
We can model the log likelihood ratio r(y∣x) and r(x) by some parametric functions f_1 and f_2 respectively. If we make a standing assumption that p(y∣x) and q(y∣x) are simple distributions like those that are Gaussian or discrete log linear on the feature space, then the parametrization of the following form becomes natural:
f(x,y;θ)=f_1(x,y;θ)+f_2(x;θ)=yTVϕ(x;θ_ϕ)+ψ(ϕ(x;θ_ϕ);θ_ψ)
where V is the embedding matrix of y, ϕ(⋅,θ_ϕ) is a vector output function of x, and ψ(⋅,θ_ψ) is a scalar function of the same ϕ(x;θ_ϕ) that appears in f_1. The learned parameters θ={V,θ_ϕ,θ_ψ} are trained to optimize the adversarial loss. This model of the discriminator is the projection.