{"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-latent-embedding","title":"Meta-Learning with Latent Embedding Optimization","arxiv_id":"1807.05960","date":"2018-07-16","proceeding":"ICLR 2019 5","authors":["Andrei A. Rusu","Dushyant Rao","Jakub Sygnowski","Oriol Vinyals","Razvan Pascanu","Simon Osindero","Raia Hadsell"],"abstract":"Gradient-based meta-learning techniques are both widely applicable and\nproficient at solving challenging few-shot learning and fast adaptation\nproblems. However, they have practical difficulties when operating on\nhigh-dimensional parameter spaces in extreme low-data regimes. We show that it\nis possible to bypass these limitations by learning a data-dependent latent\ngenerative representation of model parameters, and performing gradient-based\nmeta-learning in this low-dimensional latent space. The resulting approach,\nlatent embedding optimization (LEO), decouples the gradient-based adaptation\nprocedure from the underlying high-dimensional space of model parameters. Our\nevaluation shows that LEO can achieve state-of-the-art performance on the\ncompetitive miniImageNet and tieredImageNet few-shot classification tasks.\nFurther analysis indicates LEO is able to capture uncertainty in the data, and\ncan perform adaptation more effectively by optimizing in latent space.","url_abs":"http://arxiv.org/abs/1807.05960v3","url_pdf":"http://arxiv.org/pdf/1807.05960v3.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-latent-embedding","repo_url":"https://github.com/deepmind/leo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"meta-learning-with-latent-embedding","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-latent-embedding","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-latent-embedding","repo_url":"https://github.com/jiean001/models_m/tree/main/LEO","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"meta-learning-with-latent-embedding","repo_url":"https://github.com/timchen0618/pytorch-leo","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"meta-learning","task_name":"Meta-Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.05960","atlas_url":"https://app.syntology.ai/?focus=1807.05960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05960"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1807.05960"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1807.05960"},"call":"get_harvested_code_for_paper(arxiv_id=\"1807.05960\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1807.05960"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.05960\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.05960"},"call":"get_concepts_for_paper(arxiv_id=\"1807.05960\")"}],"by_repo":[{"repo":"deepmind/leo","kind":"official","samples":2,"ran":2,"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":"jiean001/models_m","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.16143"],"harvested_for_calls":[{"arxiv_id":"2010.16143","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16143"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16143\")"}]},{"repo":"timchen0618/pytorch-leo","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1807.05960.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1807.05960.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/timchen0618/pytorch-leo","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/xiangyu8/PT-MAP-sf","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/deepmind/leo","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/yinboc/few-shot-meta-baseline","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jiean001/models_m/tree/main/LEO","reach":null}],"summary":{"ran":2},"n_samples":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":2,"ran":2,"n_ran_checked":2,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"77443dabd1669a5b","code_sha256_prefix":"77443dabd1669a5b","entry":"evaluate_and_average","repo":"deepmind/leo","repo_kind":"official","path":"utils.py","file_url":"https://github.com/deepmind/leo/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"session:MockTFSession/0/?, tensor:str/0/str, num_estimates:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"77443dabd1669a5b"}},{"code_sha256":"c5f5703f6ed3dc01","code_sha256_prefix":"c5f5703f6ed3dc01","entry":"get_orthogonality_regularizer","repo":"deepmind/leo","repo_kind":"official","path":"model.py","file_url":"https://github.com/deepmind/leo/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"orthogonality_penalty_weight:float/0/float","fixture_out_type":"function","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c5f5703f6ed3dc01"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e0a5120c1c04e642fec4350b6fca9e92354aa4553af12b76a9cefc363de9162d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}