Papers › NAR-Former V2: Rethinking Transformer for Universal Neural Network Representation Learning

NAR-Former V2: Rethinking Transformer for Universal Neural Network Representation Learning

19 Jun 2023NeurIPS 2023 11arXiv:2306.10792archive 2025-07-28

Yun Yi, Haokui Zhang, Rong Xiao, Nannan Wang, Xiaoyu Wang

As more deep learning models are being applied in real-world applications, there is a growing need for modeling and learning the representations of neural networks themselves. An efficient representation can be used to predict target attributes of networks without the need for actual training and deployment procedures, facilitating efficient network deployment and design. Recently, inspired by the success of Transformer, some Transformer-based representation learning frameworks have been proposed and achieved promising performance in handling cell-structured models. However, graph neural network (GNN) based approaches still dominate the field of learning representation for the entire network. In this paper, we revisit Transformer and compare it with GNN to analyse their different architecture characteristics. We then propose a modified Transformer-based universal neural network representation learning model NAR-Former V2. It can learn efficient representations from both cell-structured networks and entire networks. Specifically, we first take the network as a graph and design a straightforward tokenizer to encode the network into a sequence. Then, we incorporate the inductive representation learning capability of GNN into Transformer, enabling Transformer to generalize better when encountering unseen architecture. Additionally, we introduce a series of simple yet effective modifications to enhance the ability of the Transformer in learning representation from graph structures. Our proposed method surpasses the GNN-based method NNLP by a significant margin in latency estimation on the NNLQP dataset. Furthermore, regarding accuracy prediction on the NASBench101 and NASBench201 datasets, our method achieves highly comparable performance to other state-of-the-art methods.

PaperPDFConference PDFCodeCode 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="2306.10792")

Code

Syntology Ran 0 of 15 code samples harvested from 1 repository linked to this paper; 15 have no recorded run.

By repository: official repository: 15 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

yuny220/NAR-Former-V2 officialmentioned in paperpytorchMIT 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

15 samples harvested; 0 ran; 0 honoured the contract we drafted; 15 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.

15unverified

Licence: 0 of the 15 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 yuny220/NAR-Former-V2. “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.

embed_attrs yuny220/NAR-Former-V2/predictor/feature/node_feature.py official repository unverified MIT (permissive) · 1e37af5cf5320cea · report
embed_op_code yuny220/NAR-Former-V2/predictor/feature/node_feature.py official repository unverified MIT (permissive) · ff46a1625a9d0cd1 · report
embed_shape yuny220/NAR-Former-V2/predictor/feature/node_feature.py official repository unverified MIT (permissive) · 40bf84d585a0d8fb · report
extract_graph_feature yuny220/NAR-Former-V2/predictor/feature/graph_feature.py official repository unverified MIT (permissive) · bde901526881c504 · report
extract_graph_feature_from_networkx yuny220/NAR-Former-V2/predictor/feature/graph_feature.py official repository unverified MIT (permissive) · cc00ffba3a90caea · report
flops_conv yuny220/NAR-Former-V2/predictor/feature/onnx_flops.py official repository unverified MIT (permissive) · 744e1f1434f9addf · report
flops_gemm yuny220/NAR-Former-V2/predictor/feature/onnx_flops.py official repository unverified MIT (permissive) · 3b564242dd4a13a1 · report
flops_matmal yuny220/NAR-Former-V2/predictor/feature/onnx_flops.py official repository unverified MIT (permissive) · 0f7addd0143bea1b · report
gen_Khop_adj yuny220/NAR-Former-V2/predictor/model.py official repository unverified MIT (permissive) · 0bc8a6e84b43d28b · report
padding_for_batch yuny220/NAR-Former-V2/predictor/data_process/data_and_encoding_generate.py official repository unverified MIT (permissive) · 16c95ce071090988 · report
parse_from_onnx yuny220/NAR-Former-V2/predictor/feature/graph_feature.py official repository unverified MIT (permissive) · c116bb9f8d8527b3 · report
transform_operations yuny220/NAR-Former-V2/predictor/data_process/gen_json_101.py official repository unverified MIT (permissive) · 9dbe158474b5367f · report
transform_operations_category yuny220/NAR-Former-V2/predictor/data_process/gen_json_101.py official repository unverified MIT (permissive) · 9ca1858f61f750f5 · report
transform_operations_category_101 yuny220/NAR-Former-V2/predictor/data_process/data_and_encoding_generate.py official repository unverified MIT (permissive) · ed0dbb64178970b6 · report
transform_operations_category_201 yuny220/NAR-Former-V2/predictor/data_process/data_and_encoding_generate.py official repository unverified MIT (permissive) · bf2419d10c0e8b96 · report

Tasks

Graph Neural NetworkRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutGraph Neural NetworkLabel 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