{"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/domain-adaptive-deep-network-compression","title":"Domain-adaptive deep network compression","arxiv_id":"1709.01041","date":"2017-09-04","proceeding":"ICCV 2017 10","authors":["Marc Masana","Joost Van de Weijer","Luis Herranz","Andrew D. Bagdanov","Jose M. Alvarez"],"abstract":"Deep Neural Networks trained on large datasets can be easily transferred to\nnew domains with far fewer labeled examples by a process called fine-tuning.\nThis has the advantage that representations learned in the large source domain\ncan be exploited on smaller target domains. However, networks designed to be\noptimal for the source task are often prohibitively large for the target task.\nIn this work we address the compression of networks after domain transfer.\n  We focus on compression algorithms based on low-rank matrix decomposition.\nExisting methods base compression solely on learned network weights and ignore\nthe statistics of network activations. We show that domain transfer leads to\nlarge shifts in network activations and that it is desirable to take this into\naccount when compressing. We demonstrate that considering activation statistics\nwhen compressing weights leads to a rank-constrained regression problem with a\nclosed-form solution. Because our method takes into account the target domain,\nit can more optimally remove the redundancy in the weights. Experiments show\nthat our Domain Adaptive Low Rank (DALR) method significantly outperforms\nexisting low-rank compression techniques. With our approach, the fc6 layer of\nVGG19 can be compressed more than 4x more than using truncated SVD alone --\nwith only a minor or no loss in accuracy. When applied to domain-transferred\nnetworks it allows for compression down to only 5-20% of the original number of\nparameters with only a minor drop in performance.","url_abs":"http://arxiv.org/abs/1709.01041v2","url_pdf":"http://arxiv.org/pdf/1709.01041v2.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":"domain-adaptive-deep-network-compression","repo_url":"https://github.com/mmasana/DALR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"domain-adaptive-deep-network-compression","repo_url":"https://github.com/The0nix/DALR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"low-rank-compression","task_name":"Low-rank compression"}],"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":"mmasana/DALR","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"The0nix/DALR","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":"08ab3f20199a9abdf557577364cb25edc8723239b3480bbb0cc29b77736b9d55","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}