{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3AOPLWK2NEUZ63NCYBAG3MFVTC","short_pith_number":"pith:3AOPLWK2","schema_version":"1.0","canonical_sha256":"d81cf5d95a69299f6da2c0406db0b5988b85b90fe7d4ea5ebd08201e88e26eb6","source":{"kind":"arxiv","id":"1908.07585","version":2},"attestation_state":"computed","paper":{"title":"Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel M. Roy, Jun Yang, Shengyang Sun","submitted_at":"2019-08-20T19:46:14Z","abstract_excerpt":"The developments of Rademacher complexity and PAC-Bayesian theory have been largely independent. One exception is the PAC-Bayes theorem of Kakade, Sridharan, and Tewari (2008), which is established via Rademacher complexity theory by viewing Gibbs classifiers as linear operators. The goal of this paper is to extend this bridge between Rademacher complexity and state-of-the-art PAC-Bayesian theory. We first demonstrate that one can match the fast rate of Catoni's PAC-Bayes bounds (Catoni, 2007) using shifted Rademacher processes (Wegkamp, 2003; Lecu\\'{e} and Mitchell, 2012; Zhivotovskiy and Han"},"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":"1908.07585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-20T19:46:14Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7e9e0adabc648d3a943cb1d9521552021939c31110b4bff9940d35db1663fec9","abstract_canon_sha256":"2eb3a8c2cd697b0ff8791fc4ab75999a60045102467198ca1615df19eee6204d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:06.841418Z","signature_b64":"YFrzZmxMT7jr+ckJV11MsmmEpJkmtF0cXkDTC+nUSpckmxK2J9cZSHBXnhdCrxYIqET2ghYdGTBJKFVKgXKUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81cf5d95a69299f6da2c0406db0b5988b85b90fe7d4ea5ebd08201e88e26eb6","last_reissued_at":"2026-07-05T00:23:06.840944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:06.840944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel M. Roy, Jun Yang, Shengyang Sun","submitted_at":"2019-08-20T19:46:14Z","abstract_excerpt":"The developments of Rademacher complexity and PAC-Bayesian theory have been largely independent. One exception is the PAC-Bayes theorem of Kakade, Sridharan, and Tewari (2008), which is established via Rademacher complexity theory by viewing Gibbs classifiers as linear operators. The goal of this paper is to extend this bridge between Rademacher complexity and state-of-the-art PAC-Bayesian theory. We first demonstrate that one can match the fast rate of Catoni's PAC-Bayes bounds (Catoni, 2007) using shifted Rademacher processes (Wegkamp, 2003; Lecu\\'{e} and Mitchell, 2012; Zhivotovskiy and Han"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07585","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/1908.07585/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":"1908.07585","created_at":"2026-07-05T00:23:06.841010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07585v2","created_at":"2026-07-05T00:23:06.841010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07585","created_at":"2026-07-05T00:23:06.841010+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AOPLWK2NEUZ","created_at":"2026-07-05T00:23:06.841010+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AOPLWK2NEUZ63NC","created_at":"2026-07-05T00:23:06.841010+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AOPLWK2","created_at":"2026-07-05T00:23:06.841010+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/3AOPLWK2NEUZ63NCYBAG3MFVTC","json":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC.json","graph_json":"https://pith.science/api/pith-number/3AOPLWK2NEUZ63NCYBAG3MFVTC/graph.json","events_json":"https://pith.science/api/pith-number/3AOPLWK2NEUZ63NCYBAG3MFVTC/events.json","paper":"https://pith.science/paper/3AOPLWK2"},"agent_actions":{"view_html":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC","download_json":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC.json","view_paper":"https://pith.science/paper/3AOPLWK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07585&json=true","fetch_graph":"https://pith.science/api/pith-number/3AOPLWK2NEUZ63NCYBAG3MFVTC/graph.json","fetch_events":"https://pith.science/api/pith-number/3AOPLWK2NEUZ63NCYBAG3MFVTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC/action/storage_attestation","attest_author":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC/action/author_attestation","sign_citation":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC/action/citation_signature","submit_replication":"https://pith.science/pith/3AOPLWK2NEUZ63NCYBAG3MFVTC/action/replication_record"}},"created_at":"2026-07-05T00:23:06.841010+00:00","updated_at":"2026-07-05T00:23:06.841010+00:00"}