Pruning kernels inside filters first, then in whole layers, is said to exploit easy optimisation and avoid local optima that direct layer-level pruning risks.

The paper

The paper's details are OpenAlex's; the citation count is OpenAlex's, 17 Oct 2026. The line on the paper is machine-written, as noted under Why it matters.

Why it matters

Written by Claude (claude-sonnet-5-5) on 17 Oct 2026 from the paper's abstract (as OpenAlex publishes it) and its OpenAlex record. Machine-written context to help a reader: it is not evidence, it moves no number, and it may be wrong. The quoted sentence is the claim; where it stands is computed from the record. If it misreads the paper, tell the stewards.

The story so far

1. 1

   What the authors did

   The authors designed a two-stage kernel pruning method and an index to rank kernels, then tested it on the CIFAR-10, CIFAR-100 and ImageNet datasets, comparing against existing CNN compression methods.

   Machine-written from the paper's abstract, as noted under Why it matters.

2. 2

   What they found

   • The method first prunes kernels within filters, then prunes kernels in the convolution layer once a certain compression ratio is reached.
   • Kernels are kept according to the information mapping sparse index, which favours those with the strongest mapping ability.
   • Pruning VGG-16 on CIFAR-10 gave an 80.8x compression ratio and 14.8x acceleration, with classification accuracy down by only 0.59% from the baseline.

   Machine-written from the paper's abstract, as noted under Why it matters.

3. 3

   What has been checked on Ecdysis

   Exuvia registered it on 17 October 2026. Its credence, the record's estimate that it holds, is 0.55 on a scale from 0 (refuted) to 1 (established): where it started, as every claim from the literature does. Only independent evidence moves it.

What would check it

How sure is the record?

Share this finding

Ready-made posts, written from the record. You post them yourself, from your own account; nothing is ever posted for anyone.

Click a post's text to select all of it. Both posts give the claim's standing on the record, and the longer one says what the checks show and what they do not; the wording changes when the record does. The longer post quotes the paper first, then gives the machine-written headline, marked as such; edit it as you like. To cite the claim, see Cite this claim.

What would prove it wrong

Refuted if, for identical CNNs and datasets (e.g., VGG‑16 on CIFAR‑10), a direct layer‑pruning method attains the same or better compression ratio while maintaining at least the same classification accuracy as progressive kernel pruning.

The test as Exuvia registered it on 17 Oct 2026, written from the paper's words. A conceptual claim's test names its refuter in words: it is checked by argument.

The wider literature

Other claims from the same paper

• uncheckedOn CIFAR-10/100 and ImageNet, the authors' IMSI-based progressive kernel pruning compresses CNNs better than existing compression methods.“The experimental results on the CIFAR-10/100 and ImageNet datasets show that compared to the existing CNN model compression methods, the IMSI-based progressive kernel pruning method exhibits better c…”
• uncheckedPruning VGG-16 on CIFAR-10 with the authors' method gives 80.8x compression and 14.8x speed-up, with accuracy down only 0.59% from baseline.“In particular, pruning VGG-16 on CIFAR-10 with our model achieves a compression ratio of 80.8x and an acceleration ratio of 14.8×, which are 5.8× and 4.2× higher than the best results at present, res…”

Headlines are machine-written from the paper's abstract, or from the quote and the paper's title where no abstract is open; each claim's own words are quoted beneath its headline.