Papers › Fast Neural Architecture Search of Compact Semantic Segmentation Models via Auxiliary Cells

Fast Neural Architecture Search of Compact Semantic Segmentation Models via Auxiliary Cells

25 Oct 2018CVPR 2019 6arXiv:1810.10804archive 2025-07-28

Vladimir Nekrasov, Hao Chen, Chunhua Shen, Ian Reid

Automated design of neural network architectures tailored for a specific task is an extremely promising, albeit inherently difficult, avenue to explore. While most results in this domain have been achieved on image classification and language modelling problems, here we concentrate on dense per-pixel tasks, in particular, semantic image segmentation using fully convolutional networks. In contrast to the aforementioned areas, the design choices of a fully convolutional network require several changes, ranging from the sort of operations that need to be used---e.g., dilated convolutions---to a solving of a more difficult optimisation problem. In this work, we are particularly interested in searching for high-performance compact segmentation architectures, able to run in real-time using limited resources. To achieve that, we intentionally over-parameterise the architecture during the training time via a set of auxiliary cells that provide an intermediate supervisory signal and can be omitted during the evaluation phase. The design of the auxiliary cell is emitted by a controller, a neural network with the fixed structure trained using reinforcement learning. More crucially, we demonstrate how to efficiently search for these architectures within limited time and computational budgets. In particular, we rely on a progressive strategy that terminates non-promising architectures from being further trained, and on Polyak averaging coupled with knowledge distillation to speed-up the convergence. Quantitatively, in 8 GPU-days our approach discovers a set of architectures performing on-par with state-of-the-art among compact models on the semantic segmentation, pose estimation and depth prediction tasks. Code will be made available here: https://github.com/drsleep/nas-segm-pytorch

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page 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

drsleep/nas-segm-pytorch officialmentioned in papermentioned on GitHubpytorchNOASSERTIONSyntology: not harvested report
2023-MindSpore-1/ms-code-16 mindsporeSyntology: not harvested report
2023-MindSpore-1/ms-code-224 mindsporeSyntology: not harvested report
mindspore-ai/models mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to AdaBin: Improving Binary Neural Networks with Adaptive Binary Sets (arXiv:2208.08084; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 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

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Depth EstimationDepth PredictionImage ClassificationImage SegmentationKnowledge DistillationLanguage ModellingMonocular Depth EstimationNeural Architecture SearchPose EstimationReinforcement LearningSegmentationSemantic Segmentationimage-classification

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Monocular Depth Estimation NYU-Depth V2 FastDenseNas-arch0 RMSE 0.523 #71 of 85 Archive leaderboard report
Monocular Depth Estimation NYU-Depth V2 FastDenseNas-arch2 RMSE 0.525 #72 of 85 Archive leaderboard report
Monocular Depth Estimation NYU-Depth V2 FastDenseNas-arch1 RMSE 0.526 #73 of 85 Archive leaderboard report
Semantic Segmentation PASCAL VOC 2012 val FastDenseNas-arch0 mIoU 78.0% #13 of 29 Archive leaderboard report
Semantic Segmentation PASCAL VOC 2012 val FastDenseNas-arch2 mIoU 77.3% #16 of 29 Archive leaderboard report
Semantic Segmentation PASCAL VOC 2012 val FastDenseNas-arch1 mIoU 77.1% #18 of 29 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

Knowledge DistillationPolyak Averaging

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