Papers › Learning Versatile Neural Architectures by Propagating Network Codes

Learning Versatile Neural Architectures by Propagating Network Codes

24 Mar 2021ICLR 2022 4arXiv:2103.13253archive 2025-07-28

Mingyu Ding, Yuqi Huo, Haoyu Lu, Linjie Yang, Zhe Wang, Zhiwu Lu, Jingdong Wang, Ping Luo

This work explores how to design a single neural network capable of adapting to multiple heterogeneous vision tasks, such as image segmentation, 3D detection, and video recognition. This goal is challenging because both network architecture search (NAS) spaces and methods in different tasks are inconsistent. We solve this challenge from both sides. We first introduce a unified design space for multiple tasks and build a multitask NAS benchmark (NAS-Bench-MR) on many widely used datasets, including ImageNet, Cityscapes, KITTI, and HMDB51. We further propose Network Coding Propagation (NCP), which back-propagates gradients of neural predictors to directly update architecture codes along the desired gradient directions to solve various tasks. In this way, optimal architecture configurations can be found by NCP in our large search space in seconds. Unlike prior arts of NAS that typically focus on a single task, NCP has several unique benefits. (1) NCP transforms architecture optimization from data-driven to architecture-driven, enabling joint search an architecture among multitasks with different data distributions. (2) NCP learns from network codes but not original data, enabling it to update the architecture efficiently across datasets. (3) In addition to our NAS-Bench-MR, NCP performs well on other NAS benchmarks, such as NAS-Bench-201. (4) Thorough studies of NCP on inter-, cross-, and intra-tasks highlight the importance of cross-task neural architecture design, i.e., multitask neural architectures and architecture transferring between different tasks. Code is available at https://github.com/dingmyu/NCP.

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="2103.13253")

Code

Syntology Ran 13 of 14 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 2 ran · honoured contract; 5 ran · our draft was wrong; 1 ran · fixture could not drive it; 5 ran with no contract checked.

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

dingmyu/NCP officialmentioned in paperpytorch 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

14 samples harvested; 13 ran; 2 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · honoured contract
5ran · our draft was wrong
1ran · fixture could not drive it
5ran
1unverified

Licence: 0 of the 14 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 dingmyu/NCP. “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.

BasicBlock dingmyu/NCP/models/supernet.py official repository ran · metamorphic tier: deterministic fingerprinted BSD-2-Clause (permissive) · 7653ec0dc3bc04c8 · report
ConvBNReLU dingmyu/NCP/models/supernet.py official repository ran · metamorphic tier: deterministic fingerprinted BSD-2-Clause (permissive) · a64ad8762fe201c4 · report
FuseModule dingmyu/NCP/models/supernet.py official repository ran · metamorphic tier: deterministic BSD-2-Clause (permissive) · 0aa384df5d22c220 · report
Identity dingmyu/NCP/models/supernet.py official repository ran · metamorphic tier: invariant fingerprinted BSD-2-Clause (permissive) · eb4511eaa68b7bd7 · report
ParallelModule dingmyu/NCP/models/supernet.py official repository ran · metamorphic tier: deterministic BSD-2-Clause (permissive) · 965c95dc0619b08a · report
_make_divisible dingmyu/NCP/models/supernet.py official repository ran · honoured contract BSD-2-Clause (permissive) · 733638be3c212532 · report
conv3x3 dingmyu/NCP/models/supernet.py official repository ran · our draft was wrong BSD-2-Clause (permissive) · 52b42ce8214983fb · report
denormalize dingmyu/NCP/tools/ncp.py official repository ran · our draft was wrong BSD-2-Clause (permissive) · 01cd9fa7bdf70ca2 · report
get_active_fn dingmyu/NCP/models/supernet.py official repository ran · our draft was wrong BSD-2-Clause (permissive) · 9ce0aa3acf7a46fd · report
get_block_wrapper dingmyu/NCP/models/supernet.py official repository ran · our draft was wrong BSD-2-Clause (permissive) · 2448b05701889c45 · report
normalize dingmyu/NCP/tools/ncp.py official repository ran · our draft was wrong BSD-2-Clause (permissive) · fe7038d962bb928a · report
resize dingmyu/NCP/models/supernet.py official repository ran · fixture could not drive it BSD-2-Clause (permissive) · e8fbff5c3395ac23 · report
valid_epoch dingmyu/NCP/tools/train_predictor.py official repository ran · honoured contract BSD-2-Clause (permissive) · 2cc6dcc541f32757 · report
MultiResolutionNet dingmyu/NCP/models/supernet.py official repository unverified BSD-2-Clause (permissive) · c808f48b3238adbb · report

Tasks

Image SegmentationNeural Architecture SearchSemantic SegmentationVideo Recognition

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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