Papers › TERA: Self-Supervised Learning of Transformer Encoder Representation for Speech

TERA: Self-Supervised Learning of Transformer Encoder Representation for Speech

12 Jul 2020arXiv:2007.06028archive 2025-07-28

Andy T. Liu, Shang-Wen Li, Hung-Yi Lee

We introduce a self-supervised speech pre-training method called TERA, which stands for Transformer Encoder Representations from Alteration. Recent approaches often learn by using a single auxiliary task like contrastive prediction, autoregressive prediction, or masked reconstruction. Unlike previous methods, we use alteration along three orthogonal axes to pre-train Transformer Encoders on a large amount of unlabeled speech. The model learns through the reconstruction of acoustic frames from their altered counterpart, where we use a stochastic policy to alter along various dimensions: time, frequency, and magnitude. TERA can be used for speech representations extraction or fine-tuning with downstream models. We evaluate TERA on several downstream tasks, including phoneme classification, keyword spotting, speaker recognition, and speech recognition. We present a large-scale comparison of various self-supervised models. TERA achieves strong performance in the comparison by improving upon surface features and outperforming previous models. In our experiments, we study the effect of applying different alteration techniques, pre-training on more data, and pre-training on various features. We analyze different model sizes and find that smaller models are strong representation learners than larger models, while larger models are more effective for downstream fine-tuning than smaller models. Furthermore, we show the proposed method is transferable to downstream datasets not used in pre-training.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2007.06028")

Code

Syntology Ran 5 of 14 code samples harvested from 2 repositories linked to this paper; 9 have no recorded run. Of those that ran: 1 ran · honoured contract; 3 ran · our draft was wrong; 1 ran · fixture could not drive it.

By repository: community (archive-listed): 14 samples from 2 repositories, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

andi611/Self-Supervised-Speech-Pretraining-and-Representation-Learning officialmentioned in papermentioned on GitHubpytorchApache-2.0 report
s3prl/s3prl officialmentioned in papermentioned on GitHubpytorch report
592595/TERA mentioned on GitHubpytorch report
Pandade1997/tera_asvproof mentioned on GitHubpytorchMIT report
Vernacular-ai/Multimodal-Slu mentioned on GitHubpytorchMIT report
idiap/apam mentioned on GitHubpytorchNOASSERTION report
joselyn-rodriguez/s3prl mentioned on GitHubpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 5 ran; 1 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
3ran · our draft was wrong
1ran · fixture could not drive it
9unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

swish Pandade1997/tera_asvproof/transformer/model.py community (archive-listed) ran · our draft was wrong fingerprinted MIT (permissive) · 0f786c407fb1ee4c · report
gelu Pandade1997/tera_asvproof/transformer/model.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · fdc64f4c72036ae4 · report
gumbel_softmax_sample Pandade1997/tera_asvproof/transformer/model_quantize.py community (archive-listed) ran · fixture could not drive it MIT (permissive) · 4650349b06b3d90f · report
prune_linear_layer Pandade1997/tera_asvproof/transformer/model.py community (archive-listed) ran · our draft was wrong MIT (permissive) · d30d6c3098df2c42 · report
sample_gumbel Pandade1997/tera_asvproof/transformer/model_quantize.py community (archive-listed) ran · our draft was wrong MIT (permissive) · cec667e77fe8894d · report
compare Vernacular-ai/Multimodal-Slu/utility/get_best_score.py community (archive-listed) unverified MIT (permissive) · 017e86bd00a963bc · report
get_cosine_schedule_with_warmup Vernacular-ai/Multimodal-Slu/schedulers.py community (archive-listed) unverified MIT (permissive) · 28936c41e64792bd · report
get_cosine_with_hard_restarts_schedule_with_warmup Vernacular-ai/Multimodal-Slu/schedulers.py community (archive-listed) unverified MIT (permissive) · a9a4422e7a95a010 · report
get_grouped_parameters Vernacular-ai/Multimodal-Slu/optimizers.py community (archive-listed) unverified MIT (permissive) · cecd81dc06f43149 · report
get_optimizer Vernacular-ai/Multimodal-Slu/optimizers.py community (archive-listed) unverified MIT (permissive) · 15a4c381f6af50fb · report
get_scheduler Vernacular-ai/Multimodal-Slu/schedulers.py community (archive-listed) unverified MIT (permissive) · 880bf296f53cdebf · report
gumbel_softmax Pandade1997/tera_asvproof/transformer/model_quantize.py community (archive-listed) unverified MIT (permissive) · 24b061a6d0af9f9e · report
load_model Pandade1997/tera_asvproof/transformer/model_dual.py community (archive-listed) unverified MIT (permissive) · 8b8e06d04c4faf7f · report
test_transformer Pandade1997/tera_asvproof/run_upstream.py community (archive-listed) unverified MIT (permissive) · 78826dfaa4289758 · report

Tasks

Keyword SpottingSelf-Supervised LearningSpeaker RecognitionSpeech RecognitionTransfer Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections