A Low-Complexity Modified ThiNet Algorithm for Pruning Convolutional Neural Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
ThiNet is a recent method for pruning convolutional neural networks. This method uses a norm of a subset of the components of the output resulting from the convolutional layer succeeding the layer from which the filters are to be removed for pruning the network. The ThiNet algorithm is very time-consuming, in view of the fact that the filters for removal are selected one by one iteratively. In this paper, we propose a modified version of ThiNet, in which the same information on the output of the same convolutional layer as used by ThiNet is employed to select all the filters together in a single step, for pruning the network. The proposed modified algorithm is shown to have a time-complexity that is only a small fraction of that of ThiNet or any other state-of-the-art algorithm and that the pruned network has almost the same reduction in its accuracy as that of the network pruned by ThiNet.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it