{"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/unite-and-conquer-cross-dataset-multimodal","title":"Unite and Conquer: Plug & Play Multi-Modal Synthesis using Diffusion Models","arxiv_id":"2212.00793","date":"2022-12-01","proceeding":"CVPR 2023 1","authors":["Nithin Gopalakrishnan Nair","Wele Gedara Chaminda Bandara","Vishal M. Patel"],"abstract":"Generating photos satisfying multiple constraints find broad utility in the content creation industry. A key hurdle to accomplishing this task is the need for paired data consisting of all modalities (i.e., constraints) and their corresponding output. Moreover, existing methods need retraining using paired data across all modalities to introduce a new condition. This paper proposes a solution to this problem based on denoising diffusion probabilistic models (DDPMs). Our motivation for choosing diffusion models over other generative models comes from the flexible internal structure of diffusion models. Since each sampling step in the DDPM follows a Gaussian distribution, we show that there exists a closed-form solution for generating an image given various constraints. Our method can unite multiple diffusion models trained on multiple sub-tasks and conquer the combined task through our proposed sampling strategy. We also introduce a novel reliability parameter that allows using different off-the-shelf diffusion models trained across various datasets during sampling time alone to guide it to the desired outcome satisfying multiple constraints. We perform experiments on various standard multimodal tasks to demonstrate the effectiveness of our approach. More details can be found in https://nithin-gk.github.io/projectpages/Multidiff/index.html","url_abs":"https://arxiv.org/abs/2212.00793v2","url_pdf":"https://arxiv.org/pdf/2212.00793v2.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":"unite-and-conquer-cross-dataset-multimodal","repo_url":"https://github.com/Nithin-GK/UniteandConquer","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"face-generation","task_name":"Face Generation"},{"task_slug":"face-sketch-synthesis","task_name":"Face Sketch Synthesis"},{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"text-to-face-generation","task_name":"Text-to-Face Generation"},{"task_slug":"text-to-image-generation","task_name":"Text-to-Image Generation"},{"task_slug":"multimodal-generation","task_name":"multimodal generation"}],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/face-sketch-synthesis-on-multi-modal-celeba","task":"Face Sketch Synthesis","dataset":"Multi-Modal CelebA-HQ","model":"Diffusion","rank_in_archive_order":1,"of":1,"metrics":{"FID":"26.09"},"uses_additional_data":false},{"leaderboard":"/sota/text-to-image-generation-on-multi-modal","task":"Text-to-Image Generation","dataset":"Multi-Modal-CelebA-HQ","model":"Unite and Conquer","rank_in_archive_order":4,"of":10,"metrics":{"FID":"26.09","LPIPS":"0.519"},"uses_additional_data":false},{"leaderboard":"/sota/multimodal-generation-on-multi-modal-celeba","task":"multimodal generation","dataset":"Multi-Modal CelebA-HQ","model":"Diffusion","rank_in_archive_order":1,"of":1,"metrics":{"FID":"26.09"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2212.00793","atlas_url":"https://app.syntology.ai/?focus=2212.00793","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":"2212.00793"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2212.00793\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2212.00793"},"call":"get_concepts_for_paper(arxiv_id=\"2212.00793\")"}],"by_repo":[{"repo":"Nithin-GK/UniteandConquer","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2211.09120"],"harvested_for_calls":[{"arxiv_id":"2211.09120","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2211.09120"},"call":"get_harvested_code_for_paper(arxiv_id=\"2211.09120\")"}]}],"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":"22d795cccb46a83a4924199d2e932da7066ef05dbc9222136c28272963acec0e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}