{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/enabling-sparse-winograd-convolution-by","title":"Enabling Sparse Winograd Convolution by Native Pruning","arxiv_id":"1702.08597","date":"2017-02-28","proceeding":null,"authors":["Sheng Li","Jongsoo Park","Ping Tak Peter Tang"],"abstract":"Sparse methods and the use of Winograd convolutions are two orthogonal\napproaches, each of which significantly accelerates convolution computations in\nmodern CNNs. Sparse Winograd merges these two and thus has the potential to\noffer a combined performance benefit. Nevertheless, training convolution layers\nso that the resulting Winograd kernels are sparse has not hitherto been very\nsuccessful. By introducing a Winograd layer in place of a standard convolution\nlayer, we can learn and prune Winograd coefficients \"natively\" and obtain\nsparsity level beyond 90% with only 0.1% accuracy loss with AlexNet on ImageNet\ndataset. Furthermore, we present a sparse Winograd convolution algorithm and\nimplementation that exploits the sparsity, achieving up to 31.7 effective\nTFLOP/s in 32-bit precision on a latest Intel Xeon CPU, which corresponds to a\n5.4x speedup over a state-of-the-art dense convolution implementation.","url_abs":"http://arxiv.org/abs/1702.08597v2","url_pdf":"http://arxiv.org/pdf/1702.08597v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"enabling-sparse-winograd-convolution-by","repo_url":"https://github.com/IntelLabs/SkimCaffe","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"gone","observed_at":"2026-09-18","how":"tree_404+repo_404"}}],"tasks":[{"task_slug":null,"task_name":"CPU"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"grouped-convolution","method_name":"Grouped Convolution"},{"method_slug":"local-response-normalization","method_name":"Local Response Normalization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.08597","atlas_url":"https://app.syntology.ai/?focus=1702.08597","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1702.08597"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.08597\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.08597"},"call":"get_concepts_for_paper(arxiv_id=\"1702.08597\")"}],"by_repo":[{"repo":"IntelLabs/SkimCaffe","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ee459e71315aceb78a561d0ce0ed4d3ea5a6e1bc837ea6f251af7876d536fbd0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}