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 |
|---|---|---|
| neychev/adversarial_variational_optimization | reimplementation | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| get_gradient_penalty | Ran | neychev/adversarial_variational_optimization/code_AVO.py pointer only (licence: NONE) · get_code("0c3df06e0b447cd6") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Complex computer simulators are increasingly used across fields of science as generative models tying parameters of an underlying theory to experimental observations. Inference in this setup is often difficult, as simulators rarely admit a tractable density or likelihood function. We introduce Adversarial Variational Optimization (AVO), a likelihood-free inference algorithm for fitting a non-differentiable generative model incorporating ideas from generative adversarial networks, variational optimization and empirical Bayes. We adapt the training procedure of generative adversarial networks by replacing the differentiable generative network with a domain-specific simulator. We solve the resulting non-differentiable minimax problem by minimizing variational upper bounds of the two adversarial objectives. Effectively, the procedure results in learning a proposal distribution over simulator parameters, such that the JS divergence between the marginal distribution of the synthetic data and the empirical distribution of observed data is minimized. We evaluate and compare the method with simulators producing both discrete and continuous data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1707.07113")
get_code_for_paper("1707.07113")
have("1707.07113")
Connect an agent — have() is free.