{"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/building-efficient-convnets-using-redundant","title":"Building Efficient ConvNets using Redundant Feature Pruning","arxiv_id":"1802.07653","date":"2018-02-21","proceeding":null,"authors":["Babajide O. Ayinde","Jacek M. Zurada"],"abstract":"This paper presents an efficient technique to prune deep and/or wide\nconvolutional neural network models by eliminating redundant features (or\nfilters). Previous studies have shown that over-sized deep neural network\nmodels tend to produce a lot of redundant features that are either shifted\nversion of one another or are very similar and show little or no variations;\nthus resulting in filtering redundancy. We propose to prune these redundant\nfeatures along with their connecting feature maps according to their\ndifferentiation and based on their relative cosine distances in the feature\nspace, thus yielding smaller network size with reduced inference costs and\ncompetitive performance. We empirically show on select models and CIFAR-10\ndataset that inference costs can be reduced by 40% for VGG-16, 27% for\nResNet-56, and 39% for ResNet-110.","url_abs":"http://arxiv.org/abs/1802.07653v1","url_pdf":"http://arxiv.org/pdf/1802.07653v1.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":"building-efficient-convnets-using-redundant","repo_url":"https://github.com/babajide07/Redundant-Feature-Pruning-Pytorch-Implementation","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"building-efficient-convnets-using-redundant","repo_url":"https://github.com/bemova/Building-Efficient-ConvNets-using-Redundant-Feature-Pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"network-pruning","task_name":"Network Pruning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"babajide07/Redundant-Feature-Pruning-Pytorch-Implementation","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"bemova/Building-Efficient-ConvNets-using-Redundant-Feature-Pruning","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":"78883d878227d5339456650f454f8fbef07588cc2ce87bd97874bffd8a5c7afd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}