{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OSWC5LSUJ2WG664C6KFUWG4AYP","short_pith_number":"pith:OSWC5LSU","schema_version":"1.0","canonical_sha256":"74ac2eae544eac6f7b82f28b4b1b80c3ee17cd45b890f1cf566622c62794bf3f","source":{"kind":"arxiv","id":"1806.05421","version":5},"attestation_state":"computed","paper":{"title":"Selfless Sequential Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Marcus Rohrbach, Rahaf Aljundi, Tinne Tuytelaars","submitted_at":"2018-06-14T09:06:10Z","abstract_excerpt":"Sequential learning, also called lifelong learning, studies the problem of learning tasks in a sequence with access restricted to only the data of the current task. In this paper we look at a scenario with fixed model capacity, and postulate that the learning process should not be selfish, i.e. it should account for future tasks to be added and thus leave enough capacity for them. To achieve Selfless Sequential Learning we study different regularization strategies and activation functions. We find that imposing sparsity at the level of the representation (i.e.~neuron activations) is more benef"},"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":"1806.05421","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-14T09:06:10Z","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"title_canon_sha256":"019cf043d6f1ab96c4068559e453a82d38d8eda8729e9725475af203a53b1d36","abstract_canon_sha256":"9aa25b06bf8f17039a8c565462080311087a8237497e424643ebdd04a242cd54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:45.782757Z","signature_b64":"LA776HGkBmIeO1xUiGq4+4jSGz5HgTaYlnEtvOaDhsiRaKHf8j9Nt+SCy4RBkSAAZTiT2ZtT9qoDJ6OgaxbxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ac2eae544eac6f7b82f28b4b1b80c3ee17cd45b890f1cf566622c62794bf3f","last_reissued_at":"2026-05-17T23:48:45.782247Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:45.782247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selfless Sequential Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Marcus Rohrbach, Rahaf Aljundi, Tinne Tuytelaars","submitted_at":"2018-06-14T09:06:10Z","abstract_excerpt":"Sequential learning, also called lifelong learning, studies the problem of learning tasks in a sequence with access restricted to only the data of the current task. In this paper we look at a scenario with fixed model capacity, and postulate that the learning process should not be selfish, i.e. it should account for future tasks to be added and thus leave enough capacity for them. To achieve Selfless Sequential Learning we study different regularization strategies and activation functions. We find that imposing sparsity at the level of the representation (i.e.~neuron activations) is more benef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05421","kind":"arxiv","version":5},"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":"1806.05421","created_at":"2026-05-17T23:48:45.782341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05421v5","created_at":"2026-05-17T23:48:45.782341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05421","created_at":"2026-05-17T23:48:45.782341+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSWC5LSUJ2WG","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSWC5LSUJ2WG664C","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSWC5LSU","created_at":"2026-05-18T12:32:43.782077+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/OSWC5LSUJ2WG664C6KFUWG4AYP","json":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP.json","graph_json":"https://pith.science/api/pith-number/OSWC5LSUJ2WG664C6KFUWG4AYP/graph.json","events_json":"https://pith.science/api/pith-number/OSWC5LSUJ2WG664C6KFUWG4AYP/events.json","paper":"https://pith.science/paper/OSWC5LSU"},"agent_actions":{"view_html":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP","download_json":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP.json","view_paper":"https://pith.science/paper/OSWC5LSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05421&json=true","fetch_graph":"https://pith.science/api/pith-number/OSWC5LSUJ2WG664C6KFUWG4AYP/graph.json","fetch_events":"https://pith.science/api/pith-number/OSWC5LSUJ2WG664C6KFUWG4AYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP/action/storage_attestation","attest_author":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP/action/author_attestation","sign_citation":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP/action/citation_signature","submit_replication":"https://pith.science/pith/OSWC5LSUJ2WG664C6KFUWG4AYP/action/replication_record"}},"created_at":"2026-05-17T23:48:45.782341+00:00","updated_at":"2026-05-17T23:48:45.782341+00:00"}