Papers › Understanding and Improving Transformer From a Multi-Particle Dynamic System Point of View

Understanding and Improving Transformer From a Multi-Particle Dynamic System Point of View

6 Jun 2019ICLR 2020 1arXiv:1906.02762archive 2025-07-28

Yiping Lu, Zhuohan Li, Di He, Zhiqing Sun, Bin Dong, Tao Qin, Li-Wei Wang, Tie-Yan Liu

The Transformer architecture is widely used in natural language processing. Despite its success, the design principle of the Transformer remains elusive. In this paper, we provide a novel perspective towards understanding the architecture: we show that the Transformer can be mathematically interpreted as a numerical Ordinary Differential Equation (ODE) solver for a convection-diffusion equation in a multi-particle dynamic system. In particular, how words in a sentence are abstracted into contexts by passing through the layers of the Transformer can be interpreted as approximating multiple particles' movement in the space using the Lie-Trotter splitting scheme and the Euler's method. Given this ODE's perspective, the rich literature of numerical analysis can be brought to guide us in designing effective structures beyond the Transformer. As an example, we propose to replace the Lie-Trotter splitting scheme by the Strang-Marchuk splitting scheme, a scheme that is more commonly used and with much lower local truncation errors. The Strang-Marchuk splitting scheme suggests that the self-attention and position-wise feed-forward network (FFN) sub-layers should not be treated equally. Instead, in each layer, two position-wise FFN sub-layers should be used, and the self-attention sub-layer is placed in between. This leads to a brand new architecture. Such an FFN-attention-FFN layer is "Macaron-like", and thus we call the network with this new architecture the Macaron Net. Through extensive experiments, we show that the Macaron Net is superior to the Transformer on both supervised and unsupervised learning tasks. The reproducible codes and pretrained models can be found at https://github.com/zhuohan123/macaron-net

PaperPDFConference PDFCodeCode Syntology ran

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 1 repository linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 10 samples from 1 repository, 9 ran (8 with no instrument failure; 1 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.

No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:

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

zhuohan123/macaron-net officialmentioned in papermentioned on GitHubpytorchBSD-3-ClauseSyntology: 10 samples, 9 ran (1 instrument-failed) · 1 unverified report
JunnYu/x-transformers-paddle mentioned on GitHubjaxApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Swin Transformer V2: Scaling Up Capacity and Resolution (arXiv:2111.09883; that paper's own run record: 17 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 3 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 13 unverified); 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

10 samples harvested: 9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 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.

1ran · our draft was wrong
8ran
1unverified

Licence: 1 of the 10 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zhuohan123/macaron-net. “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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

zhuohan123/macaron-net official repository 10 samples, 9 ran (1 instrument-failed) · 1 unverified
check_concat bert/macaron-scripts/bert/filter_and_cleanup_lines.py ran fingerprinted BSD-3-Clause (permissive) · 9aa5761a12454e61 · report fixture: signature line1:str/0/str, line2:str/0/str · returned bool · level recorded 2026-09-25
get_tasks in 21 papers bert/macaron-scripts/glue/download_glue_data.py ran · our draft was wrong BSD-3-Clause (permissive) here; the stored copy is pointer only · 18962b43885bc12f · report fixture: signature task_names:str/0/str · returned list · level recorded 2026-09-22
get_url in 8 papers bert/macaron-scripts/bert/WikiExtractor.py ran fingerprinted BSD-3-Clause (permissive) · 8294a226aac1a8d4 · report fixture: signature uid:int/0/int · returned str · level recorded 2026-09-25
is_valid in 5 papers bert/macaron-scripts/bert/filter_and_cleanup_lines.py ran BSD-3-Clause (permissive) · 0c501fb9b58d4e36 · report fixture: signature line:str/0/str · returned bool · level recorded 2026-09-25
keepPage bert/macaron-scripts/bert/WikiExtractor.py ran fingerprinted BSD-3-Clause (permissive) · 4438ef34a9207866 · report fixture: signature ns:str/0/str, page:list/1/str · returned bool · level recorded 2026-09-25
normalizeTitle bert/macaron-scripts/bert/WikiExtractor.py ran fingerprinted BSD-3-Clause (permissive) · 049c25d034196deb · report fixture: signature title:str/0/str · returned str · level recorded 2026-09-25
post_cleanup bert/macaron-scripts/bert/filter_and_cleanup_lines.py ran fingerprinted BSD-3-Clause (permissive) · c74c1eb334214a99 · report fixture: signature line:str/0/str · returned str · level recorded 2026-09-25
pre_cleanup bert/macaron-scripts/common/precleanup_english.py ran fingerprinted BSD-3-Clause (permissive) · 092fa7f46a1a6f34 · report fixture: signature line:str/0/str · returned str · level recorded 2026-09-25
score in 54 papers bert/macaron-scripts/bert/concat_short_sentences.py ran fingerprinted BSD-3-Clause (permissive) · 43404249e690d259 · report fixture: signature line1:str/0/str, line2:str/0/str · returned int · level recorded 2026-09-25
segment in 11 papers bert/macaron-scripts/bert/segment_sentence.py unverified BSD-3-Clause (permissive) · 434459caeb5fdaf7 · report

Tasks

Sentence

1 archive task tag without a task page not shown.

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 LayerReLUResidual 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