Papers › Polynormer: Polynomial-Expressive Graph Transformer in Linear Time

Polynormer: Polynomial-Expressive Graph Transformer in Linear Time

2 Mar 2024arXiv:2403.01232archive 2025-07-28

Chenhui Deng, Zichao Yue, Zhiru Zhang

Graph transformers (GTs) have emerged as a promising architecture that is theoretically more expressive than message-passing graph neural networks (GNNs). However, typical GT models have at least quadratic complexity and thus cannot scale to large graphs. While there are several linear GTs recently proposed, they still lag behind GNN counterparts on several popular graph datasets, which poses a critical concern on their practical expressivity. To balance the trade-off between expressivity and scalability of GTs, we propose Polynormer, a polynomial-expressive GT model with linear complexity. Polynormer is built upon a novel base model that learns a high-degree polynomial on input features. To enable the base model permutation equivariant, we integrate it with graph topology and node features separately, resulting in local and global equivariant attention models. Consequently, Polynormer adopts a linear local-to-global attention scheme to learn high-degree equivariant polynomials whose coefficients are controlled by attention scores. Polynormer has been evaluated on 13 homophilic and heterophilic datasets, including large graphs with millions of nodes. Our extensive experiment results show that Polynormer outperforms state-of-the-art GNN and GT baselines on most datasets, even without the use of nonlinear activation functions.

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.

Syntology holds a reference implementation of Polynormer, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). For this implementation, level 3 is recorded, but its report lists no property test that passed on both. No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Polynormer') (how to connect); the free check have('2403.01232') needs no token.

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

Code

Syntology 8 code samples harvested from 1 repository linked to this paper: 5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 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: 8 samples from 1 repository, 5 ran (4 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.

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

cornell-zhang/polynormer officialmentioned in papermentioned on GitHubpytorchBSD-3-ClauseSyntology: 8 samples, 5 ran (1 instrument-failed) · 3 unverified report
cornell-zhang/Polynormer mentioned on GitHubpytorchSyntology: 8 samples, 5 ran (1 instrument-failed) · 3 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

8 samples harvested: 5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; 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
4ran
3unverified

Licence: 0 of the 8 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 cornell-zhang/polynormer. “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.

cornell-zhang/polynormer official repository 8 samples, 5 ran (1 instrument-failed) · 3 unverified
GlobalAttn model.py ran BSD-3-Clause (permissive) · ea1ddecdfaa27927 · report fixture: returned GlobalAttn · level recorded 2026-09-22
Polynormer model.py ran BSD-3-Clause (permissive) · 62ffb90034b7235d · report fixture: returned Polynormer · level recorded 2026-09-22
eval_acc in 15 papers data_utils.py ran · our draft was wrong BSD-3-Clause (permissive) · 319c36c17da75fed · report fixture: signature y_true:Tensor/2/int, y_pred:Tensor/3/float · returned float · level recorded 2026-09-24
load_fixed_splits in 12 papers data_utils.py ran BSD-3-Clause (permissive) · 5b7702a29f6dafaf · report fixture: signature data_dir:str/0/str, dataset:NoneType/0/?, name:str/0/str · returned list · level recorded 2026-09-24
load_model in 479 papers logger.py ran BSD-3-Clause (permissive) · 635fdf41b8d70789 · report fixture: signature args:Args/0/?, model:callable/0/?, optimizer:SGD/0/?, run:int/0/int · returned tuple · level recorded 2026-09-24
eval_f1 data_utils.py unverified BSD-3-Clause (permissive) · 39f7b3a8e45be81b · report
load_hetero_dataset dataset.py unverified BSD-3-Clause (permissive) · 2ca80bf081304f24 · report
load_wikics_dataset dataset.py unverified BSD-3-Clause (permissive) · a411b546b0451f0e · 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. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. 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. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

2 assemblies on this paper: 1 harvested, 1 generated.

generated Assembly for Polynormer (graph method: Polynormer), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer; level 3 is recorded, but its report lists no property test that passed on both.

label matches by construction: the code was generated for this method (not judged by a model)

  1. polynormer_nll_loss entry · level 3 · ran · honoured contract · ed175bcdaa651874a6f2345519ce983f6af42c388c3af1bf06b5dbf78e5be6b4

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

  1. Polynormer entry · level 1 · ran · 62ffb90034b7235d
  2. GlobalAttn model · level 1 · ran · ea1ddecdfaa27927

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

Tasks

Node Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Node Classification amazon-ratings Polynormer Accuracy (%) 54.81 ± 0.49 #3 of 4 Archive leaderboard report
Node Classification minesweeper Polynormer AUCROC 97.46±0.36 #4 of 4 Archive leaderboard report
Node Classification pokec Polynormer Accuracy 86.10±0.05 #3 of 7 Archive leaderboard report
Node Classification questions Polynormer AUCROC 78.92±0.89 #3 of 3 Archive leaderboard report
Node Classification roman-empire Polynormer Accuracy (% ) 92.55±0.37 #1 of 7 Archive leaderboard report
Node Classification tolokers Polynormer AUCROC 85.91±0.74 #1 of 4 Archive leaderboard report
Node Property Prediction ogbn-arxiv Polynormer Ext. data No #44 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv Polynormer Number of params 1806160 #44 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv Polynormer Test Accuracy 0.7346 ± 0.0016 #44 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv Polynormer Validation Accuracy 0.7459 ± 0.0010 #44 of 86 Archive leaderboard report
Node Property Prediction ogbn-products Polynormer Ext. data No #27 of 64 Archive leaderboard report
Node Property Prediction ogbn-products Polynormer Number of params 2383654 #27 of 64 Archive leaderboard report
Node Property Prediction ogbn-products Polynormer Test Accuracy 0.8382 ± 0.0011 #27 of 64 Archive leaderboard report
Node Property Prediction ogbn-products Polynormer Validation Accuracy 0.9239 ± 0.0005 #27 of 64 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Graph Transformer

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