{"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/improving-task-adaptation-for-cross-domain","title":"Cross-domain Few-shot Learning with Task-specific Adapters","arxiv_id":"2107.00358","date":"2021-07-01","proceeding":"CVPR 2022 1","authors":["Wei-Hong Li","Xialei Liu","Hakan Bilen"],"abstract":"In this paper, we look at the problem of cross-domain few-shot classification that aims to learn a classifier from previously unseen classes and domains with few labeled samples. Recent approaches broadly solve this problem by parameterizing their few-shot classifiers with task-agnostic and task-specific weights where the former is typically learned on a large training set and the latter is dynamically predicted through an auxiliary network conditioned on a small support set. In this work, we focus on the estimation of the latter, and propose to learn task-specific weights from scratch directly on a small support set, in contrast to dynamically estimating them. In particular, through systematic analysis, we show that task-specific weights through parametric adapters in matrix form with residual connections to multiple intermediate layers of a backbone network significantly improves the performance of the state-of-the-art models in the Meta-Dataset benchmark with minor additional cost.","url_abs":"https://arxiv.org/abs/2107.00358v4","url_pdf":"https://arxiv.org/pdf/2107.00358v4.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":"improving-task-adaptation-for-cross-domain","repo_url":"https://github.com/VICO-UoE/URL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"improving-task-adaptation-for-cross-domain","repo_url":"https://github.com/google-research/meta-dataset","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"improving-task-adaptation-for-cross-domain","repo_url":"https://github.com/jimzai/deta","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"improving-task-adaptation-for-cross-domain","repo_url":"https://github.com/nobody-1617/deta","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"cross-domain-few-shot","task_name":"Cross-Domain Few-Shot"},{"task_slug":"few-shot-image-classification","task_name":"Few-Shot Image Classification"},{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"cross-domain-few-shot-learning","task_name":"cross-domain few-shot learning"}],"methods":[{"method_slug":"adapter","method_name":"Adapter"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-image-classification-on-meta-dataset","task":"Few-Shot Image Classification","dataset":"Meta-Dataset","model":"TSA (ResNet18, URL, residual adapters, 84x84 image, shuffled data, scratch, MDL)","rank_in_archive_order":4,"of":22,"metrics":{"Accuracy":"78.07"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2107.00358","atlas_url":"https://app.syntology.ai/?focus=2107.00358","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":"2107.00358"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2107.00358\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2107.00358"},"call":"get_concepts_for_paper(arxiv_id=\"2107.00358\")"}],"by_repo":[{"repo":"VICO-UoE/URL","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2103.13841"],"harvested_for_calls":[{"arxiv_id":"2103.13841","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.13841"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.13841\")"}]},{"repo":"google-research/meta-dataset","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1903.03096"],"harvested_for_calls":[{"arxiv_id":"1903.03096","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1903.03096"},"call":"get_harvested_code_for_paper(arxiv_id=\"1903.03096\")"}]},{"repo":"jimzai/deta","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2303.06315"],"harvested_for_calls":[{"arxiv_id":"2303.06315","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2303.06315"},"call":"get_harvested_code_for_paper(arxiv_id=\"2303.06315\")"}]},{"repo":"nobody-1617/deta","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1903.03096"],"harvested_for_calls":[{"arxiv_id":"1903.03096","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1903.03096"},"call":"get_harvested_code_for_paper(arxiv_id=\"1903.03096\")"}]}],"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":"e4d99a05015253ee44b936a53f257dc15ed6de0a5d2b99e2866e1ffe925025f7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}