Papers › Return of Unconditional Generation: A Self-supervised Representation Generation Method
Return of Unconditional Generation: A Self-supervised Representation Generation Method
Tianhong Li, Dina Katabi, Kaiming He
Unconditional generation -- the problem of modeling data distribution without relying on human-annotated labels -- is a long-standing and fundamental challenge in generative models, creating a potential of learning from large-scale unlabeled data. In the literature, the generation quality of an unconditional method has been much worse than that of its conditional counterpart. This gap can be attributed to the lack of semantic information provided by labels. In this work, we show that one can close this gap by generating semantic representations in the representation space produced by a self-supervised encoder. These representations can be used to condition the image generator. This framework, called Representation-Conditioned Generation (RCG), provides an effective solution to the unconditional generation problem without using labels. Through comprehensive experiments, we observe that RCG significantly improves unconditional generation quality: e.g., it achieves a new state-of-the-art FID of 2.15 on ImageNet 256x256, largely reducing the previous best of 5.91 by a relative 64%. Our unconditional results are situated in the same tier as the leading class-conditional ones. We hope these encouraging observations will attract the community's attention to the fundamental problem of unconditional generation. Code is available at https://github.com/LTH14/rcg.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2312.03701")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2312.03701", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2312.03701")
Code
Syntology 18 code samples harvested from 1 repository linked to this paper: 12 ran (of which 7 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified. Where Syntology's instrument failed: 3 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 18 samples from 1 repository, 12 ran (9 with no instrument failure; 3 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
18 samples harvested: 12 ran (of which 7 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 0 of the 18 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from LTH14/rcg. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 4 samples that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
census: 13 implementations from 12 papers, 10 distinct outputs across 4 buckets, one shared input per bucket pixel_generator/mage/models_mage.py ran MIT (permissive) ·
33aedbcfd18d75e0 · report
fixture: signature x:Tensor/3/float · returned tuple · level recorded 2026-09-24 63c52efe80c94cb3 · report
fixture: returned BertEmbeddings · level recorded 2026-09-22 census: 5 implementations from 5 papers, 3 distinct outputs across 2 buckets, one shared input per bucket pixel_generator/mage/models_mage.py ran MIT (permissive) ·
607e78af8a011f8d · report
fixture: returned Block · level recorded 2026-09-22 950818a420758dbe · report
fixture: returned DDIMSampler · level recorded 2026-09-22 9c54ac910ba566df · report
fixture: returned Decoder · level recorded 2026-09-22 2deab9d7e8ce0dcd · report
fixture: returned Encoder · level recorded 2026-09-22 72ec0347648af855 · report
fixture: returned MlmLayer · level recorded 2026-09-22 30fa834a4a883839 · report
fixture: signature x:Tensor/4/float, temb:Tensor/2/float · returned Tensor · level recorded 2026-09-24 9d2f5c397afb9f4b · report
fixture: returned VectorQuantizer · level recorded 2026-09-22 43b98b8b55d12a3d · report
fixture: signature model:callable/0/?, ckpt_path:str/0/str · returned MinimalModel · level recorded 2026-09-22 c6c33009466a11bc · report
fixture: signature model:callable/0/?, ckpt_path:str/0/str · returned SimpleModel · level recorded 2026-09-22 606b6d93861e426d · report
fixture: signature model:callable/0/?, ckpt_path:str/0/str · returned MinimalModel · level recorded 2026-09-22 928ed9eea191af30 · report
43c459d4c7f134b2 · report
bf19fad78c0d01dd · report
751c98281389ad11 · report
92679b16417e54ec · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.
1 assembly on this paper: 1 harvested, 0 generated.
harvested Assembly for Representation-Conditioned Generation (RCG) (graph method: Representation-Conditioned Generation (RCG)). 33 bricks; individually on a fixture: 24 ran (of which 11 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 0 violated, 13 with no contract checked; 9 where Syntology's instrument failed) · 9 unverified. The assembly has not been run end-to-end.
- MaskedGenerativeEncoderViT entry · level 0 · unverified ·
928ed9eea191af30 - BertEmbeddings model · level 1 · ran ·
63c52efe80c94cb3 - Block model · level 1 · ran ·
607e78af8a011f8d - DDIMSampler helper · level 1 · ran ·
950818a420758dbe - LabelSmoothingCrossEntropy loss · level 1 · ran ·
60f4e5c9241d5bc8 - MlmLayer model · level 1 · ran ·
72ec0347648af855 - VQModel helper · level 0 · unverified ·
5ff5b3c39cac8e4d - get_2d_sincos_pos_embed helper · level 1 · ran · honoured contract ·
5a37690a13a6157d - load_model helper · level 0 · unverified ·
43c459d4c7f134b2 - load_pretrained_deit helper · level 1 · ran · our draft was wrong ·
43b98b8b55d12a3d - load_pretrained_dino helper · level 0 · unverified ·
751c98281389ad11 - load_pretrained_ibot helper · level 1 · ran · our draft was wrong ·
c6c33009466a11bc - load_pretrained_moco helper · level 1 · ran · our draft was wrong ·
606b6d93861e426d - mask_by_random_topk helper · level 0 · unverified ·
92679b16417e54ec - Attention model · level 1 · ran ·
33aedbcfd18d75e0 - make_ddim_sampling_parameters helper · level 1 · ran; the contract check could not run ·
3ee640131c9d4362 - make_ddim_timesteps helper · level 1 · ran · honoured contract ·
0ea4e960ea54514c - noise_like helper · level 1 · ran; the contract check could not run ·
2d7200ac60d9a4bd - Decoder helper · level 1 · ran ·
9c54ac910ba566df - Encoder helper · level 1 · ran ·
2deab9d7e8ce0dcd - VectorQuantizer helper · level 1 · ran ·
9d2f5c397afb9f4b - get_2d_sincos_pos_embed_from_grid helper · level 0 · unverified ·
2884deadbb637c3e - load_model_from_config helper · level 0 · unverified ·
bf19fad78c0d01dd - checkpoint helper · level 0 · unverified ·
6fe195fcfd10e259 - Normalize helper · level 1 · ran · our draft was wrong ·
c3a6b977022957cb - ResnetBlock helper · level 1 · ran ·
30fa834a4a883839 - Upsample helper · level 1 · ran ·
726c85e75dfdfeb8 - nonlinearity helper · level 1 · ran · our draft was wrong ·
3137073275f8c21a - Downsample helper · level 1 · ran ·
f86ae8958e076367 - get_1d_sincos_pos_embed_from_grid helper · level 1 · ran; the contract check could not run ·
5c8ea92d43ead77d - instantiate_from_config helper · level 0 · unverified ·
ef52d142b2c30ac2 - CheckpointFunction helper · level 1 · ran ·
69360f5b0cc8f069 - get_obj_from_str helper · level 1 · ran · our draft was wrong ·
221b2d116fdf1032
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2312.03701") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Image Generation | ImageNet 256x256 | RCG-L (w/o guidance) | FID | 3.49 | #71 of 94 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections