{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KVM6ZJAOMBF5PTAKDEIR7OXZU5","short_pith_number":"pith:KVM6ZJAO","schema_version":"1.0","canonical_sha256":"5559eca40e604bd7cc0a19111fbaf9a74d89cad5cb22fa4c80b337b0a233aa44","source":{"kind":"arxiv","id":"2210.08442","version":1},"attestation_state":"computed","paper":{"title":"Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Shaolei Ren, Wang Zhu, Yejia Liu","submitted_at":"2022-10-16T04:32:01Z","abstract_excerpt":"Continual learning faces a crucial challenge of catastrophic forgetting. To address this challenge, experience replay (ER) that maintains a tiny subset of samples from previous tasks has been commonly used. Existing ER works usually focus on refining the learning objective for each task with a static memory construction policy. In this paper, we formulate the dynamic memory construction in ER as a combinatorial optimization problem, which aims at directly minimizing the global loss across all experienced tasks. We first apply three tactics to solve the problem in the offline setting as a start"},"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":"2210.08442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-16T04:32:01Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"fa2504e384a1c92851918dd219bfe534a491e8419750c0c2e9359eced1712475","abstract_canon_sha256":"ec31b7d09a235629c506681d3639a73ae4b9056d51b6d72ec5220628a91fee4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:10.938249Z","signature_b64":"VXzOvPIQOodh4HuWy1K1CAY62boAa3SXBtXZMLx8Q9LX3+KLAL5uV07H+jYQ1sutWZUm10DZitLbuBA7506eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5559eca40e604bd7cc0a19111fbaf9a74d89cad5cb22fa4c80b337b0a233aa44","last_reissued_at":"2026-07-05T05:07:10.937605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:10.937605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Shaolei Ren, Wang Zhu, Yejia Liu","submitted_at":"2022-10-16T04:32:01Z","abstract_excerpt":"Continual learning faces a crucial challenge of catastrophic forgetting. To address this challenge, experience replay (ER) that maintains a tiny subset of samples from previous tasks has been commonly used. Existing ER works usually focus on refining the learning objective for each task with a static memory construction policy. In this paper, we formulate the dynamic memory construction in ER as a combinatorial optimization problem, which aims at directly minimizing the global loss across all experienced tasks. We first apply three tactics to solve the problem in the offline setting as a start"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08442","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/2210.08442/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":"2210.08442","created_at":"2026-07-05T05:07:10.937668+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.08442v1","created_at":"2026-07-05T05:07:10.937668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08442","created_at":"2026-07-05T05:07:10.937668+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVM6ZJAOMBF5","created_at":"2026-07-05T05:07:10.937668+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVM6ZJAOMBF5PTAK","created_at":"2026-07-05T05:07:10.937668+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVM6ZJAO","created_at":"2026-07-05T05:07:10.937668+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5","json":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5.json","graph_json":"https://pith.science/api/pith-number/KVM6ZJAOMBF5PTAKDEIR7OXZU5/graph.json","events_json":"https://pith.science/api/pith-number/KVM6ZJAOMBF5PTAKDEIR7OXZU5/events.json","paper":"https://pith.science/paper/KVM6ZJAO"},"agent_actions":{"view_html":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5","download_json":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5.json","view_paper":"https://pith.science/paper/KVM6ZJAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.08442&json=true","fetch_graph":"https://pith.science/api/pith-number/KVM6ZJAOMBF5PTAKDEIR7OXZU5/graph.json","fetch_events":"https://pith.science/api/pith-number/KVM6ZJAOMBF5PTAKDEIR7OXZU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/action/storage_attestation","attest_author":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/action/author_attestation","sign_citation":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/action/citation_signature","submit_replication":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/action/replication_record"}},"created_at":"2026-07-05T05:07:10.937668+00:00","updated_at":"2026-07-05T05:07:10.937668+00:00"}