{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PEWB52WWWWHOD26PV7AVHXVI52","short_pith_number":"pith:PEWB52WW","schema_version":"1.0","canonical_sha256":"792c1eead6b58ee1ebcfafc153dea8ee8ae3da77df3f9e1c7bf22985aef22cf7","source":{"kind":"arxiv","id":"2307.08438","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Jelena Diakonikolas, Nikos Zarifis, Puqian Wang","submitted_at":"2023-07-13T18:59:28Z","abstract_excerpt":"We study the problem of learning general (i.e., not necessarily homogeneous) halfspaces with Random Classification Noise under the Gaussian distribution. We establish nearly-matching algorithmic and Statistical Query (SQ) lower bound results revealing a surprising information-computation gap for this basic problem. Specifically, the sample complexity of this learning problem is $\\widetilde{\\Theta}(d/\\epsilon)$, where $d$ is the dimension and $\\epsilon$ is the excess error. Our positive result is a computationally efficient learning algorithm with sample complexity $\\tilde{O}(d/\\epsilon + d/(\\m"},"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":"2307.08438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-13T18:59:28Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"81937a71d6b2ade9d0a476f985b74967ed5822932849eff15632ad0b6712a0b1","abstract_canon_sha256":"65390c8b8244ab703cf43064a06e1d64ab5923be949de56fb0433739f6b2c24e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:24.670597Z","signature_b64":"e1qs6a4LAkz/hS33os5o3m5Jg7FGtvRTAXRrpbDT05n0hMUf1TsNHSr7AUrHH9NH1eRVc80WURuefAYZwbUHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"792c1eead6b58ee1ebcfafc153dea8ee8ae3da77df3f9e1c7bf22985aef22cf7","last_reissued_at":"2026-07-05T06:31:24.669951Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:24.669951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Jelena Diakonikolas, Nikos Zarifis, Puqian Wang","submitted_at":"2023-07-13T18:59:28Z","abstract_excerpt":"We study the problem of learning general (i.e., not necessarily homogeneous) halfspaces with Random Classification Noise under the Gaussian distribution. We establish nearly-matching algorithmic and Statistical Query (SQ) lower bound results revealing a surprising information-computation gap for this basic problem. Specifically, the sample complexity of this learning problem is $\\widetilde{\\Theta}(d/\\epsilon)$, where $d$ is the dimension and $\\epsilon$ is the excess error. Our positive result is a computationally efficient learning algorithm with sample complexity $\\tilde{O}(d/\\epsilon + d/(\\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08438","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/2307.08438/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":"2307.08438","created_at":"2026-07-05T06:31:24.670030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08438v1","created_at":"2026-07-05T06:31:24.670030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08438","created_at":"2026-07-05T06:31:24.670030+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEWB52WWWWHO","created_at":"2026-07-05T06:31:24.670030+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEWB52WWWWHOD26P","created_at":"2026-07-05T06:31:24.670030+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEWB52WW","created_at":"2026-07-05T06:31:24.670030+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/PEWB52WWWWHOD26PV7AVHXVI52","json":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52.json","graph_json":"https://pith.science/api/pith-number/PEWB52WWWWHOD26PV7AVHXVI52/graph.json","events_json":"https://pith.science/api/pith-number/PEWB52WWWWHOD26PV7AVHXVI52/events.json","paper":"https://pith.science/paper/PEWB52WW"},"agent_actions":{"view_html":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52","download_json":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52.json","view_paper":"https://pith.science/paper/PEWB52WW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08438&json=true","fetch_graph":"https://pith.science/api/pith-number/PEWB52WWWWHOD26PV7AVHXVI52/graph.json","fetch_events":"https://pith.science/api/pith-number/PEWB52WWWWHOD26PV7AVHXVI52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52/action/storage_attestation","attest_author":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52/action/author_attestation","sign_citation":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52/action/citation_signature","submit_replication":"https://pith.science/pith/PEWB52WWWWHOD26PV7AVHXVI52/action/replication_record"}},"created_at":"2026-07-05T06:31:24.670030+00:00","updated_at":"2026-07-05T06:31:24.670030+00:00"}