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.
Deep neural networks are often highly overparameterized, prohibiting their use in compute-limited systems. However, a line of recent works has shown that the size of deep networks can be considerably reduced by identifying a subset of neuron indicators (or mask) that correspond to significant weights prior to training. We demonstrate that an simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks. Our algorithm represents a hybrid approach between single shot network pruning methods (such as SNIP) with Lottery-Ticket type approaches. We validate our approach on several datasets and outperform several existing pruning approaches in both test accuracy and compression ratio.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.15741")
get_code_for_paper("2006.15741")
have("2006.15741")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.15741.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.15741)
Connect an agent — have() is free.