Papers › Adaptive Feature Selection for End-to-End Speech Translation

Adaptive Feature Selection for End-to-End Speech Translation

16 Oct 2020Findings of the Association for Computational Linguistics 2020arXiv:2010.08518archive 2025-07-28

Biao Zhang, Ivan Titov, Barry Haddow, Rico Sennrich

Information in speech signals is not evenly distributed, making it an additional challenge for end-to-end (E2E) speech translation (ST) to learn to focus on informative features. In this paper, we propose adaptive feature selection (AFS) for encoder-decoder based E2E ST. We first pre-train an ASR encoder and apply AFS to dynamically estimate the importance of each encoded speech feature to SR. A ST encoder, stacked on top of the ASR encoder, then receives the filtered features from the (frozen) ASR encoder. We take L0DROP (Zhang et al., 2020) as the backbone for AFS, and adapt it to sparsify speech features with respect to both temporal and feature dimensions. Results on LibriSpeech En-Fr and MuST-C benchmarks show that AFS facilitates learning of ST by pruning out ~84% temporal features, yielding an average translation gain of ~1.3-1.6 BLEU and a decoding speedup of ~1.4x. In particular, AFS reduces the performance gap compared to the cascade baseline, and outperforms it on LibriSpeech En-Fr with a BLEU score of 18.56 (without data augmentation)

PaperPDFConference PDFCodeMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

bzhangGo/zero officialmentioned in papertfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Attention Is All You Need (arXiv:1706.03762; that paper's own run record: 610 ran (of which 293 constructed an object rather than computing a result; 529 with no instrument failure: 45 honoured, 15 violated, 469 with no contract checked; 81 where Syntology's instrument failed) · 336 unverified), Self-Attention with Relative Position Representations (arXiv:1803.02155; that paper's own run record: 13 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified), Improving Massively Multilingual Neural Machine Translation and Zero-Shot Translation (arXiv:2004.11867; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 11 unverified) and 2 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for Adaptive Feature Selection (graph method: Adaptive Feature Selection). 10 bricks; individually on a fixture: 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified. The assembly has not been run end-to-end.

  1. encoder entry · level 0 · unverified · dd6b86752ec524cd
  2. add_timing_signal helper · level 0 · unverified · 4b52e600cf72c348
  3. attention_bias helper · level 0 · unverified · b88b2db9eb46e73d
  4. dot_attention model · level 0 · unverified · b04d0b5aeab65a69
  5. ffn_layer helper · level 0 · unverified · 36e7645b57365d0d
  6. layer_norm helper · level 0 · unverified · 9dcd5100e4896669
  7. residual_fn helper · level 0 · unverified · a58e7c7393bd5449
  8. combine_heads helper · level 1 · ran; the contract check could not run · 9faf4852d7f74a91
  9. linear helper · level 0 · unverified · c9710c0dc3de38fe
  10. split_heads helper · level 1 · ran; the contract check could not run · 688a6272dc140cd0

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2010.08518") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Data AugmentationDecoderTranslationfeature selection

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Feature SelectionPruning

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