Methods › Computer Vision › Convolutional Neural Networks › Single-path NAS

Single-path NAS

5 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Single-Path NAS is a convolutional neural network architecture discovered through the Single-Path neural architecture search approach. The NAS utilises a single-path search space. Specifically, compared to previous differentiable NAS methods, Single-Path NAS uses one single-path over-parameterized ConvNet to encode all architectural decisions with shared convolutional kernel parameters. The approach is built upon the observation that different candidate convolutional operations in NAS can be viewed as subsets of a single superkernel. Without having to choose among different paths/operations as in multi-path methods, we instead solve the NAS problem as finding which subset of kernel weights to use in each ConvNet layer. By sharing the convolutional kernel weights, we encode all candidate NAS operations into a single superkernel.

The architecture itself uses the inverted residual block from MobileNetV2 as its basic building block.

Source: Single-Path NAS: Designing Hardware-Efficient ConvNets...See Code · skmhrk1209/Single-Path-NAS-PyTorch

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is the paper “Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hours” (arXiv:1904.02877, 291 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:1904.02877: its page on this site · ask the lookup about it.

Near matches the lookup lists, each a different name: PATH; PATH; PATH; PATH; G-NAS; NAS-GS; HR-NAS; Pi-NAS.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 5 · with a code link: 4 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (2 of 5 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

7 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Image Classification5
Neural Architecture Search5
image-classification4
GPU3
General Classification2
AutoML1
Hyperparameter Optimization1

Usage over time archive 2025-07-28

Papers per year tagged with Single-path NAS: 2019 to 2023, peak 3 3 0 2019: 3 papers 2019 2020: 1 paper 2020 2021: 0 papers 2021 2022: 0 papers 2022 2023: 1 paper 2023
Papers per year the archive tags with this method, by the paper's archive date (5 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Convolutional Neural Networks

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