Methods › General › Network Shrinking › TinyNet
Model Rubik's Cube: Twisting Resolution, Depth and Width for TinyNets
TinyNet
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
To obtain excellent deep neural architectures, a series of techniques are carefully designed in EfficientNets. The giant formula for simultaneously enlarging the resolution, depth and width provides us a Rubik's cube for neural networks. So that we can find networks with high efficiency and excellent performance by twisting the three dimensions. This paper aims to explore the twisting rules for obtaining deep neural networks with minimum model sizes and computational costs. Different from the network enlarging, we observe that resolution and depth are more important than width for tiny networks. Therefore, the original method, i.e., the compound scaling in EfficientNet is no longer suitable. To this end, we summarize a tiny formula for downsizing neural architectures through a series of smaller models derived from the EfficientNet-B0 with the FLOPs constraint. Experimental results on the ImageNet benchmark illustrate that our TinyNet performs much better than the smaller version of EfficientNets using the inversed giant formula. For instance, our TinyNet-E achieves a 59.9% Top-1 accuracy with only 24M FLOPs, which is about 1.9% higher than that of the previous best MobileNetV3 with similar computational cost.
In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 9 in the graph, strongest link: official). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2010.14819) is about this method is not checked.
Origin paper of this answer, arXiv:2010.14819 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 0 ran · 1 unverified (of 1 harvested sample) · 1 pointer-only (licence). Ran means executed on a synthesized input, not that the code is correct.
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: 4 · with a code link: 3 · where Syntology ran a sample: 0 (0 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: none of the 4 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 4 of 4, 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.
-
Image Classification with Classic and Deep Learning Techniques 11 May 2021 · 1 repository · arXiv:2105.04895
-
Model Rubik’s Cube: Twisting Resolution, Depth and Width for TinyNets 1 Dec 2020 · 3 repositories
-
Effective Model Compression via Stage-wise Pruning 10 Nov 2020 · 0 repositories · arXiv:2011.04908
-
Model Rubik's Cube: Twisting Resolution, Depth and Width for TinyNets 28 Oct 2020 · 9 repositories · arXiv:2010.14819Syntology official: harvested for another paper · 0 ran · 1 unverified (of 1 harvested sample) · 1 pointer-only (licence)
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.
| Task | Papers |
|---|---|
| Image Classification | 3 |
| Classification | 1 |
| Deep Learning | 1 |
| Model Compression | 1 |
| Rubik's Cube | 1 |
| image-classification | 1 |
| model | 1 |
Usage over time archive 2025-07-28
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
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