{"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/meta-learning-with-differentiable-convex","title":"Meta-Learning with Differentiable Convex Optimization","arxiv_id":"1904.03758","date":"2019-04-07","proceeding":"CVPR 2019 6","authors":["Kwonjoon Lee","Subhransu Maji","Avinash Ravichandran","Stefano Soatto"],"abstract":"Many meta-learning approaches for few-shot learning rely on simple base\nlearners such as nearest-neighbor classifiers. However, even in the few-shot\nregime, discriminatively trained linear predictors can offer better\ngeneralization. We propose to use these predictors as base learners to learn\nrepresentations for few-shot learning and show they offer better tradeoffs\nbetween feature size and performance across a range of few-shot recognition\nbenchmarks. Our objective is to learn feature embeddings that generalize well\nunder a linear classification rule for novel categories. To efficiently solve\nthe objective, we exploit two properties of linear classifiers: implicit\ndifferentiation of the optimality conditions of the convex problem and the dual\nformulation of the optimization problem. This allows us to use high-dimensional\nembeddings with improved generalization at a modest increase in computational\noverhead. Our approach, named MetaOptNet, achieves state-of-the-art performance\non miniImageNet, tieredImageNet, CIFAR-FS, and FC100 few-shot learning\nbenchmarks. Our code is available at https://github.com/kjunelee/MetaOptNet.","url_abs":"http://arxiv.org/abs/1904.03758v2","url_pdf":"http://arxiv.org/pdf/1904.03758v2.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":"meta-learning-with-differentiable-convex","repo_url":"https://github.com/kjunelee/MetaOptNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"meta-learning-with-differentiable-convex","repo_url":"https://github.com/cyvius96/few-shot-meta-baseline","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"meta-learning-with-differentiable-convex","repo_url":"https://github.com/goldblum/AdversarialQuerying","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"meta-learning-with-differentiable-convex","repo_url":"https://github.com/nupurkmr9/S2M2_fewshot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"meta-learning-with-differentiable-convex","repo_url":"https://github.com/xiangyu8/PT-MAP-sf","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"meta-learning-with-differentiable-convex","repo_url":"https://github.com/yinboc/few-shot-meta-baseline","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"meta-learning-with-differentiable-convex","repo_url":"https://github.com/learnables/learn2learn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"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"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-image-classification-on-cifar-fs-5","task":"Few-Shot Image Classification","dataset":"CIFAR-FS 5-way (1-shot)","model":"MetaOptNet-SVM-trainval","rank_in_archive_order":32,"of":38,"metrics":{"Accuracy":"72.8"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-cifar-fs-5-1","task":"Few-Shot Image Classification","dataset":"CIFAR-FS 5-way (5-shot)","model":"MetaOptNet-SVM-trainval","rank_in_archive_order":32,"of":39,"metrics":{"Accuracy":"85"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-fc100-5-way","task":"Few-Shot Image Classification","dataset":"FC100 5-way (1-shot)","model":"MetaOptNet-SVM-trainval","rank_in_archive_order":12,"of":22,"metrics":{"Accuracy":"47.2"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-fc100-5-way-1","task":"Few-Shot Image Classification","dataset":"FC100 5-way (5-shot)","model":"MetaOptNet-SVM-trainval","rank_in_archive_order":14,"of":22,"metrics":{"Accuracy":"62.5"},"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":"MetaOptNet-SVM-trainval","rank_in_archive_order":63,"of":105,"metrics":{"Accuracy":"64.09"},"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":"MetaOptNet-SVM-trainval","rank_in_archive_order":54,"of":95,"metrics":{"Accuracy":"80"},"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":"MetaOptNet-SVM-trainval","rank_in_archive_order":43,"of":49,"metrics":{"Accuracy":"65.81"},"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":"MetaOptNet-SVM-trainval","rank_in_archive_order":42,"of":51,"metrics":{"Accuracy":"81.75"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.03758","atlas_url":"https://app.syntology.ai/?focus=1904.03758","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.03758"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.03758\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.03758"},"call":"get_concepts_for_paper(arxiv_id=\"1904.03758\")"}],"by_repo":[{"repo":"kjunelee/MetaOptNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2602.17947"],"harvested_for_calls":[{"arxiv_id":"2602.17947","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2602.17947"},"call":"get_harvested_code_for_paper(arxiv_id=\"2602.17947\")"}]},{"repo":"cyvius96/few-shot-meta-baseline","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2003.04390"],"harvested_for_calls":[{"arxiv_id":"2003.04390","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.04390"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.04390\")"}]},{"repo":"goldblum/AdversarialQuerying","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1703.05175","1910.00982"],"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":"1910.00982","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.00982"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.00982\")"}]},{"repo":"nupurkmr9/S2M2_fewshot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xiangyu8/PT-MAP-sf","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.03806"],"harvested_for_calls":[{"arxiv_id":"2006.03806","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.03806"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.03806\")"}]},{"repo":"yinboc/few-shot-meta-baseline","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1904.04232"],"harvested_for_calls":[{"arxiv_id":"1904.04232","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.04232"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.04232\")"}]},{"repo":"learnables/learn2learn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1703.03400","1703.05175","1803.02999","2008.12284"],"harvested_for_calls":[{"arxiv_id":"1703.03400","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.03400"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.03400\")"},{"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":"1803.02999","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.02999"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.02999\")"},{"arxiv_id":"2008.12284","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2008.12284"},"call":"get_harvested_code_for_paper(arxiv_id=\"2008.12284\")"}]}],"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":"2d5334a824fac461273a8a32ce4ccb159d20049368d23cccdf302ed52e1dd9ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}