Papers › Accelerating Transformer Inference for Translation via Parallel Decoding

Accelerating Transformer Inference for Translation via Parallel Decoding

17 May 2023arXiv:2305.10427archive 2025-07-28

Andrea Santilli, Silvio Severino, Emilian Postolache, Valentino Maiorca, Michele Mancusi, Riccardo Marin, Emanuele Rodolà

Autoregressive decoding limits the efficiency of transformers for Machine Translation (MT). The community proposed specific network architectures and learning-based methods to solve this issue, which are expensive and require changes to the MT model, trading inference speed at the cost of the translation quality. In this paper, we propose to address the problem from the point of view of decoding algorithms, as a less explored but rather compelling direction. We propose to reframe the standard greedy autoregressive decoding of MT with a parallel formulation leveraging Jacobi and Gauss-Seidel fixed-point iteration methods for fast inference. This formulation allows to speed up existing models without training or modifications while retaining translation quality. We present three parallel decoding algorithms and test them on different languages and models showing how the parallelization introduces a speedup up to 38% w.r.t. the standard autoregressive decoding and nearly 2x when scaling the method on parallel resources. Finally, we introduce a decoding dependency graph visualizer (DDGviz) that let us see how the model has learned the conditional dependence between tokens and inspect the decoding procedure.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also 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

Syntology 10 code samples harvested from 3 repositories linked to this paper: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 5 samples from 1 repository, 5 ran (5 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 5 samples from 2 repositories, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

teelinsan/parallel-decoding officialmentioned in papermentioned on GitHubpytorchApache-2.0Syntology: 5 samples, 5 ran (0 instrument-failed) · 0 unverified report
hao-ai-lab/Consistency_LLM mentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report
hao-ai-lab/lookaheaddecoding mentioned on GitHubpytorchSyntology: 4 samples, 0 ran · 4 unverified 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

10 samples harvested: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

5ran
5unverified

Licence: 0 of the 10 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 3 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A line beginning “fixture:” under a sample that ran gives 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” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

teelinsan/parallel-decoding official repository 5 samples, 5 ran (0 instrument-failed) · 0 unverified
check_stop_cond src/ipi/stopping_condition.py ran Apache-2.0 (permissive) · 0ca9c56c259031c2 · report fixture: signature tensor:Tensor/2/int, eos:int/0/int · returned int · level recorded 2026-09-26
generate_target src/ipi/decoders/mt_decoding.py ran Apache-2.0 (permissive) · b3326122212147a3 · report fixture: signature tokenizer:MinimalTokenizer/0/?, model:callable/0/?, input_ids:Tensor/2/int, attention_mask:Tensor/2/int, is_mbart:bool/0/bool, decoding_method:str/0/str, remove_padding:bool/0/bool · returned Tensor · level recorded 2026-09-26
get_electra_train_flops exp/flops_calculator.py ran Apache-2.0 (permissive) · 38a5a87b00d0d865 · report fixture: signature h_d:int/0/int, l_d:int/0/int, h_g:int/0/int, l_g:int/0/int, batch_size:int/0/int, train_steps:int/0/int, tied_embeddings:bool/0/bool, e:NoneType/0/?, s:int/0/int, output_frac:float/0/float · returned float · level recorded 2026-09-26
limit_past_key_values src/ipi/stopping_condition.py ran Apache-2.0 (permissive) · 3dca968fd18bbcc2 · report fixture: signature past_key_values:tuple/1/tuple, limit:int/0/int · returned tuple · level recorded 2026-09-26
stopping_criterion src/ipi/stopping_condition.py ran Apache-2.0 (permissive) · 5f4c2e11347eb5a8 · report fixture: signature past_tensor:Tensor/2/int, current_tensor:Tensor/2/int, eos:int/0/int · returned tuple · level recorded 2026-09-26
hao-ai-lab/Consistency_LLM community (archive-listed) 1 sample, 0 ran · 1 unverified
jacobi_forward cllm/cllm_llama_modeling.py unverified Apache-2.0 (permissive) · 6325980f1e2ddbb3 · report
hao-ai-lab/lookaheaddecoding community (archive-listed) 4 samples, 0 ran · 4 unverified
append_new_generated_pool lade/decoding.py unverified Apache-2.0 (permissive) · c1a277b44d064673 · report
fill_pool_with_prompt lade/decoding.py unverified Apache-2.0 (permissive) · 7c3d0baab443d8d8 · report
jacobi_greedy_search_multilevel lade/decoding.py unverified Apache-2.0 (permissive) · 069151ed3da2a52d · report
update_token_map lade/decoding.py unverified Apache-2.0 (permissive) · 521d2c89634e3413 · report

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. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

2 assemblies on this paper: 2 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

2 sibling assemblies for parallel decoding algorithms (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for parallel decoding algorithms (graph method: parallel decoding algorithms). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. jacobi_forward entry · level 0 · unverified · 6325980f1e2ddbb3

harvested Assembly for parallel decoding algorithms (graph method: parallel decoding algorithms). 4 bricks; individually on a fixture: 0 ran · 4 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. jacobi_greedy_search_multilevel entry · level 0 · unverified · 069151ed3da2a52d
  2. append_new_generated_pool helper · level 0 · unverified · c1a277b44d064673
  3. fill_pool_with_prompt helper · level 0 · unverified · 7c3d0baab443d8d8
  4. update_token_map helper · level 0 · unverified · 521d2c89634e3413

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="2305.10427") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Machine TranslationTranslation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SPEEDTest

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