{"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/model-agnostic-graph-regularization-for-few","title":"Model-Agnostic Graph Regularization for Few-Shot Learning","arxiv_id":"2102.07077","date":"2021-02-14","proceeding":null,"authors":["Ethan Shen","Maria Brbic","Nicholas Monath","Jiaqi Zhai","Manzil Zaheer","Jure Leskovec"],"abstract":"In many domains, relationships between categories are encoded in the knowledge graph. Recently, promising results have been achieved by incorporating knowledge graph as side information in hard classification tasks with severely limited data. However, prior models consist of highly complex architectures with many sub-components that all seem to impact performance. In this paper, we present a comprehensive empirical study on graph embedded few-shot learning. We introduce a graph regularization approach that allows a deeper understanding of the impact of incorporating graph information between labels. Our proposed regularization is widely applicable and model-agnostic, and boosts the performance of any few-shot learning model, including fine-tuning, metric-based, and optimization-based meta-learning. Our approach improves the performance of strong base learners by up to 2% on Mini-ImageNet and 6.7% on ImageNet-FS, outperforming state-of-the-art graph embedded methods. Additional analyses reveal that graph regularizing models result in a lower loss for more difficult tasks, such as those with fewer shots and less informative support examples.","url_abs":"https://arxiv.org/abs/2102.07077v1","url_pdf":"https://arxiv.org/pdf/2102.07077v1.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":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"model","task_name":"model"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-image-classification-on-imagenet-fs","task":"Few-Shot Image Classification","dataset":"ImageNet-FS (1-shot, novel)","model":"SGM + Graph (ResNet-50)","rank_in_archive_order":3,"of":7,"metrics":{"Top-5 Accuracy (%)":"61.1"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-imagenet-fs-1","task":"Few-Shot Image Classification","dataset":"ImageNet-FS (2-shot, novel)","model":"SGM + Graph (ResNet-50)","rank_in_archive_order":3,"of":8,"metrics":{"Top-5 Accuracy (%)":"70.3"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-imagenet-fs-6","task":"Few-Shot Image Classification","dataset":"ImageNet-FS (5-shot, all)","model":"SGM + graph","rank_in_archive_order":3,"of":8,"metrics":{"Top-5 Accuracy (%)":"78.6"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-imagenet-fs-2","task":"Few-Shot Image Classification","dataset":"ImageNet-FS (5-shot, novel)","model":"SGM + Graph (ResNet-50)","rank_in_archive_order":2,"of":3,"metrics":{"Top-5 Accuracy (%)":"78.6"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2102.07077","atlas_url":"https://app.syntology.ai/?focus=2102.07077","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":"2102.07077"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2102.07077\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2102.07077"},"call":"get_concepts_for_paper(arxiv_id=\"2102.07077\")"}],"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":"c2d8226b5660281de58c91b298beefffbb11a3a71952c2d99589389ca762069a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}