Papers › Fractional Skipping: Towards Finer-Grained Dynamic CNN Inference

Fractional Skipping: Towards Finer-Grained Dynamic CNN Inference

3 Jan 2020arXiv:2001.00705archive 2025-07-28

Jianghao Shen, Yonggan Fu, Yue Wang, Pengfei Xu, Zhangyang Wang, Yingyan Lin

While increasingly deep networks are still in general desired for achieving state-of-the-art performance, for many specific inputs a simpler network might already suffice. Existing works exploited this observation by learning to skip convolutional layers in an input-dependent manner. However, we argue their binary decision scheme, i.e., either fully executing or completely bypassing one layer for a specific input, can be enhanced by introducing finer-grained, "softer" decisions. We therefore propose a Dynamic Fractional Skipping (DFS) framework. The core idea of DFS is to hypothesize layer-wise quantization (to different bitwidths) as intermediate "soft" choices to be made between fully utilizing and skipping a layer. For each input, DFS dynamically assigns a bitwidth to both weights and activations of each layer, where fully executing and skipping could be viewed as two "extremes" (i.e., full bitwidth and zero bitwidth). In this way, DFS can "fractionally" exploit a layer's expressive power during input-adaptive inference, enabling finer-grained accuracy-computational cost trade-offs. It presents a unified view to link input-adaptive layer skipping and input-adaptive hybrid quantization. Extensive experimental results demonstrate the superior tradeoff between computational cost and model expressive power (accuracy) achieved by DFS. More visualizations also indicate a smooth and consistent transition in the DFS behaviors, especially the learned choices between layer skipping and different quantizations when the total computational budgets vary, validating our hypothesis that layer quantization could be viewed as intermediate variants of layer skipping. Our source code and supplementary material are available at \link{https://github.com/Torment123/DFS}.

PaperPDFCodeCode 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="2001.00705")

Code

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

By repository: official repository: 12 samples from 1 repository, 6 ran; found in paper text by Syntology: 12 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Torment123/DFS officialmentioned in papermentioned on GitHubpytorch 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

24 samples harvested; 10 ran; 3 honoured the contract we drafted; 14 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.

3ran · honoured contract
3ran · our draft was wrong
1ran · fixture could not drive it
3ran
14unverified

Licence: 12 of the 24 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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.

QuantMeasure Torment123/DFS/models.py official repository ran · metamorphic tier: deterministic no licence file found · pointer only · b61afbb33cf81a80 · report
RNNGate Torment123/DFS/models.py official repository ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only · b6077b00a86467bb · report
SoftRNNGate Torment123/DFS/models.py official repository ran · metamorphic tier: deterministic no licence file found · pointer only · cbdc3eb53675a6f2 · report
conv2d_biprec Torment123/DFS/models.py official repository ran · our draft was wrong no licence file found · pointer only · bc6ca135467cad70 · report
quantize Torment123/DFS/models.py official repository ran · fixture could not drive it fingerprinted no licence file found · pointer only · 7d546c0310d1c591 · report
quantize_grad Torment123/DFS/models.py official repository ran · honoured contract fingerprinted no licence file found · pointer only · f5f448783f152da8 · report
QConv2d Torment123/DFS/models.py official repository unverified no licence file found · pointer only · 756d13995db71fff · report
ResNetRecurrentGateSP Torment123/DFS/models.py official repository unverified no licence file found · pointer only · 9839bc64a4774f55 · report
UniformQuantize Torment123/DFS/models.py official repository unverified no licence file found · pointer only · 1a2456136d59fff3 · report
UniformQuantizeGrad Torment123/DFS/models.py official repository unverified no licence file found · pointer only · 753ba41bd9a74e32 · report
conv3x3 Torment123/DFS/models.py official repository unverified no licence file found · pointer only · e50cc160a435968b · report
repackage_hidden Torment123/DFS/models.py official repository unverified no licence file found · pointer only · b6f41456f1266f92 · report
conv_1x1_bn mit-han-lab/haq-release/models/mobilenetv3.py found in paper text by Syntology ran · our draft was wrong MIT (permissive) · db82a4013a44fb42 · report
conv_bn mit-han-lab/haq-release/models/mobilenetv3.py found in paper text by Syntology ran · our draft was wrong MIT (permissive) · 84a4cf301e929085 · report
make_divisible mit-han-lab/haq-release/models/mobilenetv2.py found in paper text by Syntology ran · honoured contract fingerprinted MIT (permissive) · 63ec083689f80f47 · report
zeroed_observation mit-han-lab/haq-release/lib/rl/memory.py found in paper text by Syntology ran · honoured contract fingerprinted MIT (permissive) · b5cc72675b688b00 · report
conv_1x1_bn mit-han-lab/haq-release/models/mobilenetv2.py found in paper text by Syntology unverified MIT (permissive) · bc660f7845db5634 · report
conv_bn mit-han-lab/haq-release/models/mobilenet.py found in paper text by Syntology unverified MIT (permissive) · 247c2f31dd34327d · report
conv_bn mit-han-lab/haq-release/models/mobilenetv2.py found in paper text by Syntology unverified MIT (permissive) · 4e64cf99f91fea92 · report
conv_dw mit-han-lab/haq-release/models/mobilenet.py found in paper text by Syntology unverified MIT (permissive) · a972ad175e8bda7f · report
get_dataset mit-han-lab/haq-release/lib/utils/data_utils.py found in paper text by Syntology unverified MIT (permissive) · 850e0644d35c1376 · report
get_split_train_dataset mit-han-lab/haq-release/lib/utils/data_utils.py found in paper text by Syntology unverified MIT (permissive) · 8e7cf364b572ce56 · report
sample_batch_indexes mit-han-lab/haq-release/lib/rl/memory.py found in paper text by Syntology unverified MIT (permissive) · c83e49880d0e8a07 · report
train mit-han-lab/haq-release/rl_quantize.py found in paper text by Syntology unverified MIT (permissive) · d0be8747b3078aa4 · report

Tasks

Quantization

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