{"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":"/paper/quaternion-generative-adversarial-networks","title":"Quaternion Generative Adversarial Networks","arxiv_id":"2104.09630","date":"2021-04-19","proceeding":null,"authors":["Eleonora Grassucci","Edoardo Cicero","Danilo Comminiello"],"abstract":"Latest Generative Adversarial Networks (GANs) are gathering outstanding results through a large-scale training, thus employing models composed of millions of parameters requiring extensive computational capabilities. Building such huge models undermines their replicability and increases the training instability. Moreover, multi-channel data, such as images or audio, are usually processed by realvalued convolutional networks that flatten and concatenate the input, often losing intra-channel spatial relations. To address these issues related to complexity and information loss, we propose a family of quaternion-valued generative adversarial networks (QGANs). QGANs exploit the properties of quaternion algebra, e.g., the Hamilton product, that allows to process channels as a single entity and capture internal latent relations, while reducing by a factor of 4 the overall number of parameters. We show how to design QGANs and to extend the proposed approach even to advanced models.We compare the proposed QGANs with real-valued counterparts on several image generation benchmarks. Results show that QGANs are able to obtain better FID scores than real-valued GANs and to generate visually pleasing images. Furthermore, QGANs save up to 75% of the training parameters. We believe these results may pave the way to novel, more accessible, GANs capable of improving performance and saving computational resources.","url_abs":"https://arxiv.org/abs/2104.09630v2","url_pdf":"https://arxiv.org/pdf/2104.09630v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"quaternion-generative-adversarial-networks","repo_url":"https://github.com/eleGAN23/QGAN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"quaternion-generative-adversarial-networks","repo_url":"https://github.com/eleGAN23/QVAE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"quaternion-generative-adversarial-networks","repo_url":"https://github.com/ispamm/hi2i","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"image-generation","task_name":"Image Generation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-generation-on-cifar-10","task":"Image Generation","dataset":"CIFAR-10","model":"QSNGAN","rank_in_archive_order":69,"of":78,"metrics":{"FID":"31.966"},"uses_additional_data":false},{"leaderboard":"/sota/image-generation-on-celeba-hq-128x128","task":"Image Generation","dataset":"CelebA-HQ 128x128","model":"QSNGAN","rank_in_archive_order":7,"of":7,"metrics":{"FID":"29.417","IS":"2.249"},"uses_additional_data":false},{"leaderboard":"/sota/image-generation-on-oxford-102-flowers-1","task":"Image Generation","dataset":"Oxford 102 Flowers 128x128","model":"QSNGAN","rank_in_archive_order":1,"of":1,"metrics":{"FID":"115.838","IS":"3"},"uses_additional_data":false},{"leaderboard":"/sota/image-generation-on-stl-10","task":"Image Generation","dataset":"STL-10","model":"QSNGAN","rank_in_archive_order":30,"of":31,"metrics":{"FID":"59.611","Inception score":"4.987"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2104.09630","atlas_url":"https://app.syntology.ai/?focus=2104.09630","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2104.09630"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2104.09630\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2104.09630"},"call":"get_concepts_for_paper(arxiv_id=\"2104.09630\")"}],"by_repo":[{"repo":"eleGAN23/QGAN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.04176"],"harvested_for_calls":[{"arxiv_id":"2110.04176","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.04176"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.04176\")"}]},{"repo":"eleGAN23/QVAE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.04176"],"harvested_for_calls":[{"arxiv_id":"2110.04176","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.04176"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.04176\")"}]},{"repo":"ispamm/hi2i","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.04176"],"harvested_for_calls":[{"arxiv_id":"2110.04176","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.04176"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.04176\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"981c1fc99a90855308798aa15c8a3c6be37ea4535d40523e3043466d8e4a7376","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}