{"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/efficient-lifelong-learning-with-a-gem","title":"Efficient Lifelong Learning with A-GEM","arxiv_id":"1812.00420","date":"2018-12-02","proceeding":"ICLR 2019 5","authors":["Arslan Chaudhry","Marc'Aurelio Ranzato","Marcus Rohrbach","Mohamed Elhoseiny"],"abstract":"In lifelong learning, the learner is presented with a sequence of tasks,\nincrementally building a data-driven prior which may be leveraged to speed up\nlearning of a new task. In this work, we investigate the efficiency of current\nlifelong approaches, in terms of sample complexity, computational and memory\ncost. Towards this end, we first introduce a new and a more realistic\nevaluation protocol, whereby learners observe each example only once and\nhyper-parameter selection is done on a small and disjoint set of tasks, which\nis not used for the actual learning experience and evaluation. Second, we\nintroduce a new metric measuring how quickly a learner acquires a new skill.\nThird, we propose an improved version of GEM (Lopez-Paz & Ranzato, 2017),\ndubbed Averaged GEM (A-GEM), which enjoys the same or even better performance\nas GEM, while being almost as computationally and memory efficient as EWC\n(Kirkpatrick et al., 2016) and other regularization-based methods. Finally, we\nshow that all algorithms including A-GEM can learn even more quickly if they\nare provided with task descriptors specifying the classification tasks under\nconsideration. Our experiments on several standard lifelong learning benchmarks\ndemonstrate that A-GEM has the best trade-off between accuracy and efficiency.","url_abs":"http://arxiv.org/abs/1812.00420v2","url_pdf":"http://arxiv.org/pdf/1812.00420v2.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":"efficient-lifelong-learning-with-a-gem","repo_url":"https://github.com/facebookresearch/agem","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"efficient-lifelong-learning-with-a-gem","repo_url":"https://github.com/ContinualAI/avalanche","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"efficient-lifelong-learning-with-a-gem","repo_url":"https://github.com/aimagelab/mammoth","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"class-incremental-learning","task_name":"Class Incremental Learning"},{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"lifelong-learning","task_name":"Lifelong learning"},{"task_slug":"class-incremental-learning-1","task_name":"class-incremental learning"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/class-incremental-learning-on-cifar100","task":"Class Incremental Learning","dataset":"cifar100","model":"A-GEM","rank_in_archive_order":7,"of":7,"metrics":{"10-stage average accuracy":"45.76"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-asc-19-tasks","task":"Continual Learning","dataset":"ASC (19 tasks)","model":"A-GEM","rank_in_archive_order":6,"of":15,"metrics":{"F1 - macro":"0.7844"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.00420","atlas_url":"https://app.syntology.ai/?focus=1812.00420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00420"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.00420"},"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":"1812.00420"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.00420\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1812.00420"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.00420\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.00420"},"call":"get_concepts_for_paper(arxiv_id=\"1812.00420\")"}],"by_repo":[{"repo":"facebookresearch/agem","kind":"official","samples":12,"ran":2,"instrument":2,"unverified":10},{"repo":"ContinualAI/avalanche","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1606.09282","2007.13904"],"harvested_for_calls":[{"arxiv_id":"1606.09282","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.09282"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.09282\")"},{"arxiv_id":"2007.13904","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.13904"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.13904\")"}]},{"repo":"aimagelab/mammoth","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.15793"],"harvested_for_calls":[{"arxiv_id":"2407.15793","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.15793"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.15793\")"}]}],"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","assemblies":[{"assembly_sha256":"fdecc41a33f4e608","source_kind":"harvested","method_name":"A-GEM","realizes_method":"A-GEM","graph_method":"A-GEM","realizes_severed":false,"claim":"The code implements A-GEM (Averaged Gradient Episodic Memory), a method for efficient lifelong learning that constrains gradient updates to preserve performance on previous tasks.","centrality":"contribution","entry":"Model","entry_sha256":"fc44c3b7614307dc","n_bricks":12,"bricks":[{"entry":"Model","code_sha256":"fc44c3b7614307dc","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"_bn","code_sha256":"60a81bb1d1fb0b67","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"_conv","code_sha256":"0562f5e312d29cbd","role":"helper","order":2,"level":0,"status":"unverified"},{"entry":"_fc","code_sha256":"3de3229cf0087e10","role":"helper","order":3,"level":0,"status":"unverified"},{"entry":"_residual_block","code_sha256":"6a7664c18c49e6ba","role":"helper","order":4,"level":0,"status":"unverified"},{"entry":"_residual_block_first","code_sha256":"5cfb34725fa7d7cc","role":"helper","order":5,"level":0,"status":"unverified"},{"entry":"bias_variable","code_sha256":"a96da1b71ad1a9ef","role":"helper","order":6,"level":0,"status":"unverified"},{"entry":"create_conv_layer","code_sha256":"4531aa012b415174","role":"helper","order":7,"level":1,"status":"ran_draft_wrong"},{"entry":"create_fc_layer","code_sha256":"f5ffbe87b7ec7cb6","role":"helper","order":8,"level":1,"status":"ran_fixture"},{"entry":"vgg_conv_layer","code_sha256":"3dd896a5062484eb","role":"helper","order":9,"level":0,"status":"unverified"},{"entry":"vgg_fc_layer","code_sha256":"b1b9b69ee1f47548","role":"helper","order":10,"level":0,"status":"unverified"},{"entry":"weight_variable","code_sha256":"70fae4aed55bdadc","role":"helper","order":11,"level":0,"status":"unverified"}],"ran_individually":2,"ran_individually_constructed":0,"ran_individually_by_status":{"ran_draft_wrong":1,"ran_fixture":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"1bbbb0310ed6","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"1bbbb0310ed6","realizes_method":"A-GEM","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["fdecc41a33f4e608"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"1812.00420"},"call":"assembly(arxiv_id=\"1812.00420\")"},"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/1812.00420.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/1812.00420.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/aimagelab/mammoth","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ContinualAI/avalanche","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/facebookresearch/agem","reach":null}],"summary":{"ran_draft_wrong":1,"ran_fixture":1,"unverified":10},"n_samples":12,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":10,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":true,"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":12,"ran":2,"n_ran_checked":0,"n_instrument":2,"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-22","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"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"4531aa012b415174","code_sha256_prefix":"4531aa012b415174","entry":"create_conv_layer","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"input:EagerTensor/4/float, w:EagerTensor/4/float, b:EagerTensor/1/float, stride:int/0/int, apply_relu:bool/0/bool","fixture_out_type":"SymbolicTensor","level_recorded_at":"2026-09-25T05:31:51.656759+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4531aa012b415174"}},{"code_sha256":"f5ffbe87b7ec7cb6","code_sha256_prefix":"f5ffbe87b7ec7cb6","entry":"create_fc_layer","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"input:EagerTensor/2/float, w:EagerTensor/2/float, b:EagerTensor/1/float, apply_relu:bool/0/bool","fixture_out_type":"EagerTensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f5ffbe87b7ec7cb6"}},{"code_sha256":"fc44c3b7614307dc","code_sha256_prefix":"fc44c3b7614307dc","entry":"Model","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/model","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fc44c3b7614307dc"}},{"code_sha256":"60a81bb1d1fb0b67","code_sha256_prefix":"60a81bb1d1fb0b67","entry":"_bn","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"60a81bb1d1fb0b67"}},{"code_sha256":"0562f5e312d29cbd","code_sha256_prefix":"0562f5e312d29cbd","entry":"_conv","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0562f5e312d29cbd"}},{"code_sha256":"3de3229cf0087e10","code_sha256_prefix":"3de3229cf0087e10","entry":"_fc","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3de3229cf0087e10"}},{"code_sha256":"6a7664c18c49e6ba","code_sha256_prefix":"6a7664c18c49e6ba","entry":"_residual_block","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6a7664c18c49e6ba"}},{"code_sha256":"5cfb34725fa7d7cc","code_sha256_prefix":"5cfb34725fa7d7cc","entry":"_residual_block_first","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5cfb34725fa7d7cc"}},{"code_sha256":"a96da1b71ad1a9ef","code_sha256_prefix":"a96da1b71ad1a9ef","entry":"bias_variable","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/bias-variable","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a96da1b71ad1a9ef"}},{"code_sha256":"3dd896a5062484eb","code_sha256_prefix":"3dd896a5062484eb","entry":"vgg_conv_layer","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3dd896a5062484eb"}},{"code_sha256":"b1b9b69ee1f47548","code_sha256_prefix":"b1b9b69ee1f47548","entry":"vgg_fc_layer","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/vgg-fc-layer","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b1b9b69ee1f47548"}},{"code_sha256":"70fae4aed55bdadc","code_sha256_prefix":"70fae4aed55bdadc","entry":"weight_variable","repo":"facebookresearch/agem","repo_kind":"official","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/weight-variable","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"70fae4aed55bdadc"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"80a05a91648a182e2c857883e9f0620399e18b47785e3062f1bb77453e463d06","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}