SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1802.08406 · 2018

Solving Linear Inverse Problems Using GAN Priors: An Algorithm with Provable Guarantees

arXiv · PDF · Open in the Atlas

Code that ran

1 of 6 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 1 has no contract verdict; 0 failures of our instrument; 5 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/1802.08406.json · badge: /api/ran/1802.08406.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
shahviraj/pgdgan community (classifier label)
classifier basis not recorded on the link
1 ran · 5 no recorded run
FunctionStatusWhere it lives
conv_cond_concat Ran
ran on a synthesized input
shahviraj/pgdgan/celebA_dcgan/ops.py
code served (permissive licence) · get_code("bcb75c6ee41f4e8c")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned SymbolicTensor. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import tensorflow as tf
import numpy as np

# Create small test tensors
# x: feature map tensor with shape [batch, height, width, channels]
# y: conditioning vector with shape [batch, 1, 1, cond_channels]

batch_size = 2
height = 4
width = 3
x_channels = 5
y_channels = 6

# Create x as a feature map (batch, height, width, channels)
x = tf.constant(np.random.randn(batch_size, height, width, x_channels), dtype=tf.float32)

# Create y as a conditioning vector (batch, 1, 1, channels)
y = tf.constant(np.random.randn(batch_size, 1, 1, y_channels), dtype=tf.float32)

ARGS = {
    'x': x,
    'y': y,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, tensorflow — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type SymbolicTensor — a SymbolicTensor output has no array shape of its own; none is stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
deconv2d Not yet run
unverified (harvested, no recorded run)
shahviraj/pgdgan/celebA_dcgan/ops.py
code served (permissive licence) · get_code("e4d1391909610011")
How it ran

no invocation recorded.

get_image Not yet run
unverified (harvested, no recorded run)
shahviraj/pgdgan/src/dcgan_utils.py
code served (permissive licence) · get_code("0639b692497f7a55")
How it ran

no invocation recorded.

imread Not yet run
unverified (harvested, no recorded run)
shahviraj/pgdgan/src/dcgan_utils.py
code served (permissive licence) · get_code("8008047e6224c0e5")
How it ran

no invocation recorded.

linear Not yet run
unverified (harvested, no recorded run)
shahviraj/pgdgan/celebA_dcgan/ops.py
code served (permissive licence) · get_code("52f4c4d5640407e3")
How it ran

no invocation recorded.

save_images Not yet run
unverified (harvested, no recorded run)
shahviraj/pgdgan/src/dcgan_utils.py
code served (permissive licence) · get_code("7106489a5f1b418d")
How it ran

no invocation recorded.

Also present in other papers' code

Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 6 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 0 the same month, 4 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
save_images 7 other papers
1 dated earlier, 6 later
1703.03208 (2017-03)
Compressed Sensing using Generative Models
1811.03205 (2018-11)
Robustness of Conditional GANs to Noisy Labels
1907.10830 (2019-07)
U-GAT-IT: Unsupervised Generative Attentional Networks with Adaptive Layer-Instance Normalization for Image-to-Image Translation
and 4 more not named here
conv_cond_concat 2 other papers
1 dated earlier, 1 later
1611.07004 (2016-11)
Image-to-Image Translation with Conditional Adversarial Networks
1807.01442 (2018-07)
Modeling Sparse Deviations for Compressed Sensing using Generative Models
get_image 2 other papers
2 dated earlier
1701.04722 (2017-01)
Adversarial Variational Bayes: Unifying Variational Autoencoders and Generative Adversarial Networks
1703.03208 (2017-03)
Compressed Sensing using Generative Models
deconv2d 1 other paper
1 later
1807.01442 (2018-07)
Modeling Sparse Deviations for Compressed Sensing using Generative Models
imread 1 other paper
1 dated earlier
1703.03208 (2017-03)
Compressed Sensing using Generative Models
linear 1 other paper
1 later
1807.01442 (2018-07)
Modeling Sparse Deviations for Compressed Sensing using Generative Models

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

In recent works, both sparsity-based methods as well as learning-based methods have proven to be successful in solving several challenging linear inverse problems. However, sparsity priors for natural signals and images suffer from poor discriminative capability, while learning-based methods seldom provide concrete theoretical guarantees. In this work, we advocate the idea of replacing hand-crafted priors, such as sparsity, with a Generative Adversarial Network (GAN) to solve linear inverse problems such as compressive sensing. In particular, we propose a projected gradient descent (PGD) algorithm for effective use of GAN priors for linear inverse problems, and also provide theoretical guarantees on the rate of convergence of this algorithm. Moreover, we show empirically that our algorithm demonstrates superior performance over an existing method of leveraging GANs for compressive sensing.

For agents

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

get_harvested_code_for_paper("1802.08406")
get_code_for_paper("1802.08406")
have("1802.08406")

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

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

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

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

Connect an agent — have() is free.