{"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/laplacian-regularized-few-shot-learning","title":"Laplacian Regularized Few-Shot Learning","arxiv_id":null,"date":"2020-06-29","proceeding":"ICML 2020 1","authors":["Imtiaz Masud Ziko; Jose Dolz; Eric Granger; Ismail Ben Ayed"],"abstract":"We propose a transductive Laplacian-regularized inference for few-shot tasks. Given any feature embedding learned from the base classes, we minimize a quadratic binary-assignment function containing two terms: (1) a unary term assign- ing query samples to the nearest class prototype, and (2) a pairwise Laplacian term encouraging nearby query samples to have consistent label as- signments. Our transductive inference does not re-train the base model, and can be viewed as a graph clustering of the query set, subject to super- vision constraints from the support set. We derive a computationally efficient bound optimizer of a relaxation of our function, which computes inde- pendent (parallel) updates for each query sample, while guaranteeing convergence. Following a sim- ple cross-entropy training on the base classes, and without complex meta-learning strategies, we con- ducted comprehensive experiments over five few- shot learning benchmarks. Our LaplacianShot consistently outperforms state-of-the-art methods by significant margins across different models, settings, and data sets. Furthermore, our trans- ductive inference is very fast, with computational times that are close to inductive inference, and can be used for large-scale few-shot tasks.","url_abs":"https://arxiv.org/abs/2006.15486","url_pdf":"https://arxiv.org/pdf/2006.15486.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":"laplacian-regularized-few-shot-learning","repo_url":"https://github.com/imtiazziko/LaplacianShot","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"laplacian-regularized-few-shot-learning","repo_url":"https://github.com/sicara/easy-few-shot-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"few-shot-image-classification","task_name":"Few-Shot Image Classification"},{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"meta-learning","task_name":"Meta-Learning"}],"methods":[{"method_slug":"transductive-inference","method_name":"Transductive Inference"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-image-classification-on-cub-200-5-1","task":"Few-Shot Image Classification","dataset":"CUB 200 5-way 1-shot","model":"LaplacianShot","rank_in_archive_order":18,"of":36,"metrics":{"Accuracy":"80.96"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-cub-200-5","task":"Few-Shot Image Classification","dataset":"CUB 200 5-way 5-shot","model":"LaplacianShot","rank_in_archive_order":22,"of":32,"metrics":{"Accuracy":"88.68"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-6","task":"Few-Shot Image Classification","dataset":"Mini-ImageNet-CUB 5-way (5-shot)","model":"LaplacianShot","rank_in_archive_order":5,"of":8,"metrics":{"Accuracy":"66.33"},"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":"LaplacianShot","rank_in_archive_order":23,"of":105,"metrics":{"Accuracy":"75.57"},"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":"LaplacianShot","rank_in_archive_order":25,"of":95,"metrics":{"Accuracy":"84.72"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-tiered","task":"Few-Shot Image Classification","dataset":"Tiered ImageNet 5-way (1-shot)","model":"LaplacianShot","rank_in_archive_order":11,"of":49,"metrics":{"Accuracy":"80.30"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-tiered-1","task":"Few-Shot Image Classification","dataset":"Tiered ImageNet 5-way (5-shot)","model":"LaplacianShot","rank_in_archive_order":16,"of":51,"metrics":{"Accuracy":"87.93"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-inaturalist","task":"Few-Shot Image Classification","dataset":"iNaturalist (227-way multi-shot)","model":"LaplacianShot","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"74.97"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-miniimagenet-1","task":"Few-Shot Image Classification","dataset":"miniImagenet → CUB (5-way 1-shot)","model":"LaplacianShot","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"55.46"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-miniimagenet-2","task":"Few-Shot Image Classification","dataset":"miniImagenet → CUB (5-way 5-shot)","model":"LaplacianShot","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"66.33"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"imtiazziko/LaplacianShot","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.15486"],"harvested_for_calls":[{"arxiv_id":"2006.15486","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.15486"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.15486\")"}]},{"repo":"sicara/easy-few-shot-learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["1703.05175","2006.15486","2008.11297"],"harvested_for_calls":[{"arxiv_id":"1703.05175","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.05175"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.05175\")"},{"arxiv_id":"2006.15486","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.15486"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.15486\")"},{"arxiv_id":"2008.11297","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2008.11297"},"call":"get_harvested_code_for_paper(arxiv_id=\"2008.11297\")"}]}],"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":"bed3e3a39f4d144d854b76e9795e4f2968383dbd1b4dae85f992bdc3275b3dce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}