{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P6RTX77HVN7ZZBS5AL4C4ZE6NN","short_pith_number":"pith:P6RTX77H","schema_version":"1.0","canonical_sha256":"7fa33bffe7ab7f9c865d02f82e649e6b468e7cc01d8cd288400db019c2758be9","source":{"kind":"arxiv","id":"2411.13733","version":1},"attestation_state":"computed","paper":{"title":"On Generalization Bounds for Neural Networks with Low Rank Layers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshay Rangamani, Andrea Pinto, Tomaso Poggio","submitted_at":"2024-11-20T22:20:47Z","abstract_excerpt":"While previous optimization results have suggested that deep neural networks tend to favour low-rank weight matrices, the implications of this inductive bias on generalization bounds remain underexplored. In this paper, we apply Maurer's chain rule for Gaussian complexity to analyze how low-rank layers in deep networks can prevent the accumulation of rank and dimensionality factors that typically multiply across layers. This approach yields generalization bounds for rank and spectral norm constrained networks. We compare our results to prior generalization bounds for deep networks, highlightin"},"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":"2411.13733","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-20T22:20:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"917c5bc9451a69879b2d3eb80f516b001a17265971b0c5869d48b582b03e0216","abstract_canon_sha256":"3563f785f4bfdfd7880cb502851f4103b39e8bb1f58cad69a3811318a580e248"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:36.444182Z","signature_b64":"l02O6MOBcg6JHDjGB7EVErKNILHVx02iL9XR06zS0zJhC1GJQnHeHZfA5v1dEuVwepf0o7Ni8IZ7aIKczQD3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fa33bffe7ab7f9c865d02f82e649e6b468e7cc01d8cd288400db019c2758be9","last_reissued_at":"2026-07-05T09:38:36.443716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:36.443716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Generalization Bounds for Neural Networks with Low Rank Layers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshay Rangamani, Andrea Pinto, Tomaso Poggio","submitted_at":"2024-11-20T22:20:47Z","abstract_excerpt":"While previous optimization results have suggested that deep neural networks tend to favour low-rank weight matrices, the implications of this inductive bias on generalization bounds remain underexplored. In this paper, we apply Maurer's chain rule for Gaussian complexity to analyze how low-rank layers in deep networks can prevent the accumulation of rank and dimensionality factors that typically multiply across layers. This approach yields generalization bounds for rank and spectral norm constrained networks. We compare our results to prior generalization bounds for deep networks, highlightin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13733","kind":"arxiv","version":1},"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/2411.13733/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":"2411.13733","created_at":"2026-07-05T09:38:36.443775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13733v1","created_at":"2026-07-05T09:38:36.443775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13733","created_at":"2026-07-05T09:38:36.443775+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6RTX77HVN7Z","created_at":"2026-07-05T09:38:36.443775+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6RTX77HVN7ZZBS5","created_at":"2026-07-05T09:38:36.443775+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6RTX77H","created_at":"2026-07-05T09:38:36.443775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05300","citing_title":"Parameter Symmetry Potentially Unifies Deep Learning Theory","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN","json":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN.json","graph_json":"https://pith.science/api/pith-number/P6RTX77HVN7ZZBS5AL4C4ZE6NN/graph.json","events_json":"https://pith.science/api/pith-number/P6RTX77HVN7ZZBS5AL4C4ZE6NN/events.json","paper":"https://pith.science/paper/P6RTX77H"},"agent_actions":{"view_html":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN","download_json":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN.json","view_paper":"https://pith.science/paper/P6RTX77H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13733&json=true","fetch_graph":"https://pith.science/api/pith-number/P6RTX77HVN7ZZBS5AL4C4ZE6NN/graph.json","fetch_events":"https://pith.science/api/pith-number/P6RTX77HVN7ZZBS5AL4C4ZE6NN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN/action/storage_attestation","attest_author":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN/action/author_attestation","sign_citation":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN/action/citation_signature","submit_replication":"https://pith.science/pith/P6RTX77HVN7ZZBS5AL4C4ZE6NN/action/replication_record"}},"created_at":"2026-07-05T09:38:36.443775+00:00","updated_at":"2026-07-05T09:38:36.443775+00:00"}