{"url":"/sota/image-generation-on-cifar-100","task":{"name":"Image Generation","url":"/task/image-generation","note":null},"dataset":{"name":"CIFAR-100","url":"/dataset/cifar-100"},"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":["FID","Inception Score","Model Size (MB)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"FID":"lower","Inception Score":"higher","Model Size (MB)":null}},"counts":{"rows":9,"rows_with_code":9,"rows_with_paper_page":9,"rows_dated":9,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"LeCAM (StyleGAN2 + ADA)","metrics":{"FID":"2.99"},"uses_additional_data":false,"paper_date":"2021-04-07","paper":"/paper/regularizing-generative-adversarial-networks","paper_url":"https://arxiv.org/abs/2104.03310v1","paper_title":"Regularizing Generative Adversarial Networks under Limited Data","code":"https://github.com/google/lecam-gan","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":6,"n_samples":9,"n_pointer_only_licence":3}},{"rank_in_archive_order":2,"model":"TAC-GAN","metrics":{"FID":"7.22"},"uses_additional_data":false,"paper_date":"2019-12-01","paper":"/paper/twin-auxilary-classifiers-gan","paper_url":"http://papers.nips.cc/paper/8414-twin-auxilary-classifiers-gan","paper_title":"Twin Auxilary Classifiers GAN","code":"https://github.com/batmanlab/twin_ac","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"MMD-PMish-NAS","metrics":{"FID":"7.68","Inception Score":"10.68","Model Size (MB)":"17.9"},"uses_additional_data":false,"paper_date":"2024-10-23","paper":"/paper/enhancing-gans-with-mmd-neural-architecture","paper_url":"https://ieeexplore.ieee.org/document/10732016","paper_title":"Enhancing GANs with MMD Neural Architecture Search, PMish Activation Function, and Adaptive Rank Decomposition","code":"https://github.com/PrasannaPulakurthi/MMD-PMish-NAS","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"MMD-PMish-NAS (Compressed)","metrics":{"FID":"8.37","Inception Score":"10.34","Model Size (MB)":"2.3"},"uses_additional_data":false,"paper_date":"2024-10-23","paper":"/paper/enhancing-gans-with-mmd-neural-architecture","paper_url":"https://ieeexplore.ieee.org/document/10732016","paper_title":"Enhancing GANs with MMD Neural Architecture Search, PMish Activation Function, and Adaptive Rank Decomposition","code":"https://github.com/PrasannaPulakurthi/MMD-PMish-NAS","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"LeCAM (BigGAN + DA)","metrics":{"FID":"11.2"},"uses_additional_data":false,"paper_date":"2021-04-07","paper":"/paper/regularizing-generative-adversarial-networks","paper_url":"https://arxiv.org/abs/2104.03310v1","paper_title":"Regularizing Generative Adversarial Networks under Limited Data","code":"https://github.com/google/lecam-gan","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":6,"n_samples":9,"n_pointer_only_licence":3}},{"rank_in_archive_order":6,"model":"aw-AutoGAN","metrics":{"FID":"19","Inception Score":"8.9"},"uses_additional_data":false,"paper_date":"2020-12-05","paper":"/paper/adaptive-weighted-discriminator-for-training","paper_url":"https://arxiv.org/abs/2012.03149v2","paper_title":"Adaptive Weighted Discriminator for Training Generative Adversarial Networks","code":"https://github.com/vasily789/adaptive-weighted-gans","n_code_links":3,"syntology":null},{"rank_in_archive_order":7,"model":"aw-SN-GAN","metrics":{"FID":"19.08","Inception Score":"8.31"},"uses_additional_data":false,"paper_date":"2020-12-05","paper":"/paper/adaptive-weighted-discriminator-for-training","paper_url":"https://arxiv.org/abs/2012.03149v2","paper_title":"Adaptive Weighted Discriminator for Training Generative Adversarial Networks","code":"https://github.com/vasily789/adaptive-weighted-gans","n_code_links":3,"syntology":null},{"rank_in_archive_order":8,"model":"","metrics":{"FID":"19.72"},"uses_additional_data":false,"paper_date":"2021-02-09","paper":"/paper/negative-data-augmentation-1","paper_url":"https://arxiv.org/abs/2102.05113v1","paper_title":"Negative Data Augmentation","code":"https://github.com/ermongroup/NDA","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":9,"model":"MSGAN","metrics":{"FID":"19.74"},"uses_additional_data":false,"paper_date":"2019-11-16","paper":"/paper/self-supervised-gan-analysis-and-improvement-1","paper_url":"https://arxiv.org/abs/1911.06997v2","paper_title":"Self-supervised GAN: Analysis and Improvement with Multi-class Minimax Game","code":"https://github.com/tntrung/msgan","n_code_links":1,"syntology":null}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"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":3,"rows_with_any_sample_ran":3,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":4,"n_unverified":6,"n_samples":10,"n_pointer_only_licence":4,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":7,"n_unverified":12,"n_samples":19,"n_pointer_only_licence":7,"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"}}}