{"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/multiple-random-window-discriminator","slug":"multiple-random-window-discriminator","name":"Multiple Random Window Discriminator","full_name":"Multiple Random Window Discriminator","full_name_withheld":false,"description_markdown":"**Multiple Random Window Discriminator** is a discriminator used for the [GAN-TTS](https://paperswithcode.com/method/gan-tts) text-to-speech architecture. These discriminators operate on randomly sub-sampled fragments of the real or generated samples. The ensemble allows for the evaluation of audio in different complementary ways, and is obtained by taking\r\na Cartesian product of two parameter spaces: (i) the size of the random windows fed into the discriminator; (ii) whether a discriminator is conditioned on linguistic and pitch features. For example,\r\nin the authors' best-performing model, they consider five window sizes (240, 480, 960, 1920, 3600 samples), which yields 10 discriminators in total. \r\n\r\nUsing random windows of different size, rather than the full generated sample, has a data augmentation effect and also reduces the computational complexity of RWDs. In the first layer of each discriminator, the MRWD reshapes (downsamples) the input raw waveform to a constant\r\ntemporal dimension $\\omega = 240$ by moving consecutive blocks of samples into the channel dimension, i.e. from $\\left[\\omega\\_{k}, 1\\right]$ to $\\left[\\omega, k\\right]$, where $k$ is the downsampling factor (e.g. $k = 8$ for input window size $1920$). This way, all the RWDs have the same architecture and similar computational complexity despite different window sizes. \r\n\r\nThe conditional discriminators have access to linguistic and pitch features, and can measure whether\r\nthe generated audio matches the input conditioning. This means that random windows in conditional\r\ndiscriminators need to be aligned with the conditioning frequency to preserve the correspondence\r\nbetween the waveform and linguistic features within the sampled window. This limits the valid sampling to that of the frequency of the conditioning signal (200Hz, or every 5ms). The unconditional\r\ndiscriminators, on the contrary, only evaluate whether the generated audio sounds realistic regardless\r\nof the conditioning. The random windows for these discriminators are sampled without constraints\r\nat full 24kHz frequency, which further increases the amount of training data. \r\n\r\nFor the architecture, the discriminators consists of blocks (DBlocks) that are similar to the [GBlocks](https://paperswithcode.com/method/gblock) used in the generator, but without batch normalisation. Unconditional RWDs are composed entirely of DBlocks. In conditional RWDs, the input waveform is gradually downsampled by DBlocks, until the temporal dimension of the activation is equal to that of the conditioning, at which point a conditional [DBlock](https://paperswithcode.com/method/dblock) is used. This joint information is then passed to the remaining DBlocks, whose final output is average-pooled to obtain a scalar. The dilation factors in the DBlocks’ convolutions follow the pattern 1, 2, 1, 2 – unlike the generator, the discriminator operates on a relatively small window, and the authors did not observe any benefit from using larger dilation factors.","description_state":"present","introduced_year":null,"introduced_by":{"title":"High Fidelity Speech Synthesis with Adversarial Networks","paper":"/paper/high-fidelity-speech-synthesis-with-1","first_author":"Mikołaj Bińkowski","n_authors":8,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/high-fidelity-speech-synthesis-with-1"},"source":{"url":"https://arxiv.org/abs/1909.11646v2","title":"High Fidelity Speech Synthesis with Adversarial Networks","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/yanggeng1995/GAN-TTS/blob/75d70dec97ba11dbe5ee3e2e9ebfbdd10bd52389/models/discriminator.py#L5","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Discriminators","url":"/methods/category/discriminators","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":"/paper/a-spectral-energy-distance-for-parallel","slug":"a-spectral-energy-distance-for-parallel","title":"A Spectral Energy Distance for Parallel Speech Synthesis","date":"2020-08-03","arxiv_id":"2008.01160","n_code_links":2,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/high-fidelity-speech-synthesis-with-1","slug":"high-fidelity-speech-synthesis-with-1","title":"High Fidelity Speech Synthesis with Adversarial Networks","date":"2019-09-25","arxiv_id":"1909.11646","n_code_links":3,"syntology":{"ran":3,"of":5,"n_ran_checked":1,"n_instrument":2,"unverified":2,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["mbinkowski/DeepSpeechDistances"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}],"papers_shown":2,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":2,"with_a_code_link":2,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":2,"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/multiple-random-window-discriminator/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/multiple-random-window-discriminator/papers/ran/1","json":"/method/multiple-random-window-discriminator/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/speech-synthesis","name":"Speech Synthesis","papers":2},{"task":null,"name":"Generative Adversarial Network","papers":1},{"task":"/task/text-to-speech","name":"Text to Speech","papers":1},{"task":"/task/high","name":"Vocal Bursts Intensity Prediction","papers":1},{"task":"/task/scoring-rule","name":"scoring rule","papers":1},{"task":"/task/text-to-speech-1","name":"text-to-speech","papers":1}],"tasks_shown":6,"n_tasks":6,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","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/multiple-random-window-discriminator"},"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=Multiple%20Random%20Window%20Discriminator","read_at":"2026-10-05T00:59:25+00:00","query":"Multiple Random Window Discriminator","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1909.11646","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Multiple Random Window Discriminator' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["MFPI-random","Random Cloud","Random-K-of-N","Window Dilemma","Random-Bridges","Random Tickets","Multiple-Debias","Random Registers"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"323f01fcb0d4a226b7fbc5a3a0ea255c2b9feebde93ddcfe9bd08bd15b0e2318","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}