We lifted 1 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| datang1992/Correlated-VAEs | canonical | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| my_relu | Ran | datang1992/Correlated-VAEs/src/process_tree_data.py code served (permissive licence) · get_code("b40a266069487cc9") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Variational Auto-Encoders (VAEs) are capable of learning latent representations for high dimensional data. However, due to the i.i.d. assumption, VAEs only optimize the singleton variational distributions and fail to account for the correlations between data points, which might be crucial for learning latent representations from dataset where a priori we know correlations exist. We propose Correlated Variational Auto-Encoders (CVAEs) that can take the correlation structure into consideration when learning latent representations with VAEs. CVAEs apply a prior based on the correlation structure. To address the intractability introduced by the correlated prior, we develop an approximation by average of a set of tractable lower bounds over all maximal acyclic subgraphs of the undirected correlation graph. Experimental results on matching and link prediction on public benchmark rating datasets and spectral clustering on a synthetic dataset show the effectiveness of the proposed method over baseline algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1905.05335")
get_code_for_paper("1905.05335")
have("1905.05335")
Connect an agent — have() is free.