{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V3ZUVYL4SZ3K5NJTLTPMLCII66","short_pith_number":"pith:V3ZUVYL4","schema_version":"1.0","canonical_sha256":"aef34ae17c9676aeb5335cdec58908f7a677bbb6d241bc0ef060f641b12c6409","source":{"kind":"arxiv","id":"2402.05576","version":4},"attestation_state":"computed","paper":{"title":"Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"A. Martina Neuman, Anastasis Kratsios, Gudmund Pammer","submitted_at":"2024-02-08T11:23:11Z","abstract_excerpt":"Machine learning models with inputs in a Euclidean space $\\mathbb{R}^d$, when implemented on digital computers, generalize, and their generalization gap converges to $0$ at a rate of $c/N^{1/2}$ concerning the sample size $N$. However, the constant $c>0$ obtained through classical methods can be large in terms of the ambient dimension $d$ and machine precision, posing a challenge when $N$ is small to realistically large. In this paper, we derive a family of generalization bounds $\\{c_m/N^{1/(2\\vee m)}\\}_{m=1}^{\\infty}$ tailored for learning models on digital computers, which adapt to both the "},"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":"2402.05576","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-08T11:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"2219a57ced1ca304467d72744139ac436a93fd85059ee4147e985fd09970587f","abstract_canon_sha256":"1d21d0ff0ec5d4981241c58d617f18a9643f6cf8ddef72bf480238f179b19640"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:47.019503Z","signature_b64":"IaiNRVoNrIabNOBVvwsedI9epKnQBEY2/8gEstOVJC0oLllXc/tnjfizrD1y6sHbMzNZWzQO8Ai5r4SbTGQHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aef34ae17c9676aeb5335cdec58908f7a677bbb6d241bc0ef060f641b12c6409","last_reissued_at":"2026-05-18T03:09:47.018745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:47.018745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"A. Martina Neuman, Anastasis Kratsios, Gudmund Pammer","submitted_at":"2024-02-08T11:23:11Z","abstract_excerpt":"Machine learning models with inputs in a Euclidean space $\\mathbb{R}^d$, when implemented on digital computers, generalize, and their generalization gap converges to $0$ at a rate of $c/N^{1/2}$ concerning the sample size $N$. However, the constant $c>0$ obtained through classical methods can be large in terms of the ambient dimension $d$ and machine precision, posing a challenge when $N$ is small to realistically large. In this paper, we derive a family of generalization bounds $\\{c_m/N^{1/(2\\vee m)}\\}_{m=1}^{\\infty}$ tailored for learning models on digital computers, which adapt to both the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05576","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":""},"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":"2402.05576","created_at":"2026-05-18T03:09:47.018860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05576v4","created_at":"2026-05-18T03:09:47.018860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05576","created_at":"2026-05-18T03:09:47.018860+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3ZUVYL4SZ3K","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3ZUVYL4SZ3K5NJT","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3ZUVYL4","created_at":"2026-05-18T12:33:37.589309+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/V3ZUVYL4SZ3K5NJTLTPMLCII66","json":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66.json","graph_json":"https://pith.science/api/pith-number/V3ZUVYL4SZ3K5NJTLTPMLCII66/graph.json","events_json":"https://pith.science/api/pith-number/V3ZUVYL4SZ3K5NJTLTPMLCII66/events.json","paper":"https://pith.science/paper/V3ZUVYL4"},"agent_actions":{"view_html":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66","download_json":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66.json","view_paper":"https://pith.science/paper/V3ZUVYL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05576&json=true","fetch_graph":"https://pith.science/api/pith-number/V3ZUVYL4SZ3K5NJTLTPMLCII66/graph.json","fetch_events":"https://pith.science/api/pith-number/V3ZUVYL4SZ3K5NJTLTPMLCII66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66/action/storage_attestation","attest_author":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66/action/author_attestation","sign_citation":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66/action/citation_signature","submit_replication":"https://pith.science/pith/V3ZUVYL4SZ3K5NJTLTPMLCII66/action/replication_record"}},"created_at":"2026-05-18T03:09:47.018860+00:00","updated_at":"2026-05-18T03:09:47.018860+00:00"}