{"url":"/sota/image-generation-on-celeba-256x256","task":{"name":"Image Generation","url":"/task/image-generation","note":null},"dataset":{"name":"CelebA 256x256","url":"/dataset/celeba"},"category":"Computer Vision","categories":["Computer Vision","Medical","Miscellaneous","Natural Language Processing"],"category_note":null,"description":"**Image Generation** (synthesis) is the task of generating new images from an existing dataset.\r\n\r\n- **Unconditional generation** refers to generating samples unconditionally from the dataset, i.e. $p(y)$\r\n- **[Conditional image generation](/task/conditional-image-generation)** (subtask) refers to generating samples conditionally from the dataset, based on a label, i.e. $p(y|x)$.\r\n\r\nIn this section, you can find state-of-the-art leaderboards for **unconditional generation**. For conditional  generation, and other types of image generations, refer to the subtasks.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [StyleGAN](https://github.com/NVlabs/stylegan) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["bpd","FID","bpd (8-bits)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"bpd":null,"FID":"lower","bpd (8-bits)":null}},"counts":{"rows":17,"rows_with_code":15,"rows_with_paper_page":17,"rows_dated":17,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Efficient-VDVAE","metrics":{"bpd":"0.51","bpd (8-bits)":"1.35"},"uses_additional_data":false,"paper_date":"2022-03-25","paper":"/paper/efficient-vdvae-less-is-more","paper_url":"https://arxiv.org/abs/2203.13751v2","paper_title":"Efficient-VDVAE: Less is more","code":"https://github.com/Rayhane-mamah/Efficient-VDVAE","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"SPN Menick and Kalchbrenner (2019)","metrics":{"bpd":"0.61"},"uses_additional_data":false,"paper_date":"2018-12-04","paper":"/paper/generating-high-fidelity-images-with-subscale","paper_url":"http://arxiv.org/abs/1812.01608v1","paper_title":"Generating High Fidelity Images with Subscale Pixel Networks and Multidimensional Upscaling","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"MaCow (Var)","metrics":{"bpd":"0.67"},"uses_additional_data":false,"paper_date":"2019-02-12","paper":"/paper/macow-masked-convolutional-generative-flow","paper_url":"https://arxiv.org/abs/1902.04208v5","paper_title":"MaCow: Masked Convolutional Generative Flow","code":"https://github.com/XuezheMax/wolf","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"LSGM","metrics":{"FID":"7.22","bpd":"0.70"},"uses_additional_data":false,"paper_date":"2021-06-10","paper":"/paper/score-based-generative-modeling-in-latent","paper_url":"https://arxiv.org/abs/2106.05931v3","paper_title":"Score-based Generative Modeling in Latent Space","code":"https://github.com/NVlabs/LSGM","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":5}},{"rank_in_archive_order":5,"model":"NVAE w/ flow","metrics":{"bpd":"0.70"},"uses_additional_data":false,"paper_date":"2020-07-08","paper":"/paper/nvae-a-deep-hierarchical-variational","paper_url":"https://arxiv.org/abs/2007.03898v3","paper_title":"NVAE: A Deep Hierarchical Variational Autoencoder","code":"https://github.com/NVlabs/NVAE","n_code_links":10,"syntology":{"n_ran":23,"n_unverified":18,"n_samples":41,"n_pointer_only_licence":23}},{"rank_in_archive_order":6,"model":"ANF Huang et al. (2020)","metrics":{"bpd":"0.72"},"uses_additional_data":false,"paper_date":"2020-02-17","paper":"/paper/augmented-normalizing-flows-bridging-the-gap","paper_url":"https://arxiv.org/abs/2002.07101v1","paper_title":"Augmented Normalizing Flows: Bridging the Gap Between Generative Flows and Latent Variable Models","code":"https://github.com/mj-will/augmented-flows","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"Locally Masked PixelCNN","metrics":{"bpd":"0.74"},"uses_additional_data":false,"paper_date":"2020-06-22","paper":"/paper/locally-masked-convolution-for-autoregressive","paper_url":"https://arxiv.org/abs/2006.12486v3","paper_title":"Locally Masked Convolution for Autoregressive Models","code":"https://github.com/ajayjain/lmconv","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"MaCow (Unf)","metrics":{"bpd":"0.95"},"uses_additional_data":false,"paper_date":"2019-02-12","paper":"/paper/macow-masked-convolutional-generative-flow","paper_url":"https://arxiv.org/abs/1902.04208v5","paper_title":"MaCow: Masked Convolutional Generative Flow","code":"https://github.com/XuezheMax/wolf","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"Residual Flow","metrics":{"bpd":"0.992"},"uses_additional_data":false,"paper_date":"2019-06-06","paper":"/paper/residual-flows-for-invertible-generative","paper_url":"https://arxiv.org/abs/1906.02735v6","paper_title":"Residual Flows for Invertible Generative Modeling","code":"https://github.com/rtqichen/residual-flows","n_code_links":4,"syntology":{"n_ran":5,"n_unverified":3,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"Glow (Kingma and Dhariwal, 2018)","metrics":{"bpd":"1.03"},"uses_additional_data":false,"paper_date":"2018-07-09","paper":"/paper/glow-generative-flow-with-invertible-1x1","paper_url":"http://arxiv.org/abs/1807.03039v2","paper_title":"Glow: Generative Flow with Invertible 1x1 Convolutions","code":"https://github.com/openai/glow","n_code_links":27,"syntology":{"n_ran":75,"n_unverified":54,"n_samples":129,"n_pointer_only_licence":44}},{"rank_in_archive_order":11,"model":"StyleSwin","metrics":{"FID":"3.25"},"uses_additional_data":false,"paper_date":"2021-12-20","paper":"/paper/styleswin-transformer-based-gan-for-high-1","paper_url":"https://arxiv.org/abs/2112.10762v2","paper_title":"StyleSwin: Transformer-based GAN for High-resolution Image Generation","code":"https://github.com/microsoft/StyleSwin","n_code_links":1,"syntology":{"n_ran":5,"n_unverified":0,"n_samples":5,"n_pointer_only_licence":3}},{"rank_in_archive_order":12,"model":"HiT-B","metrics":{"FID":"3.39"},"uses_additional_data":false,"paper_date":"2021-06-14","paper":"/paper/improved-transformer-for-high-resolution-gans","paper_url":"https://arxiv.org/abs/2106.07631v3","paper_title":"Improved Transformer for High-Resolution GANs","code":"https://github.com/google-research/hit-gan","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"VQGAN","metrics":{"FID":"10.2"},"uses_additional_data":false,"paper_date":"2020-12-17","paper":"/paper/taming-transformers-for-high-resolution-image","paper_url":"https://arxiv.org/abs/2012.09841v3","paper_title":"Taming Transformers for High-Resolution Image Synthesis","code":"https://github.com/CompVis/taming-transformers","n_code_links":13,"syntology":{"n_ran":6,"n_unverified":0,"n_samples":6,"n_pointer_only_licence":4}},{"rank_in_archive_order":14,"model":"StyleALAE","metrics":{"FID":"19.21"},"uses_additional_data":false,"paper_date":"2020-04-09","paper":"/paper/adversarial-latent-autoencoders","paper_url":"https://arxiv.org/abs/2004.04467v1","paper_title":"Adversarial Latent Autoencoders","code":"https://github.com/podgorskiy/ALAE","n_code_links":12,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"NCP-VAE","metrics":{"FID":"24.79"},"uses_additional_data":false,"paper_date":"2020-10-06","paper":"/paper/ncp-vae-variational-autoencoders-with-noise-1","paper_url":"https://arxiv.org/abs/2010.02917v3","paper_title":"A Contrastive Learning Approach for Training Variational Autoencoder Priors","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":16,"model":"MSP","metrics":{"FID":"35.0"},"uses_additional_data":false,"paper_date":"2019-07-26","paper":"/paper/latent-space-factorisation-and-manipulation","paper_url":"https://arxiv.org/abs/1907.12385v3","paper_title":"Latent Space Factorisation and Manipulation via Matrix Subspace Projection","code":"https://github.com/lissomx/MSP","n_code_links":2,"syntology":null},{"rank_in_archive_order":17,"model":"GLF+perceptual loss (ours)","metrics":{"FID":"41.8"},"uses_additional_data":false,"paper_date":"2019-05-24","paper":"/paper/generative-latent-flow-a-framework-for-non","paper_url":"https://arxiv.org/abs/1905.10485v2","paper_title":"Generative Latent Flow","code":"https://github.com/rakhimovv/GenerativeLatentFlow","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":12,"rows_with_any_sample_ran":9,"distinct_papers_with_graph_line":11,"distinct_papers_with_any_sample_ran":9,"samples_over_distinct_papers":{"n_ran":124,"n_unverified":85,"n_samples":209,"n_pointer_only_licence":79,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":124,"n_unverified":88,"n_samples":212,"n_pointer_only_licence":79,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}