We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Variational autoencoders are prominent generative models for modeling discrete data. However, with flexible decoders, they tend to ignore the latent codes. In this paper, we study a VAE model with a deterministic decoder (DD-VAE) for sequential data that selects the highest-scoring tokens instead of sampling. Deterministic decoding solely relies on latent codes as the only way to produce diverse objects, which improves the structure of the learned manifold. To implement DD-VAE, we propose a new class of bounded support proposal distributions and derive Kullback-Leibler divergence for Gaussian and uniform priors. We also study a continuous relaxation of deterministic decoding objective function and analyze the relation of reconstruction accuracy and relaxation parameters. We demonstrate the performance of DD-VAE on multiple datasets, including molecular generation and optimization problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.02174")
get_code_for_paper("2003.02174")
have("2003.02174")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.02174.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.02174)
Connect an agent — have() is free.