{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XUYN2KRVUQYPOO4OZZXGKPA3HM","short_pith_number":"pith:XUYN2KRV","schema_version":"1.0","canonical_sha256":"bd30dd2a35a430f73b8ece6e653c1b3b2b0435f7a2523e62c49462abb3ff4279","source":{"kind":"arxiv","id":"1810.11910","version":3},"attestation_state":"computed","paper":{"title":"Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gerald Tesauro, Ignacio Cases, Irina Rish, Matthew Riemer, Miao Liu, Robert Ajemian, Yuhai Tu","submitted_at":"2018-10-29T00:13:50Z","abstract_excerpt":"Lack of performance when it comes to continual learning over non-stationary distributions of data remains a major challenge in scaling neural network learning to more human realistic settings. In this work we propose a new conceptualization of the continual learning problem in terms of a temporally symmetric trade-off between transfer and interference that can be optimized by enforcing gradient alignment across examples. We then propose a new algorithm, Meta-Experience Replay (MER), that directly exploits this view by combining experience replay with optimization based meta-learning. This meth"},"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":"1810.11910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T00:13:50Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"1d03e3aee03af7475008f1ec7ba3cf37606b4ef74f2a10f1fd0a19fc49aa6cac","abstract_canon_sha256":"a920f6006eb329e7ada705dfa9c5fc0c991d1dcde088ae436c54b43fb0617780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:08.605656Z","signature_b64":"cWZqCNykVkS0J6AQUcyfUwMuduLTFOVfbxDegAT7tzUbokoGSFl3ZKdAQZhcClxJyy1ZAKCEULhpYMGMyf+ZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd30dd2a35a430f73b8ece6e653c1b3b2b0435f7a2523e62c49462abb3ff4279","last_reissued_at":"2026-05-17T23:47:08.605126Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:08.605126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gerald Tesauro, Ignacio Cases, Irina Rish, Matthew Riemer, Miao Liu, Robert Ajemian, Yuhai Tu","submitted_at":"2018-10-29T00:13:50Z","abstract_excerpt":"Lack of performance when it comes to continual learning over non-stationary distributions of data remains a major challenge in scaling neural network learning to more human realistic settings. In this work we propose a new conceptualization of the continual learning problem in terms of a temporally symmetric trade-off between transfer and interference that can be optimized by enforcing gradient alignment across examples. We then propose a new algorithm, Meta-Experience Replay (MER), that directly exploits this view by combining experience replay with optimization based meta-learning. This meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11910","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":"1810.11910","created_at":"2026-05-17T23:47:08.605203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11910v3","created_at":"2026-05-17T23:47:08.605203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11910","created_at":"2026-05-17T23:47:08.605203+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUYN2KRVUQYP","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUYN2KRVUQYPOO4O","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUYN2KRV","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1906.09205","citing_title":"Continual Reinforcement Learning with Diversity Exploration and Adversarial Self-Correction","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2504.13541","citing_title":"Scalable Multi-Task Learning through Spiking Neural Networks with Adaptive Task-Switching Policy for Intelligent Autonomous Agents","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19080","citing_title":"MANGO: Meta-Adaptive Network Gradient Optimization for Online Continual Learning","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02633","citing_title":"Analytic Drift Resister for Non-Exemplar Continual Graph Learning","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM","json":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM.json","graph_json":"https://pith.science/api/pith-number/XUYN2KRVUQYPOO4OZZXGKPA3HM/graph.json","events_json":"https://pith.science/api/pith-number/XUYN2KRVUQYPOO4OZZXGKPA3HM/events.json","paper":"https://pith.science/paper/XUYN2KRV"},"agent_actions":{"view_html":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM","download_json":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM.json","view_paper":"https://pith.science/paper/XUYN2KRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11910&json=true","fetch_graph":"https://pith.science/api/pith-number/XUYN2KRVUQYPOO4OZZXGKPA3HM/graph.json","fetch_events":"https://pith.science/api/pith-number/XUYN2KRVUQYPOO4OZZXGKPA3HM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM/action/storage_attestation","attest_author":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM/action/author_attestation","sign_citation":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM/action/citation_signature","submit_replication":"https://pith.science/pith/XUYN2KRVUQYPOO4OZZXGKPA3HM/action/replication_record"}},"created_at":"2026-05-17T23:47:08.605203+00:00","updated_at":"2026-05-17T23:47:08.605203+00:00"}