{"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/accelerating-deep-unsupervised-domain","title":"Accelerating Deep Unsupervised Domain Adaptation with Transfer Channel Pruning","arxiv_id":"1904.02654","date":"2019-03-25","proceeding":null,"authors":["Chaohui Yu","Jindong Wang","Yiqiang Chen","Zijing Wu"],"abstract":"Deep unsupervised domain adaptation (UDA) has recently received increasing\nattention from researchers. However, existing methods are computationally\nintensive due to the computation cost of Convolutional Neural Networks (CNN)\nadopted by most work. To date, there is no effective network compression method\nfor accelerating these models. In this paper, we propose a unified Transfer\nChannel Pruning (TCP) approach for accelerating UDA models. TCP is capable of\ncompressing the deep UDA model by pruning less important channels while\nsimultaneously learning transferable features by reducing the cross-domain\ndistribution divergence. Therefore, it reduces the impact of negative transfer\nand maintains competitive performance on the target task. To the best of our\nknowledge, TCP is the first approach that aims at accelerating deep UDA models.\nTCP is validated on two benchmark datasets-Office-31 and ImageCLEF-DA with two\ncommon backbone networks-VGG16 and ResNet50. Experimental results demonstrate\nthat TCP achieves comparable or better classification accuracy than other\ncomparison methods while significantly reducing the computational cost. To be\nmore specific, in VGG16, we get even higher accuracy after pruning 26% floating\npoint operations (FLOPs); in ResNet50, we also get higher accuracy on half of\nthe tasks after pruning 12% FLOPs. We hope that TCP will open a new door for\nfuture research on accelerating transfer learning models.","url_abs":"http://arxiv.org/abs/1904.02654v1","url_pdf":"http://arxiv.org/pdf/1904.02654v1.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":"accelerating-deep-unsupervised-domain","repo_url":"https://github.com/jindongwang/transferlearning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"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":"jindongwang/transferlearning","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2207.12020"],"harvested_for_calls":[{"arxiv_id":"2207.12020","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2207.12020"},"call":"get_harvested_code_for_paper(arxiv_id=\"2207.12020\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"7862296835ce8e9053ba4c383fd95546f22076c22ad7c5e086eca145a4affe5b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}