Given a document x, its hashing code can be obtained through two steps: 1) mapping x to its latent representation by z = µ φ (x), where the µ φ (x) is the encoder mean µ φ (•); 2) thresholding z into binary form.
it is shown that the endto-end training brings a remarkable performance improvement over the two-stage training method in VDSH.