{"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/unified-auto-encoding-with-masked-diffusion","title":"Unified Auto-Encoding with Masked Diffusion","arxiv_id":"2406.17688","date":"2024-06-25","proceeding":null,"authors":["Philippe Hansen-Estruch","Sriram Vishwanath","Amy Zhang","Manan Tomar"],"abstract":"At the core of both successful generative and self-supervised representation learning models there is a reconstruction objective that incorporates some form of image corruption. Diffusion models implement this approach through a scheduled Gaussian corruption process, while masked auto-encoder models do so by masking patches of the image. Despite their different approaches, the underlying similarity in their methodologies suggests a promising avenue for an auto-encoder capable of both de-noising tasks. We propose a unified self-supervised objective, dubbed Unified Masked Diffusion (UMD), that combines patch-based and noise-based corruption techniques within a single auto-encoding framework. Specifically, UMD modifies the diffusion transformer (DiT) training process by introducing an additional noise-free, high masking representation step in the diffusion noising schedule, and utilizes a mixed masked and noised image for subsequent timesteps. By integrating features useful for diffusion modeling and for predicting masked patch tokens, UMD achieves strong performance in downstream generative and representation learning tasks, including linear probing and class-conditional generation. This is achieved without the need for heavy data augmentations, multiple views, or additional encoders. Furthermore, UMD improves over the computational efficiency of prior diffusion based methods in total training time. We release our code at https://github.com/philippe-eecs/small-vision.","url_abs":"https://arxiv.org/abs/2406.17688v1","url_pdf":"https://arxiv.org/pdf/2406.17688v1.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":"unified-auto-encoding-with-masked-diffusion","repo_url":"https://github.com/google-research/big_vision","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"jax","reach":null},{"paper_slug":"unified-auto-encoding-with-masked-diffusion","repo_url":"https://github.com/philippe-eecs/small-vision","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"jax","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2406.17688","atlas_url":"https://app.syntology.ai/?focus=2406.17688","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":"2406.17688"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2406.17688\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2406.17688"},"call":"get_concepts_for_paper(arxiv_id=\"2406.17688\")"}],"by_repo":[{"repo":"google-research/big_vision","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":7,"harvested_for":["2106.10270","2205.10337","2209.06794","2305.16999","2306.07915","2407.07726","2411.19722"],"harvested_for_calls":[{"arxiv_id":"2106.10270","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.10270"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.10270\")"},{"arxiv_id":"2205.10337","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2205.10337"},"call":"get_harvested_code_for_paper(arxiv_id=\"2205.10337\")"},{"arxiv_id":"2209.06794","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.06794"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.06794\")"},{"arxiv_id":"2305.16999","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16999"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.16999\")"},{"arxiv_id":"2306.07915","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.07915"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.07915\")"},{"arxiv_id":"2407.07726","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.07726"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.07726\")"},{"arxiv_id":"2411.19722","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.19722"},"call":"get_harvested_code_for_paper(arxiv_id=\"2411.19722\")"}]},{"repo":"philippe-eecs/small-vision","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"e6555de1b61e2fe91c0d8b5af984273357dc0ef01cfd97f27242f4aaa215aa13","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}