SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1906.09531 · 2019

Bias Correction of Learned Generative Models using Likelihood-Free Importance Weighting

arXiv · PDF · Open in the Atlas

Code that ran

1 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 2 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1906.09531.json · badge: /api/ran/1906.09531.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
kevtran23/autoregressive_bias_correction reimplementation (classifier label)
classifier basis: classifier_2025
1 ran · 2 no recorded run
FunctionStatusWhere it lives
reduce Ran
ran; our contract draft was wrong, not the code
kevtran23/autoregressive_bias_correction/GRAN/runner/classifier.py
pointer only (licence: NONE) · get_code("0d5fd0c9a54335f2")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kevtran23/autoregressive_bias_correction when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

load_graph_list Not yet run
unverified (harvested, no recorded run)
kevtran23/autoregressive_bias_correction/GRAN/runner/classifier.py
pointer only (licence: NONE) · get_code("b9b91e5c51f3fc70")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kevtran23/autoregressive_bias_correction when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

pick_connected_component_new Not yet run
unverified (harvested, no recorded run)
kevtran23/autoregressive_bias_correction/GRAN/runner/classifier.py
pointer only (licence: NONE) · get_code("b231e12a086b9714")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kevtran23/autoregressive_bias_correction when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
reduce 2 other papers
2 later
2107.04755 (2021-07)
Beyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering
2606.20443 (2026-06)
Topological Data Analysis for High-Dimensional Dynamic Process Monitoring
load_graph_list 1 other paper
1 later
1910.00760 (2019-10)
Efficient Graph Generation with Graph Recurrent Attention Networks
pick_connected_component_new 1 other paper
1 later
1910.00760 (2019-10)
Efficient Graph Generation with Graph Recurrent Attention Networks

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

A learned generative model often produces biased statistics relative to the underlying data distribution. A standard technique to correct this bias is importance sampling, where samples from the model are weighted by the likelihood ratio under model and true distributions. When the likelihood ratio is unknown, it can be estimated by training a probabilistic classifier to distinguish samples from the two distributions. We employ this likelihood-free importance weighting method to correct for the bias in generative models. We find that this technique consistently improves standard goodness-of-fit metrics for evaluating the sample quality of state-of-the-art deep generative models, suggesting reduced bias. Finally, we demonstrate its utility on representative applications in a) data augmentation for classification using generative adversarial networks, and b) model-based policy evaluation using off-policy data.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1906.09531")
get_code_for_paper("1906.09531")
have("1906.09531")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1906.09531.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1906.09531.svg)](https://syntology.ai/paper/1906.09531)

Connect an agent — have() is free.