{"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/multi-scale-adaptive-task-attention-network","title":"Multi-scale Adaptive Task Attention Network for Few-Shot Learning","arxiv_id":"2011.14479","date":"2020-11-30","proceeding":null,"authors":["Haoxing Chen","Huaxiong Li","Yaohui Li","Chunlin Chen"],"abstract":"The goal of few-shot learning is to classify unseen categories with few labeled samples. Recently, the low-level information metric-learning based methods have achieved satisfying performance, since local representations (LRs) are more consistent between seen and unseen classes. However, most of these methods deal with each category in the support set independently, which is not sufficient to measure the relation between features, especially in a certain task. Moreover, the low-level information-based metric learning method suffers when dominant objects of different scales exist in a complex background. To address these issues, this paper proposes a novel Multi-scale Adaptive Task Attention Network (MATANet) for few-shot learning. Specifically, we first use a multi-scale feature generator to generate multiple features at different scales. Then, an adaptive task attention module is proposed to select the most important LRs among the entire task. Afterwards, a similarity-to-class module and a fusion layer are utilized to calculate a joint multi-scale similarity between the query image and the support set. Extensive experiments on popular benchmarks clearly show the effectiveness of the proposed MATANet compared with state-of-the-art methods.","url_abs":"https://arxiv.org/abs/2011.14479v1","url_pdf":"https://arxiv.org/pdf/2011.14479v1.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":[],"tasks":[{"task_slug":"few-shot-image-classification","task_name":"Few-Shot Image Classification"},{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"metric-learning","task_name":"Metric Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-image-classification-on-cub-200-2011","task":"Few-Shot Image Classification","dataset":"CUB-200-2011 5-way (1-shot)","model":"MATANet","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"67.33"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-cub-200-2011-2","task":"Few-Shot Image Classification","dataset":"CUB-200-2011 5-way (5-shot)","model":"MATANet","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"83.92"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-2","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 5-way (1-shot)","model":"MATANet","rank_in_archive_order":87,"of":105,"metrics":{"Accuracy":"53.63"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-3","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 5-way (5-shot)","model":"MATANet","rank_in_archive_order":75,"of":95,"metrics":{"Accuracy":"72.67"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-stanford-2","task":"Few-Shot Image Classification","dataset":"Stanford Cars 5-way (1-shot)","model":"MATANet","rank_in_archive_order":1,"of":6,"metrics":{"Accuracy":"73.15"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-stanford-3","task":"Few-Shot Image Classification","dataset":"Stanford Cars 5-way (5-shot)","model":"MATANet","rank_in_archive_order":1,"of":6,"metrics":{"Accuracy":"91.89"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-stanford","task":"Few-Shot Image Classification","dataset":"Stanford Dogs 5-way (1-shot)","model":"MATANet","rank_in_archive_order":2,"of":3,"metrics":{"Accuracy":"55.63"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-stanford-1","task":"Few-Shot Image Classification","dataset":"Stanford Dogs 5-way (5-shot)","model":"MATANet","rank_in_archive_order":2,"of":6,"metrics":{"Accuracy":"70.29"},"uses_additional_data":false}],"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b7e8df3feb9682938b2d559f0562f0fb5b3de53558b7c9a622f28010a0773504","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}