We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce a pruning algorithm that provably sparsifies the parameters of a trained model in a way that approximately preserves the model's predictive accuracy. Our algorithm uses a small batch of input points to construct a data-informed importance sampling distribution over the network's parameters, and adaptively mixes a sampling-based and deterministic pruning procedure to discard redundant weights. Our pruning method is simultaneously computationally efficient, provably accurate, and broadly applicable to various network architectures and data distributions. Our empirical comparisons show that our algorithm reliably generates highly compressed networks that incur minimal loss in performance relative to that of the original network. We present experimental results that demonstrate our algorithm's potential to unearth essential network connections that can be trained successfully in isolation, which may be of independent interest.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.05422")
get_code_for_paper("1910.05422")
have("1910.05422")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.05422.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.05422)
Connect an agent — have() is free.