{"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/repr-improved-training-of-convolutional","title":"RePr: Improved Training of Convolutional Filters","arxiv_id":"1811.07275","date":"2018-11-18","proceeding":"CVPR 2019 6","authors":["Aaditya Prakash","James Storer","Dinei Florencio","Cha Zhang"],"abstract":"A well-trained Convolutional Neural Network can easily be pruned without\nsignificant loss of performance. This is because of unnecessary overlap in the\nfeatures captured by the network's filters. Innovations in network architecture\nsuch as skip/dense connections and Inception units have mitigated this problem\nto some extent, but these improvements come with increased computation and\nmemory requirements at run-time. We attempt to address this problem from\nanother angle - not by changing the network structure but by altering the\ntraining method. We show that by temporarily pruning and then restoring a\nsubset of the model's filters, and repeating this process cyclically, overlap\nin the learned features is reduced, producing improved generalization. We show\nthat the existing model-pruning criteria are not optimal for selecting filters\nto prune in this context and introduce inter-filter orthogonality as the\nranking criteria to determine under-expressive filters. Our method is\napplicable both to vanilla convolutional networks and more complex modern\narchitectures, and improves the performance across a variety of tasks,\nespecially when applied to smaller networks.","url_abs":"http://arxiv.org/abs/1811.07275v3","url_pdf":"http://arxiv.org/pdf/1811.07275v3.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":"repr-improved-training-of-convolutional","repo_url":"https://github.com/siahuat0727/RePr","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.07275","atlas_url":"https://app.syntology.ai/?focus=1811.07275","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":"1811.07275"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.07275\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.07275"},"call":"get_concepts_for_paper(arxiv_id=\"1811.07275\")"}],"by_repo":[{"repo":"siahuat0727/RePr","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":"51c578785bf1b04fc013e9a0ecef0f295140ff25c2a1dbff49c668ca39ae5735","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}