{"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/easy-transfer-learning-by-exploiting-intra","title":"Easy Transfer Learning By Exploiting Intra-domain Structures","arxiv_id":"1904.01376","date":"2019-04-02","proceeding":null,"authors":["Jindong Wang","Yiqiang Chen","Han Yu","Meiyu Huang","Qiang Yang"],"abstract":"Transfer learning aims at transferring knowledge from a well-labeled domain\nto a similar but different domain with limited or no labels. Unfortunately,\nexisting learning-based methods often involve intensive model selection and\nhyperparameter tuning to obtain good results. Moreover, cross-validation is not\npossible for tuning hyperparameters since there are often no labels in the\ntarget domain. This would restrict wide applicability of transfer learning\nespecially in computationally-constraint devices such as wearables. In this\npaper, we propose a practically Easy Transfer Learning (EasyTL) approach which\nrequires no model selection and hyperparameter tuning, while achieving\ncompetitive performance. By exploiting intra-domain structures, EasyTL is able\nto learn both non-parametric transfer features and classifiers. Extensive\nexperiments demonstrate that, compared to state-of-the-art traditional and deep\nmethods, EasyTL satisfies the Occam's Razor principle: it is extremely easy to\nimplement and use while achieving comparable or better performance in\nclassification accuracy and much better computational efficiency. Additionally,\nit is shown that EasyTL can increase the performance of existing transfer\nfeature learning methods.","url_abs":"http://arxiv.org/abs/1904.01376v2","url_pdf":"http://arxiv.org/pdf/1904.01376v2.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":"easy-transfer-learning-by-exploiting-intra","repo_url":"https://github.com/jindongwang/transferlearning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"model-selection","task_name":"Model Selection"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-adaptation-on-imageclef-da","task":"Domain Adaptation","dataset":"ImageCLEF-DA","model":"EasyTL","rank_in_archive_order":13,"of":17,"metrics":{"Accuracy":"88.2"},"uses_additional_data":false},{"leaderboard":"/sota/transfer-learning-on-office-home","task":"Transfer Learning","dataset":"Office-Home","model":"EasyTL","rank_in_archive_order":4,"of":5,"metrics":{"Accuracy":"63.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.01376","atlas_url":"https://app.syntology.ai/?focus=1904.01376","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":"1904.01376"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.01376\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.01376"},"call":"get_concepts_for_paper(arxiv_id=\"1904.01376\")"}],"by_repo":[{"repo":"jindongwang/transferlearning","kind":"listed","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":"e2d12a8bc778061549291c1a5160d0de71d0ec48876c560ecb1074044e3ae65b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}