SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2012.09243 · ICLR · 2021

Neural Pruning via Growing Regularization

Huan Wang, Yun Fu, Can Qin, Yulun Zhang

arXiv · PDF · Open in the Atlas

Code that ran

1 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 failures of our instrument; 2 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2012.09243.json · badge: /api/ran/2012.09243.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
mingsun-tse/regularization-pruning canonical (classifier label)
classifier basis: classifier_2025
1 ran · 2 no recorded run
FunctionStatusWhere it lives
Layer Ran
ran on a synthesized input · constructed an object; no result was computed
mingsun-tse/regularization-pruning/pruner/reg_pruner.py
pointer only (licence: NONE) · get_code("d54cd5c9b293f300")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mingsun-tse/regularization-pruning when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

MetaPruner Not yet run
unverified (harvested, no recorded run)
mingsun-tse/regularization-pruning/pruner/reg_pruner.py
pointer only (licence: NONE) · get_code("e67edd61de30baae")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mingsun-tse/regularization-pruning when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Pruner Not yet run
unverified (harvested, no recorded run)
mingsun-tse/regularization-pruning/pruner/reg_pruner.py
pointer only (licence: NONE) · get_code("3d649921f02ecc11")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mingsun-tse/regularization-pruning when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 0 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
Layer
brick of this paper's assembly: helper
1 other paper
1 dated earlier · 1 only as an assembly brick
1608.08710 (2016-08)
Pruning Filters for Efficient ConvNets
MetaPruner
brick of this paper's assembly: helper
1 other paper
1 dated earlier
1608.08710 (2016-08)
Pruning Filters for Efficient ConvNets

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Regularization has long been utilized to learn sparsity in deep neural network pruning. However, its role is mainly explored in the small penalty strength regime. In this work, we extend its application to a new scenario where the regularization grows large gradually to tackle two central problems of pruning: pruning schedule and weight importance scoring. (1) The former topic is newly brought up in this work, which we find critical to the pruning performance while receives little research attention. Specifically, we propose an L 2 regularization variant with rising penalty factors and show it can bring significant accuracy gains compared with its one-shot counterpart, even when the same weights are removed. (2) The growing penalty scheme also brings us an approach to exploit the Hessian information for more accurate pruning without knowing their specific values, thus not bothered by the common Hessian approximation problems. Empirically, the proposed algorithms are easy to implement and scalable to large datasets and networks in both structured and unstructured pruning. Their effectiveness is demonstrated with modern deep neural networks on the CIFAR and ImageNet datasets, achieving competitive results compared to many state-of-the-art algorithms. Our code and trained models are publicly available at https://github.com/mingsuntse/regularization-pruning.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2012.09243")
get_code_for_paper("2012.09243")
have("2012.09243")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2012.09243.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2012.09243.svg)](https://syntology.ai/paper/2012.09243)

Connect an agent — have() is free.