{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4HWSJ5N5MQH4PRBKR7MRUMKE77","short_pith_number":"pith:4HWSJ5N5","schema_version":"1.0","canonical_sha256":"e1ed24f5bd640fc7c42a8fd91a3144ffcd882c29d04ccfba1a9bf2f25ba3fd51","source":{"kind":"arxiv","id":"2006.07326","version":2},"attestation_state":"computed","paper":{"title":"CPR: Classifier-Projection Regularization for Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Flavio P. Calmon, Hsiang Hsu, Sungmin Cha, Taebaek Hwang, Taesup Moon","submitted_at":"2020-06-12T17:07:37Z","abstract_excerpt":"We propose a general, yet simple patch that can be applied to existing regularization-based continual learning methods called classifier-projection regularization (CPR). Inspired by both recent results on neural networks with wide local minima and information theory, CPR adds an additional regularization term that maximizes the entropy of a classifier's output probability. We demonstrate that this additional term can be interpreted as a projection of the conditional probability given by a classifier's output to the uniform distribution. By applying the Pythagorean theorem for KL divergence, we"},"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":"2006.07326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-12T17:07:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"6efb147ba74ff79c2833c20e2573720a501e3fa59c99c228f4b00b69d40647ed","abstract_canon_sha256":"7a1536119378e844b4ee05ba7ef19d94c2d068b3c9ec7c0d5cb9dbe4ff897e0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:05.114507Z","signature_b64":"XcPk7WSY0dTNdFvPp9VWvudXYTDs7DM9VPJAMEYWms8GPEhykknlBZ7yg1iNcLA/C96mwa4Dh+Ou2nZ09UjgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1ed24f5bd640fc7c42a8fd91a3144ffcd882c29d04ccfba1a9bf2f25ba3fd51","last_reissued_at":"2026-07-05T02:33:05.114066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:05.114066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CPR: Classifier-Projection Regularization for Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Flavio P. Calmon, Hsiang Hsu, Sungmin Cha, Taebaek Hwang, Taesup Moon","submitted_at":"2020-06-12T17:07:37Z","abstract_excerpt":"We propose a general, yet simple patch that can be applied to existing regularization-based continual learning methods called classifier-projection regularization (CPR). Inspired by both recent results on neural networks with wide local minima and information theory, CPR adds an additional regularization term that maximizes the entropy of a classifier's output probability. We demonstrate that this additional term can be interpreted as a projection of the conditional probability given by a classifier's output to the uniform distribution. By applying the Pythagorean theorem for KL divergence, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07326","kind":"arxiv","version":2},"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/2006.07326/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":"2006.07326","created_at":"2026-07-05T02:33:05.114125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.07326v2","created_at":"2026-07-05T02:33:05.114125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07326","created_at":"2026-07-05T02:33:05.114125+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HWSJ5N5MQH4","created_at":"2026-07-05T02:33:05.114125+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HWSJ5N5MQH4PRBK","created_at":"2026-07-05T02:33:05.114125+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HWSJ5N5","created_at":"2026-07-05T02:33:05.114125+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30190","citing_title":"Few-Shot Domain Incremental Learning via Continual Vision-Language Consolidation","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2511.01831","citing_title":"Routing-Based Continual Learning for Multimodal Large Language Models","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77","json":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77.json","graph_json":"https://pith.science/api/pith-number/4HWSJ5N5MQH4PRBKR7MRUMKE77/graph.json","events_json":"https://pith.science/api/pith-number/4HWSJ5N5MQH4PRBKR7MRUMKE77/events.json","paper":"https://pith.science/paper/4HWSJ5N5"},"agent_actions":{"view_html":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77","download_json":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77.json","view_paper":"https://pith.science/paper/4HWSJ5N5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.07326&json=true","fetch_graph":"https://pith.science/api/pith-number/4HWSJ5N5MQH4PRBKR7MRUMKE77/graph.json","fetch_events":"https://pith.science/api/pith-number/4HWSJ5N5MQH4PRBKR7MRUMKE77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77/action/storage_attestation","attest_author":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77/action/author_attestation","sign_citation":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77/action/citation_signature","submit_replication":"https://pith.science/pith/4HWSJ5N5MQH4PRBKR7MRUMKE77/action/replication_record"}},"created_at":"2026-07-05T02:33:05.114125+00:00","updated_at":"2026-07-05T02:33:05.114125+00:00"}