{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/infogan","slug":"infogan","name":"InfoGAN","full_name":"InfoGAN","full_name_withheld":false,"description_markdown":"**InfoGAN** is a type of generative adversarial network that modifies the [GAN](https://paperswithcode.com/method/gan) objective to\r\nencourage it to learn interpretable and meaningful representations. This is done by maximizing the\r\nmutual information between a fixed small subset of the GAN’s noise variables and the observations.\r\n\r\nFormally, InfoGAN is defined as a minimax game with a variational regularization of mutual information and the hyperparameter $\\lambda$:\r\n\r\n$$ \\min\\_{G, Q}\\max\\_{D}V\\_{INFOGAN}\\left(D, G, Q\\right) = V\\left(D, G\\right) - \\lambda{L}\\_{I}\\left(G, Q\\right) $$\r\n\r\nWhere $Q$ is an auxiliary distribution that approximates the posterior $P\\left(c\\mid{x}\\right)$ - the probability of the latent code $c$ given the data $x$ - and $L\\_{I}$ is the variational lower bound of the mutual information between the latent code and the observations.\r\n\r\nIn the practical implementation, there is another fully-connected layer to output parameters for the conditional distribution $Q$ (negligible computation ontop of regular GAN structures). Q is represented with a [softmax](https://paperswithcode.com/method/softmax) non-linearity for a categorical latent code. For a continuous latent code, the authors assume a factored Gaussian.","description_state":"present","introduced_year":null,"introduced_by":{"title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","paper":"/paper/infogan-interpretable-representation-learning","first_author":"Xi Chen","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/infogan-interpretable-representation-learning"},"source":{"url":"http://arxiv.org/abs/1606.03657v1","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/eriklindernoren/PyTorch-GAN/blob/master/implementations/infogan/infogan.py","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Generative Adversarial Networks","url":"/methods/category/generative-adversarial-networks","pwc_aliases":[]},{"area":"Computer Vision","area_id":"computer-vision","collection":"Generative Models","url":"/methods/category/generative-models","pwc_aliases":[]}],"n_papers_tagged":35,"archive_num_papers":35,"papers_newest_first":[{"paper":null,"slug":"generative-adversarial-networks-bridging-art","title":"Generative Adversarial Networks Bridging Art and Machine Intelligence","date":"2025-02-06","arxiv_id":"2502.04116","n_code_links":0,"syntology":null},{"paper":null,"slug":"unsupervised-and-interpretable-synthesizing","title":"Unsupervised and Interpretable Synthesizing for Electrical Time Series Based on Information Maximizing Generative Adversarial Nets","date":"2024-07-18","arxiv_id":"2407.13691","n_code_links":0,"syntology":null},{"paper":"/paper/comparing-information-content-of","slug":"comparing-information-content-of","title":"Comparing the information content of probabilistic representation spaces","date":"2024-05-31","arxiv_id":"2405.21042","n_code_links":1,"syntology":null},{"paper":"/paper/double-infogan-for-contrastive-analysis","slug":"double-infogan-for-contrastive-analysis","title":"Double InfoGAN for Contrastive Analysis","date":"2024-01-31","arxiv_id":"2401.17776","n_code_links":1,"syntology":null},{"paper":null,"slug":"gan-ga-a-generative-model-based-on-genetic","title":"GAN-GA: A Generative Model based on Genetic Algorithm for Medical Image Generation","date":"2023-12-30","arxiv_id":"2401.00314","n_code_links":0,"syntology":null},{"paper":"/paper/fusing-conditional-submodular-gan-and","slug":"fusing-conditional-submodular-gan-and","title":"Fusing Conditional Submodular GAN and Programmatic Weak Supervision","date":"2023-12-16","arxiv_id":"2312.10366","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["kyrs/subpws-gan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"the-objective-function-equality-property-of","title":"The objective function equality property of infoGAN for two-layer network","date":"2023-09-30","arxiv_id":"2310.00443","n_code_links":0,"syntology":null},{"paper":"/paper/hsic-infogan-learning-unsupervised","slug":"hsic-infogan-learning-unsupervised","title":"HSIC-InfoGAN: Learning Unsupervised Disentangled Representations by Maximising Approximated Mutual Information","date":"2022-08-06","arxiv_id":"2208.03563","n_code_links":1,"syntology":null},{"paper":null,"slug":"k-sliced-mutual-information-a-quantitative","title":"k-Sliced Mutual Information: A Quantitative Study of Scalability with Dimension","date":"2022-06-17","arxiv_id":"2206.08526","n_code_links":0,"syntology":null},{"paper":null,"slug":"analytical-interpretation-of-latent-codes-in","title":"Analytical Interpretation of Latent Codes in InfoGAN with SAR Images","date":"2022-05-26","arxiv_id":"2205.13294","n_code_links":0,"syntology":null},{"paper":null,"slug":"latentgan-autoencoder-learning-disentangled","title":"LatentGAN Autoencoder: Learning Disentangled Latent Distribution","date":"2022-04-05","arxiv_id":"2204.02010","n_code_links":0,"syntology":null},{"paper":"/paper/contrastive-fine-grained-class-clustering-via-1","slug":"contrastive-fine-grained-class-clustering-via-1","title":"Contrastive Fine-grained Class Clustering via Generative Adversarial Networks","date":"2021-12-30","arxiv_id":"2112.14971","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":3,"phrase":"0 ran · 3 unverified","official":{"repos":["naver-ai/c3-gan"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"paper":null,"slug":"generative-adversarial-networks-and-4","title":"Generative Adversarial Networks and Adversarial Autoencoders: Tutorial and Survey","date":"2021-11-26","arxiv_id":"2111.13282","n_code_links":0,"syntology":null},{"paper":null,"slug":"inference-infogan-inference-independence-via","title":"Inference-InfoGAN: Inference Independence via Embedding Orthogonal Basis Expansion","date":"2021-10-02","arxiv_id":"2110.00788","n_code_links":0,"syntology":null},{"paper":null,"slug":"adis-gan-affine-disentangled-gan","title":"ADIS-GAN: Affine Disentangled GAN","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-representation-decomposition-for-feature","title":"Representation Decomposition for Image Manipulation and Beyond","date":"2020-11-02","arxiv_id":"2011.00788","n_code_links":0,"syntology":null},{"paper":null,"slug":"dpd-infogan-differentially-private","title":"DPD-InfoGAN: Differentially Private Distributed InfoGAN","date":"2020-10-22","arxiv_id":"2010.11398","n_code_links":0,"syntology":null},{"paper":"/paper/ciwgan-and-fiwgan-encoding-information-in","slug":"ciwgan-and-fiwgan-encoding-information-in","title":"CiwGAN and fiwGAN: Encoding information in acoustic data to model lexical learning with Generative Adversarial Networks","date":"2020-06-04","arxiv_id":"2006.02951","n_code_links":1,"syntology":null},{"paper":"/paper/disentanglement-based-active-learning","slug":"disentanglement-based-active-learning","title":"Disentanglement based Active Learning","date":"2019-12-15","arxiv_id":"1912.07018","n_code_links":1,"syntology":null},{"paper":null,"slug":"bridging-disentanglement-with-independence","title":"Towards Better Understanding of Disentangled Representations via Mutual Information","date":"2019-11-25","arxiv_id":"1911.10922","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-adversarial-networks-for-failure","title":"Generative Adversarial Networks for Failure Prediction","date":"2019-10-04","arxiv_id":"1910.02034","n_code_links":0,"syntology":null},{"paper":"/paper/elastic-infogan-unsupervised-disentangled","slug":"elastic-infogan-unsupervised-disentangled","title":"Elastic-InfoGAN: Unsupervised Disentangled Representation Learning in Class-Imbalanced Data","date":"2019-10-01","arxiv_id":"1910.01112","n_code_links":1,"syntology":null},{"paper":null,"slug":"generating-geological-facies-models-with","title":"Generating Geological Facies Models with Fidelity to Diversity and Statistics of Training Images using Improved Generative Adversarial Networks","date":"2019-09-23","arxiv_id":"1909.10652","n_code_links":0,"syntology":null},{"paper":"/paper/maximizing-mutual-information-for-tacotron","slug":"maximizing-mutual-information-for-tacotron","title":"Maximizing Mutual Information for Tacotron","date":"2019-08-30","arxiv_id":"1909.01145","n_code_links":2,"syntology":null},{"paper":null,"slug":"unsupervised-classification-of-street","title":"Unsupervised Classification of Street Architectures Based on InfoGAN","date":"2019-05-30","arxiv_id":"1905.12844","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-robotic-manipulation-through-visual","title":"Learning Robotic Manipulation through Visual Planning and Acting","date":"2019-05-11","arxiv_id":"1905.04411","n_code_links":0,"syntology":null},{"paper":"/paper/ib-gan-disentangled-representation-learning","slug":"ib-gan-disentangled-representation-learning","title":"IB-GAN: Disentangled Representation Learning with Information Bottleneck GAN","date":"2019-05-01","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":"/paper/social-ways-learning-multi-modal","slug":"social-ways-learning-multi-modal","title":"Social Ways: Learning Multi-Modal Distributions of Pedestrian Trajectories with GANs","date":"2019-04-20","arxiv_id":"1904.09507","n_code_links":1,"syntology":null},{"paper":"/paper/heartbeat-anomaly-detection-using-adversarial","slug":"heartbeat-anomaly-detection-using-adversarial","title":"Heartbeat Anomaly Detection using Adversarial Oversampling","date":"2019-01-28","arxiv_id":"1901.09972","n_code_links":1,"syntology":null},{"paper":null,"slug":"classification-of-sparsely-labeled-spatio","title":"Classification of sparsely labeled spatio-temporal data through semi-supervised adversarial learning","date":"2018-01-26","arxiv_id":"1801.08712","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-information-autoencoding-family-a-1","title":"The Information-Autoencoding Family: A Lagrangian Perspective on Latent Variable Generative Modeling","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-grounding-conceptual-spaces-in-neural","title":"Towards Grounding Conceptual Spaces in Neural Representations","date":"2017-06-15","arxiv_id":"1706.04825","n_code_links":0,"syntology":null},{"paper":"/paper/beta-vae-learning-basic-visual-concepts-with","slug":"beta-vae-learning-basic-visual-concepts-with","title":"beta-VAE: Learning Basic Visual Concepts with a Constrained Variational Framework","date":"2017-04-26","arxiv_id":null,"n_code_links":6,"syntology":null},{"paper":null,"slug":"image-generation-and-editing-with-variational","title":"Image Generation and Editing with Variational Info Generative AdversarialNetworks","date":"2017-01-17","arxiv_id":"1701.04568","n_code_links":0,"syntology":null},{"paper":"/paper/infogan-interpretable-representation-learning","slug":"infogan-interpretable-representation-learning","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","date":"2016-06-12","arxiv_id":"1606.03657","n_code_links":38,"syntology":{"ran":5,"of":6,"n_ran_checked":1,"n_instrument":4,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","official":null}}],"papers_shown":35,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":35,"with_a_code_link":14,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":35,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/infogan/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/infogan/papers/ran/1","json":"/method/infogan/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/disentanglement","name":"Disentanglement","papers":9},{"task":null,"name":"Generative Adversarial Network","papers":6},{"task":"/task/image-generation","name":"Image Generation","papers":6},{"task":"/task/representation-learning","name":"Representation Learning","papers":4},{"task":"/task/attribute","name":"Attribute","papers":3},{"task":"/task/classification","name":"General Classification","papers":3},{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/diversity","name":"Diversity","papers":2},{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":2},{"task":"/task/text-to-image-generation","name":"Text-to-Image Generation","papers":2},{"task":"/task/translation","name":"Translation","papers":2},{"task":"/task/unsupervised-image-classification","name":"Unsupervised Image Classification","papers":2},{"task":"/task/image-classification","name":"image-classification","papers":2},{"task":"/task/active-learning","name":"Active Learning","papers":1},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/decision-making","name":"Decision Making","papers":1}],"tasks_shown":20,"n_tasks":50,"usage_by_year":[{"year":"2016","papers":1},{"year":"2017","papers":3},{"year":"2018","papers":2},{"year":"2019","papers":11},{"year":"2020","papers":3},{"year":"2021","papers":4},{"year":"2022","papers":4},{"year":"2023","papers":3},{"year":"2024","papers":3},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/infogan"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=InfoGAN","read_at":"2026-10-05T00:58:01+00:00","query":"InfoGAN","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1606.03657"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1606.03657","repositories":{"listed":38,"in_graph":38,"list_truncated":false,"strongest_link":"mentioned_in_github"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1606.03657')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1606.03657","citations":4588},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'InfoGAN'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1606.03657","page":"/paper/infogan-interpretable-representation-learning","syntology_url":"https://syntology.ai/paper/1606.03657","in_graph_layer":true,"samples":6,"ran":5,"n_ran_checked":1,"n_instrument":4,"unverified":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 38 listed of 38 in the graph, strongest link: mentioned on GitHub. The lookup matched a paper by its title, arXiv:1606.03657, not a method entry. This answer is about arXiv:1606.03657, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"75535ba73a9c8e28da2266ce6f3c48f299e0cd69578151972675cdb7ecad3940","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}