{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:65TL6CITSRT46DQ2SNF5YRDTVU","short_pith_number":"pith:65TL6CIT","schema_version":"1.0","canonical_sha256":"f766bf09139467cf0e1a934bdc4473ad09a9f01b9bc6a6a593cf5633331b7e9a","source":{"kind":"arxiv","id":"2505.14635","version":2},"attestation_state":"computed","paper":{"title":"Bridging Predictive Coding and MDL: A Two-Part Code Framework for Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abdul Malik Zekri, Ankur Mali, Benjamin Prada, Shion Matsumoto","submitted_at":"2025-05-20T17:25:16Z","abstract_excerpt":"We present the first theoretical framework that connects predictive coding (PC), a biologically inspired local learning rule, with the minimum description length (MDL) principle in deep networks. We prove that layerwise PC performs block-coordinate descent on the MDL two-part code objective, thereby jointly minimizing empirical risk and model complexity. Using Hoeffding's inequality and a prefix-code prior, we derive a novel generalization bound of the form $R(\\theta) \\le \\hat{R}(\\theta) + \\frac{L(\\theta)}{N}$, capturing the tradeoff between fit and compression. We further prove that each PC s"},"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":"2505.14635","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-20T17:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"032504b81bdbd47e5096cabac9144010f98a5b8dab15b23d9ec7ba16a8d1dc69","abstract_canon_sha256":"7f21c088ecfff17a042b5a91fa8ba84ae015ce30d5f27e191e1b8e1af0874cb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:07.292093Z","signature_b64":"elPbzFbg9HQPZbZvjFrPtnsCgdGPHKtGRQMIg30rSNLDKo9gxSsIziaeJOfdACzVY5O5b+9+Q/KLcm78MlxfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f766bf09139467cf0e1a934bdc4473ad09a9f01b9bc6a6a593cf5633331b7e9a","last_reissued_at":"2026-07-05T11:38:07.291539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:07.291539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bridging Predictive Coding and MDL: A Two-Part Code Framework for Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abdul Malik Zekri, Ankur Mali, Benjamin Prada, Shion Matsumoto","submitted_at":"2025-05-20T17:25:16Z","abstract_excerpt":"We present the first theoretical framework that connects predictive coding (PC), a biologically inspired local learning rule, with the minimum description length (MDL) principle in deep networks. We prove that layerwise PC performs block-coordinate descent on the MDL two-part code objective, thereby jointly minimizing empirical risk and model complexity. Using Hoeffding's inequality and a prefix-code prior, we derive a novel generalization bound of the form $R(\\theta) \\le \\hat{R}(\\theta) + \\frac{L(\\theta)}{N}$, capturing the tradeoff between fit and compression. We further prove that each PC s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14635","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/2505.14635/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":"2505.14635","created_at":"2026-07-05T11:38:07.291592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14635v2","created_at":"2026-07-05T11:38:07.291592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14635","created_at":"2026-07-05T11:38:07.291592+00:00"},{"alias_kind":"pith_short_12","alias_value":"65TL6CITSRT4","created_at":"2026-07-05T11:38:07.291592+00:00"},{"alias_kind":"pith_short_16","alias_value":"65TL6CITSRT46DQ2","created_at":"2026-07-05T11:38:07.291592+00:00"},{"alias_kind":"pith_short_8","alias_value":"65TL6CIT","created_at":"2026-07-05T11:38:07.291592+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/65TL6CITSRT46DQ2SNF5YRDTVU","json":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU.json","graph_json":"https://pith.science/api/pith-number/65TL6CITSRT46DQ2SNF5YRDTVU/graph.json","events_json":"https://pith.science/api/pith-number/65TL6CITSRT46DQ2SNF5YRDTVU/events.json","paper":"https://pith.science/paper/65TL6CIT"},"agent_actions":{"view_html":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU","download_json":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU.json","view_paper":"https://pith.science/paper/65TL6CIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14635&json=true","fetch_graph":"https://pith.science/api/pith-number/65TL6CITSRT46DQ2SNF5YRDTVU/graph.json","fetch_events":"https://pith.science/api/pith-number/65TL6CITSRT46DQ2SNF5YRDTVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/action/storage_attestation","attest_author":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/action/author_attestation","sign_citation":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/action/citation_signature","submit_replication":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/action/replication_record"}},"created_at":"2026-07-05T11:38:07.291592+00:00","updated_at":"2026-07-05T11:38:07.291592+00:00"}