{"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-sgd-learning-to-learn-quickly-for-few","title":"Meta-SGD: Learning to Learn Quickly for Few-Shot Learning","arxiv_id":"1707.09835","date":"2017-07-31","proceeding":null,"authors":["Zhenguo Li","Fengwei Zhou","Fei Chen","Hang Li"],"abstract":"Few-shot learning is challenging for learning algorithms that learn each task\nin isolation and from scratch. In contrast, meta-learning learns from many\nrelated tasks a meta-learner that can learn a new task more accurately and\nfaster with fewer examples, where the choice of meta-learners is crucial. In\nthis paper, we develop Meta-SGD, an SGD-like, easily trainable meta-learner\nthat can initialize and adapt any differentiable learner in just one step, on\nboth supervised learning and reinforcement learning. Compared to the popular\nmeta-learner LSTM, Meta-SGD is conceptually simpler, easier to implement, and\ncan be learned more efficiently. Compared to the latest meta-learner MAML,\nMeta-SGD has a much higher capacity by learning to learn not just the learner\ninitialization, but also the learner update direction and learning rate, all in\na single meta-learning process. Meta-SGD shows highly competitive performance\nfor few-shot learning on regression, classification, and reinforcement\nlearning.","url_abs":"http://arxiv.org/abs/1707.09835v2","url_pdf":"http://arxiv.org/pdf/1707.09835v2.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-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/BBDrive/Meta-SGD-RL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/ash3n/Meta-Gradients","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/ash3n/Meta-SGD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/ash3n/Meta-SGD-TF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/foolyc/Meta-SGD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/llan-ml/tesp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/myungsub/meta-interpolation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","repo_url":"https://github.com/tobiasvanderwerff/MetaHTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"meta-sgd-learning-to-learn-quickly-for-few","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-learning","task_name":"Few-Shot Learning"},{"task_slug":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"maml","method_name":"MAML"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-image-classification-on-mini-7","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (1-shot)","model":"Meta SGD","rank_in_archive_order":3,"of":6,"metrics":{"Accuracy":"17.56"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-7","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (1-shot)","model":"Matching Nets, (from )","rank_in_archive_order":4,"of":6,"metrics":{"Accuracy":"17.31"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-7","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (1-shot)","model":"Meta LSTM, (from )","rank_in_archive_order":5,"of":6,"metrics":{"Accuracy":"16.70"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-7","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (1-shot)","model":"MAML, (from )","rank_in_archive_order":6,"of":6,"metrics":{"Accuracy":"16.49"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-8","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (5-shot)","model":"Meta SGD","rank_in_archive_order":3,"of":6,"metrics":{"Accuracy":"28.92"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-8","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (5-shot)","model":"Meta LSTM, (from )","rank_in_archive_order":4,"of":6,"metrics":{"Accuracy":"26.06"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-8","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (5-shot)","model":"Matching Nets, (from )","rank_in_archive_order":5,"of":6,"metrics":{"Accuracy":"22.69"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-8","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 20-way (5-shot)","model":"MAML, (from )","rank_in_archive_order":6,"of":6,"metrics":{"Accuracy":"19.29"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.09835","atlas_url":"https://app.syntology.ai/?focus=1707.09835","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":"1707.09835"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.09835\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.09835"},"call":"get_concepts_for_paper(arxiv_id=\"1707.09835\")"}],"by_repo":[{"repo":"BBDrive/Meta-SGD-RL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.03400"],"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\")"}]},{"repo":"ash3n/Meta-Gradients","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ash3n/Meta-SGD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ash3n/Meta-SGD-TF","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"foolyc/Meta-SGD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"llan-ml/tesp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"myungsub/meta-interpolation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tobiasvanderwerff/MetaHTR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1811.00751"],"harvested_for_calls":[{"arxiv_id":"1811.00751","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.00751"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.00751\")"}]},{"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":"8f0519cd2b75142dd4fa33d6f99da9b26611dd6d6f944870bef5176ea7cb0462","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}