Intuitively, we want to learn to maximize ∆.
the DSSM is learned to represent documents as points in a hidden interestingness space, where the similarity between a document and its interesting documents is maximized.