{"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/self-training-and-pre-training-are","title":"Self-training and Pre-training are Complementary for Speech Recognition","arxiv_id":"2010.11430","date":"2020-10-22","proceeding":null,"authors":["Qiantong Xu","Alexei Baevski","Tatiana Likhomanenko","Paden Tomasello","Alexis Conneau","Ronan Collobert","Gabriel Synnaeve","Michael Auli"],"abstract":"Self-training and unsupervised pre-training have emerged as effective approaches to improve speech recognition systems using unlabeled data. However, it is not clear whether they learn similar patterns or if they can be effectively combined. In this paper, we show that pseudo-labeling and pre-training with wav2vec 2.0 are complementary in a variety of labeled data setups. Using just 10 minutes of labeled data from Libri-light as well as 53k hours of unlabeled data from LibriVox achieves WERs of 3.0%/5.2% on the clean and other test sets of Librispeech - rivaling the best published systems trained on 960 hours of labeled data only a year ago. Training on all labeled data of Librispeech achieves WERs of 1.5%/3.1%.","url_abs":"https://arxiv.org/abs/2010.11430v1","url_pdf":"https://arxiv.org/pdf/2010.11430v1.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":"self-training-and-pre-training-are","repo_url":"https://github.com/pytorch/fairseq","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"self-training-and-pre-training-are","repo_url":"https://github.com/pytorch/fairseq/blob/f3b6f5817fbee59057ae2506f01502ea3c301b4b/examples/wav2vec/README.md","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"self-training-and-pre-training-are","repo_url":"https://github.com/facebookresearch/fairseq","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"speech-recognition","task_name":"Speech Recognition"},{"task_slug":"unsupervised-pre-training","task_name":"Unsupervised Pre-training"},{"task_slug":"speech-recognition-1","task_name":"speech-recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/speech-recognition-on-librispeech-test-clean","task":"Speech Recognition","dataset":"LibriSpeech test-clean","model":"Conv + Transformer + wav2vec2.0 + pseudo labeling","rank_in_archive_order":7,"of":64,"metrics":{"Word Error Rate (WER)":"1.5"},"uses_additional_data":true},{"leaderboard":"/sota/speech-recognition-on-librispeech-test-clean","task":"Speech Recognition","dataset":"LibriSpeech test-clean","model":"wav2vec_wav2letter","rank_in_archive_order":43,"of":64,"metrics":{"Word Error Rate (WER)":"2.7"},"uses_additional_data":false},{"leaderboard":"/sota/speech-recognition-on-librispeech-test-other","task":"Speech Recognition","dataset":"LibriSpeech test-other","model":"Conv + Transformer + wav2vec2.0 + pseudo labeling","rank_in_archive_order":7,"of":53,"metrics":{"Word Error Rate (WER)":"3.1"},"uses_additional_data":false},{"leaderboard":"/sota/speech-recognition-on-librispeech-train-clean","task":"Speech Recognition","dataset":"LibriSpeech train-clean-100 test-clean","model":"wav2vec_wav2letter","rank_in_archive_order":1,"of":1,"metrics":{"Word Error Rate (WER)":"2.8"},"uses_additional_data":true},{"leaderboard":"/sota/speech-recognition-on-librispeech-train-clean-1","task":"Speech Recognition","dataset":"LibriSpeech train-clean-100 test-other","model":"wav2vec_wav2letter","rank_in_archive_order":1,"of":1,"metrics":{"Word Error Rate (WER)":"3.6"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2010.11430","atlas_url":"https://app.syntology.ai/?focus=2010.11430","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":"2010.11430"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2010.11430\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2010.11430"},"call":"get_concepts_for_paper(arxiv_id=\"2010.11430\")"}],"by_repo":[{"repo":"pytorch/fairseq","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2105.08206","2105.14850","2203.09163"],"harvested_for_calls":[{"arxiv_id":"2105.08206","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.08206"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.08206\")"},{"arxiv_id":"2105.14850","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14850"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14850\")"},{"arxiv_id":"2203.09163","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.09163"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.09163\")"}]},{"repo":"facebookresearch/fairseq","kind":"listed","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":"df87d86f95d4b13b2e3cc2f5b30cefec991b2263cda943a91b4fee17c06a0c96","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}