{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EDBQA5W5RLPTMBNVYD64Y6UPYB","short_pith_number":"pith:EDBQA5W5","schema_version":"1.0","canonical_sha256":"20c30076dd8adf3605b5c0fdcc7a8fc05b5d03532a67fc873ae0e9e016bd2bac","source":{"kind":"arxiv","id":"2312.08977","version":4},"attestation_state":"computed","paper":{"title":"Weighted Ensemble Models Are Strong Continual Learners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Enzo Tartaglione, Imad Eddine Marouf, St\\'ephane Lathuili\\`ere, Subhankar Roy","submitted_at":"2023-12-14T14:26:57Z","abstract_excerpt":"In this work, we study the problem of continual learning (CL) where the goal is to learn a model on a sequence of tasks, such that the data from the previous tasks becomes unavailable while learning on the current task data. CL is essentially a balancing act between being able to learn on the new task (i.e., plasticity) and maintaining the performance on the previously learned concepts (i.e., stability). Intending to address the stability-plasticity trade-off, we propose to perform weight-ensembling of the model parameters of the previous and current tasks. This weighted-ensembled model, which"},"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":"2312.08977","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-14T14:26:57Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"6eaef5aecba6de44ac3a815b4c23b2aa4d5c0c4f89c67a3338c48de2f1b0b6ae","abstract_canon_sha256":"d355df63257ef96e96e281e3828c5ffb2364479fc2f3b849e6750dd21c969885"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:27.634774Z","signature_b64":"sIfkMzakoAYjpEyHlk3kH5o6IINh3C6l7c6rJ9RVmD2K08xePaRdjQdSBLqXnXBqHRZ+ZJoIsn9olAAJBqIDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20c30076dd8adf3605b5c0fdcc7a8fc05b5d03532a67fc873ae0e9e016bd2bac","last_reissued_at":"2026-07-05T09:47:27.634292Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:27.634292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Ensemble Models Are Strong Continual Learners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Enzo Tartaglione, Imad Eddine Marouf, St\\'ephane Lathuili\\`ere, Subhankar Roy","submitted_at":"2023-12-14T14:26:57Z","abstract_excerpt":"In this work, we study the problem of continual learning (CL) where the goal is to learn a model on a sequence of tasks, such that the data from the previous tasks becomes unavailable while learning on the current task data. CL is essentially a balancing act between being able to learn on the new task (i.e., plasticity) and maintaining the performance on the previously learned concepts (i.e., stability). Intending to address the stability-plasticity trade-off, we propose to perform weight-ensembling of the model parameters of the previous and current tasks. This weighted-ensembled model, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.08977","kind":"arxiv","version":4},"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/2312.08977/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":"2312.08977","created_at":"2026-07-05T09:47:27.634352+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.08977v4","created_at":"2026-07-05T09:47:27.634352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08977","created_at":"2026-07-05T09:47:27.634352+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDBQA5W5RLPT","created_at":"2026-07-05T09:47:27.634352+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDBQA5W5RLPTMBNV","created_at":"2026-07-05T09:47:27.634352+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDBQA5W5","created_at":"2026-07-05T09:47:27.634352+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09713","citing_title":"Zero-Shot Synthetic-to-Real Handwritten Text Recognition via Task Analogies","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB","json":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB.json","graph_json":"https://pith.science/api/pith-number/EDBQA5W5RLPTMBNVYD64Y6UPYB/graph.json","events_json":"https://pith.science/api/pith-number/EDBQA5W5RLPTMBNVYD64Y6UPYB/events.json","paper":"https://pith.science/paper/EDBQA5W5"},"agent_actions":{"view_html":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB","download_json":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB.json","view_paper":"https://pith.science/paper/EDBQA5W5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.08977&json=true","fetch_graph":"https://pith.science/api/pith-number/EDBQA5W5RLPTMBNVYD64Y6UPYB/graph.json","fetch_events":"https://pith.science/api/pith-number/EDBQA5W5RLPTMBNVYD64Y6UPYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB/action/storage_attestation","attest_author":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB/action/author_attestation","sign_citation":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB/action/citation_signature","submit_replication":"https://pith.science/pith/EDBQA5W5RLPTMBNVYD64Y6UPYB/action/replication_record"}},"created_at":"2026-07-05T09:47:27.634352+00:00","updated_at":"2026-07-05T09:47:27.634352+00:00"}