{"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/prodiff-progressive-fast-diffusion-model-for","title":"ProDiff: Progressive Fast Diffusion Model For High-Quality Text-to-Speech","arxiv_id":"2207.06389","date":"2022-07-13","proceeding":null,"authors":["Rongjie Huang","Zhou Zhao","Huadai Liu","Jinglin Liu","Chenye Cui","Yi Ren"],"abstract":"Denoising diffusion probabilistic models (DDPMs) have recently achieved leading performances in many generative tasks. However, the inherited iterative sampling process costs hinder their applications to text-to-speech deployment. Through the preliminary study on diffusion model parameterization, we find that previous gradient-based TTS models require hundreds or thousands of iterations to guarantee high sample quality, which poses a challenge for accelerating sampling. In this work, we propose ProDiff, on progressive fast diffusion model for high-quality text-to-speech. Unlike previous work estimating the gradient for data density, ProDiff parameterizes the denoising model by directly predicting clean data to avoid distinct quality degradation in accelerating sampling. To tackle the model convergence challenge with decreased diffusion iterations, ProDiff reduces the data variance in the target site via knowledge distillation. Specifically, the denoising model uses the generated mel-spectrogram from an N-step DDIM teacher as the training target and distills the behavior into a new model with N/2 steps. As such, it allows the TTS model to make sharp predictions and further reduces the sampling time by orders of magnitude. Our evaluation demonstrates that ProDiff needs only 2 iterations to synthesize high-fidelity mel-spectrograms, while it maintains sample quality and diversity competitive with state-of-the-art models using hundreds of steps. ProDiff enables a sampling speed of 24x faster than real-time on a single NVIDIA 2080Ti GPU, making diffusion models practically applicable to text-to-speech synthesis deployment for the first time. Our extensive ablation studies demonstrate that each design in ProDiff is effective, and we further show that ProDiff can be easily extended to the multi-speaker setting. Audio samples are available at \\url{https://ProDiff.github.io/.}","url_abs":"https://arxiv.org/abs/2207.06389v1","url_pdf":"https://arxiv.org/pdf/2207.06389v1.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":"prodiff-progressive-fast-diffusion-model-for","repo_url":"https://github.com/Rongjiehuang/ProDiff","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"prodiff-progressive-fast-diffusion-model-for","repo_url":"https://github.com/Rongjiehuang/FastDiff","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"prodiff-progressive-fast-diffusion-model-for","repo_url":"https://github.com/Text-to-Audio/AudioLCM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"prodiff-progressive-fast-diffusion-model-for","repo_url":"https://github.com/text-to-audio/make-an-audio","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":null,"task_name":"GPU"},{"task_slug":"knowledge-distillation","task_name":"Knowledge Distillation"},{"task_slug":"speech-synthesis","task_name":"Speech Synthesis"},{"task_slug":"text-to-speech","task_name":"Text to Speech"},{"task_slug":"text-to-speech-synthesis","task_name":"Text-To-Speech Synthesis"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"},{"task_slug":"text-to-speech-1","task_name":"text-to-speech"}],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"},{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2207.06389","atlas_url":"https://app.syntology.ai/?focus=2207.06389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06389"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2207.06389"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2207.06389"},"call":"get_harvested_code_for_paper(arxiv_id=\"2207.06389\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2207.06389"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2207.06389\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2207.06389"},"call":"get_concepts_for_paper(arxiv_id=\"2207.06389\")"}],"by_repo":[{"repo":"Rongjiehuang/ProDiff","kind":"official","samples":6,"ran":6,"instrument":1,"unverified":0},{"repo":"Rongjiehuang/FastDiff","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.09934"],"harvested_for_calls":[{"arxiv_id":"2204.09934","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.09934"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.09934\")"}]},{"repo":"Text-to-Audio/AudioLCM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2410.12266"],"harvested_for_calls":[{"arxiv_id":"2410.12266","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2410.12266"},"call":"get_harvested_code_for_paper(arxiv_id=\"2410.12266\")"}]},{"repo":"text-to-audio/make-an-audio","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2301.12661"],"harvested_for_calls":[{"arxiv_id":"2301.12661","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.12661"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.12661\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2207.06389.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2207.06389.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Text-to-Audio/AudioLCM","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/text-to-audio/make-an-audio","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Rongjiehuang/ProDiff","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Rongjiehuang/FastDiff","reach":null}],"summary":{"ran":4,"ran_draft_wrong":1,"ran_honours":1},"n_samples":6,"n_ran":6,"n_constructed":3,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":6,"ran":6,"n_ran_checked":5,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":1,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":5,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","census_is":"Syntology's function-name census ran implementations with this entry name on one shared input per bucket (the positional rank, kind and dtype of each array argument) and counted the distinct output digests (sha256 of the output rounded to 6 decimals). implementations and papers count the compared samples; distinct_outputs counts digests across all buckets; n_buckets is how many shared inputs were used. It is not a statement that any two samples compute one thing, and the name is a string, not an identity.","samples":[{"code_sha256":"a025408166aaff26","code_sha256_prefix":"a025408166aaff26","entry":"Embedding","repo":"Rongjiehuang/ProDiff","repo_kind":"official","path":"modules/commons/common_layers.py","file_url":"https://github.com/Rongjiehuang/ProDiff/blob/HEAD/modules/commons/common_layers.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"num_embeddings:int/0/int, embedding_dim:int/0/int, padding_idx:NoneType/0/?","fixture_out_type":"Embedding","level_recorded_at":"2026-09-25T06:32:53.441431+00:00","code_page":"/code/embedding","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a025408166aaff26"}},{"code_sha256":"75d174a6ffe7ea22","code_sha256_prefix":"75d174a6ffe7ea22","entry":"LayerNorm","repo":"Rongjiehuang/ProDiff","repo_kind":"official","path":"modules/commons/common_layers.py","file_url":"https://github.com/Rongjiehuang/ProDiff/blob/HEAD/modules/commons/common_layers.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"normalized_shape:list/1/int, eps:float/0/float, elementwise_affine:bool/0/bool, export:bool/0/bool","fixture_out_type":"LayerNorm","level_recorded_at":"2026-09-25T06:32:53.441431+00:00","code_page":"/code/layernorm","census":{"url":"/census/layernorm","implementations":5,"papers":5,"distinct_outputs":5,"n_buckets":3,"bucket_key":null,"bucket_index":null,"bucket_label":null},"census_bucket_fragment":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"75d174a6ffe7ea22"}},{"code_sha256":"10865bbb99140edd","code_sha256_prefix":"10865bbb99140edd","entry":"Linear","repo":"Rongjiehuang/ProDiff","repo_kind":"official","path":"modules/commons/common_layers.py","file_url":"https://github.com/Rongjiehuang/ProDiff/blob/HEAD/modules/commons/common_layers.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"in_features:int/0/int, out_features:int/0/int, bias:bool/0/bool","fixture_out_type":"Linear","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/linear","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from YvesWang/Machine_Translation_NLP, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"10865bbb99140edd"}},{"code_sha256":"02d37efafc1e85c3","code_sha256_prefix":"02d37efafc1e85c3","entry":"create_window","repo":"Rongjiehuang/ProDiff","repo_kind":"official","path":"modules/commons/ssim.py","file_url":"https://github.com/Rongjiehuang/ProDiff/blob/HEAD/modules/commons/ssim.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"window_size:int/0/int, channel:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T06:32:53.441431+00:00","retrieve_with":{"tool":"get_code","code_sha256":"02d37efafc1e85c3"},"code_page":"/code/create-window","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"02d37efafc1e85c3"}},{"code_sha256":"c56b7ef16f309a45","code_sha256_prefix":"c56b7ef16f309a45","entry":"gaussian","repo":"Rongjiehuang/ProDiff","repo_kind":"official","path":"modules/commons/ssim.py","file_url":"https://github.com/Rongjiehuang/ProDiff/blob/HEAD/modules/commons/ssim.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"window_size:int/0/int, sigma:float/0/float","fixture_out_type":"Tensor","retrieve_with":{"tool":"get_code","code_sha256":"c56b7ef16f309a45"},"code_page":"/code/gaussian","census":{"url":"/census/gaussian","implementations":8,"papers":9,"distinct_outputs":8,"n_buckets":4,"bucket_key":null,"bucket_index":null,"bucket_label":null},"census_bucket_fragment":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c56b7ef16f309a45"}},{"code_sha256":"2e56fb31c5de022f","code_sha256_prefix":"2e56fb31c5de022f","entry":"ssim","repo":"Rongjiehuang/ProDiff","repo_kind":"official","path":"modules/commons/ssim.py","file_url":"https://github.com/Rongjiehuang/ProDiff/blob/HEAD/modules/commons/ssim.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"img1:Tensor/4/float, img2:Tensor/4/float, window_size:int/0/int, size_average:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T06:32:53.441431+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2e56fb31c5de022f"},"code_page":"/code/ssim","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2e56fb31c5de022f"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ccf3237fb54110a28ff34639a965dfc6ca3443b364a7ef833be2c507e60655ba","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}