{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VDHYIQMDDGWDJNOKENH5PDXAIH","short_pith_number":"pith:VDHYIQMD","schema_version":"1.0","canonical_sha256":"a8cf84418319ac34b5ca234fd78ee041cf8496b0f25f63eba7fd4b45c4fae2b4","source":{"kind":"arxiv","id":"1712.03847","version":1},"attestation_state":"computed","paper":{"title":"On Quadratic Penalties in Elastic Weight Consolidation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ferenc Husz\\'ar","submitted_at":"2017-12-11T15:49:02Z","abstract_excerpt":"Elastic weight consolidation (EWC, Kirkpatrick et al, 2017) is a novel algorithm designed to safeguard against catastrophic forgetting in neural networks. EWC can be seen as an approximation to Laplace propagation (Eskin et al, 2004), and this view is consistent with the motivation given by Kirkpatrick et al (2017). In this note, I present an extended derivation that covers the case when there are more than two tasks. I show that the quadratic penalties in EWC are inconsistent with this derivation and might lead to double-counting data from earlier tasks."},"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":"1712.03847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-11T15:49:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"20fdeed8edb2fb4fc39949d39deaedcf904a6cd6a593f594a120b7242711e285","abstract_canon_sha256":"70f4b28a85b23035e4969f69301f88fa00d24cb39a7dfe164c2286d4573b8a3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:29:48.338259Z","signature_b64":"UIJNd/A/jARLns7preGfYtRHq+voeEcIxQO0Dvcwt8wXAHszod4Tf95m7DupZXAAuaWpDuE/kbuo4pvCPfM/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8cf84418319ac34b5ca234fd78ee041cf8496b0f25f63eba7fd4b45c4fae2b4","last_reissued_at":"2026-07-05T04:29:48.337803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:29:48.337803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Quadratic Penalties in Elastic Weight Consolidation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ferenc Husz\\'ar","submitted_at":"2017-12-11T15:49:02Z","abstract_excerpt":"Elastic weight consolidation (EWC, Kirkpatrick et al, 2017) is a novel algorithm designed to safeguard against catastrophic forgetting in neural networks. EWC can be seen as an approximation to Laplace propagation (Eskin et al, 2004), and this view is consistent with the motivation given by Kirkpatrick et al (2017). In this note, I present an extended derivation that covers the case when there are more than two tasks. I show that the quadratic penalties in EWC are inconsistent with this derivation and might lead to double-counting data from earlier tasks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03847","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1712.03847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1712.03847","created_at":"2026-07-05T04:29:48.337853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03847v1","created_at":"2026-07-05T04:29:48.337853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03847","created_at":"2026-07-05T04:29:48.337853+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDHYIQMDDGWD","created_at":"2026-07-05T04:29:48.337853+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDHYIQMDDGWDJNOK","created_at":"2026-07-05T04:29:48.337853+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDHYIQMD","created_at":"2026-07-05T04:29:48.337853+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01866","citing_title":"Online Curvature-Aware Replay: Leveraging $\\mathbf{2^{nd}}$ Order Information for Online Continual Learning","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH","json":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH.json","graph_json":"https://pith.science/api/pith-number/VDHYIQMDDGWDJNOKENH5PDXAIH/graph.json","events_json":"https://pith.science/api/pith-number/VDHYIQMDDGWDJNOKENH5PDXAIH/events.json","paper":"https://pith.science/paper/VDHYIQMD"},"agent_actions":{"view_html":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH","download_json":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH.json","view_paper":"https://pith.science/paper/VDHYIQMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03847&json=true","fetch_graph":"https://pith.science/api/pith-number/VDHYIQMDDGWDJNOKENH5PDXAIH/graph.json","fetch_events":"https://pith.science/api/pith-number/VDHYIQMDDGWDJNOKENH5PDXAIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH/action/storage_attestation","attest_author":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH/action/author_attestation","sign_citation":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH/action/citation_signature","submit_replication":"https://pith.science/pith/VDHYIQMDDGWDJNOKENH5PDXAIH/action/replication_record"}},"created_at":"2026-07-05T04:29:48.337853+00:00","updated_at":"2026-07-05T04:29:48.337853+00:00"}