{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CJTRUDNCZM34FMICAXBS5AMAQX","short_pith_number":"pith:CJTRUDNC","schema_version":"1.0","canonical_sha256":"12671a0da2cb37c2b10205c32e818085c13c42ef9057ebdb9b3ac81cd5b588a6","source":{"kind":"arxiv","id":"1703.03400","version":3},"attestation_state":"computed","paper":{"title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Chelsea Finn, Pieter Abbeel, Sergey Levine","submitted_at":"2017-03-09T18:58:03Z","abstract_excerpt":"We propose an algorithm for meta-learning that is model-agnostic, in the sense that it is compatible with any model trained with gradient descent and applicable to a variety of different learning problems, including classification, regression, and reinforcement learning. The goal of meta-learning is to train a model on a variety of learning tasks, such that it can solve new learning tasks using only a small number of training samples. In our approach, the parameters of the model are explicitly trained such that a small number of gradient steps with a small amount of training data from a new ta"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.03400","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-09T18:58:03Z","cross_cats_sorted":["cs.AI","cs.CV","cs.NE"],"title_canon_sha256":"e03416382c63ae305df23039ed50de0e37820a5c637b6d79e2cc12f6ca903641","abstract_canon_sha256":"5c6ab5e2a3567ea09fd0595c43cff35019dd509e897463a5c8dda38f798ee295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:06.925515Z","signature_b64":"SjuG+9N6N5M0Xbwpt2XwBwwX6/GDXDUOKuS5yu7WuuwMUCSrz9Ei9z56bt4X344cyX2PMX/p6mFgKw5R3Gh4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12671a0da2cb37c2b10205c32e818085c13c42ef9057ebdb9b3ac81cd5b588a6","last_reissued_at":"2026-05-18T00:40:06.924916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:06.924916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Chelsea Finn, Pieter Abbeel, Sergey Levine","submitted_at":"2017-03-09T18:58:03Z","abstract_excerpt":"We propose an algorithm for meta-learning that is model-agnostic, in the sense that it is compatible with any model trained with gradient descent and applicable to a variety of different learning problems, including classification, regression, and reinforcement learning. The goal of meta-learning is to train a model on a variety of learning tasks, such that it can solve new learning tasks using only a small number of training samples. In our approach, the parameters of the model are explicitly trained such that a small number of gradient steps with a small amount of training data from a new ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03400","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.03400","created_at":"2026-05-18T00:40:06.924992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03400v3","created_at":"2026-05-18T00:40:06.924992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03400","created_at":"2026-05-18T00:40:06.924992+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJTRUDNCZM34","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJTRUDNCZM34FMIC","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJTRUDNC","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":26,"internal_anchor_count":18,"sample":[{"citing_arxiv_id":"1907.02057","citing_title":"Benchmarking Model-Based Reinforcement Learning","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"1907.04632","citing_title":"Video Action Recognition Via Neural Architecture Searching","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05415","citing_title":"Learning to learn with quantum neural networks via classical neural networks","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06077","citing_title":"Evolvability ES: Scalable and Direct Optimization of Evolvability","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22082","citing_title":"CoRMA: Contrastive RMA for Contact-Rich Meta-Adaptation","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16477","citing_title":"Seeking the Unfamiliar but Memorable: Conceptual Creativity as Meta-Learning","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19080","citing_title":"MANGO: Meta-Adaptive Network Gradient Optimization for Online Continual Learning","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18404","citing_title":"JanusPipe: Efficient Pipeline Parallel Training for Machine Learning Interatomic Potentials","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18704","citing_title":"Learned Memory Attenuation in Sage-Husa Kalman Filters for Robust UAV State Estimation","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18404","citing_title":"JanusPipe: Efficient Pipeline Parallel Training for Machine Learning Interatomic Potentials","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2509.20786","citing_title":"LiLAW: Lightweight Learnable Adaptive Weighting to Learn Sample Difficulty & Improve Noisy Training","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"1911.05507","citing_title":"Compressive Transformers for Long-Range Sequence Modelling","ref_index":92,"is_internal_anchor":true},{"citing_arxiv_id":"2102.01293","citing_title":"Scaling Laws for Transfer","ref_index":170,"is_internal_anchor":true},{"citing_arxiv_id":"2409.12917","citing_title":"Training Language Models to Self-Correct via Reinforcement Learning","ref_index":199,"is_internal_anchor":true},{"citing_arxiv_id":"2512.07236","citing_title":"Counting voids and filaments: Betti Curves as a Powerful Probe for Cosmology","ref_index":82,"is_internal_anchor":true},{"citing_arxiv_id":"1909.01066","citing_title":"Language Models as Knowledge Bases?","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2309.16797","citing_title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","ref_index":110,"is_internal_anchor":true},{"citing_arxiv_id":"1910.07113","citing_title":"Solving Rubik's Cube with a Robot Hand","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"1710.05941","citing_title":"Searching for Activation Functions","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03413","citing_title":"Learning to Theorize the World from Observation","ref_index":136,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24397","citing_title":"Few-Shot Cross-Device Transfer for Quantum Noise Modeling on Real Hardware","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2112.00861","citing_title":"A General Language Assistant as a Laboratory for Alignment","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2207.05221","citing_title":"Language Models (Mostly) Know What They Know","ref_index":93,"is_internal_anchor":false},{"citing_arxiv_id":"2005.14165","citing_title":"Language Models are Few-Shot Learners","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20148","citing_title":"Meta-Tool: Efficient Few-Shot Tool Adaptation for Small Language Models","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX","json":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX.json","graph_json":"https://pith.science/api/pith-number/CJTRUDNCZM34FMICAXBS5AMAQX/graph.json","events_json":"https://pith.science/api/pith-number/CJTRUDNCZM34FMICAXBS5AMAQX/events.json","paper":"https://pith.science/paper/CJTRUDNC"},"agent_actions":{"view_html":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX","download_json":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX.json","view_paper":"https://pith.science/paper/CJTRUDNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03400&json=true","fetch_graph":"https://pith.science/api/pith-number/CJTRUDNCZM34FMICAXBS5AMAQX/graph.json","fetch_events":"https://pith.science/api/pith-number/CJTRUDNCZM34FMICAXBS5AMAQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX/action/storage_attestation","attest_author":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX/action/author_attestation","sign_citation":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX/action/citation_signature","submit_replication":"https://pith.science/pith/CJTRUDNCZM34FMICAXBS5AMAQX/action/replication_record"}},"created_at":"2026-05-18T00:40:06.924992+00:00","updated_at":"2026-05-18T00:40:06.924992+00:00"}