{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CKFURUSX2ZB4UPAEEAZ2B3XVHA","short_pith_number":"pith:CKFURUSX","schema_version":"1.0","canonical_sha256":"128b48d257d643ca3c042033a0eef538022cfa04f0ecf01daad1b2dfe1c89f91","source":{"kind":"arxiv","id":"2306.16352","version":1},"attestation_state":"computed","paper":{"title":"Information-Computation Tradeoffs for Learning Margin 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-06-28T16:33:39Z","abstract_excerpt":"We study the problem of PAC learning $\\gamma$-margin halfspaces with Random Classification Noise. We establish an information-computation tradeoff suggesting an inherent gap between the sample complexity of the problem and the sample complexity of computationally efficient algorithms. Concretely, the sample complexity of the problem is $\\widetilde{\\Theta}(1/(\\gamma^2 \\epsilon))$. We start by giving a simple efficient algorithm with sample complexity $\\widetilde{O}(1/(\\gamma^2 \\epsilon^2))$. Our main result is a lower bound for Statistical Query (SQ) algorithms and low-degree polynomial tests 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":"2306.16352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-28T16:33:39Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7d27f8f3c1e925fb480c4ffafeb8144f9e28f25ba8ef59920aef28e353e814f9","abstract_canon_sha256":"1271fdc7d24695a42e4cb40b61bba1ea70cad180fa63372932cf08218730a1e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:55.185672Z","signature_b64":"v4FRr9WF7bc8CwiUkR3AZLd/zkH8smHHAk17IoPlNxhkFdGYNa+oS89OU4WOr9kNqZG6V913qOGfon2u524jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"128b48d257d643ca3c042033a0eef538022cfa04f0ecf01daad1b2dfe1c89f91","last_reissued_at":"2026-07-05T06:25:55.185070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:55.185070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-Computation Tradeoffs for Learning Margin 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-06-28T16:33:39Z","abstract_excerpt":"We study the problem of PAC learning $\\gamma$-margin halfspaces with Random Classification Noise. We establish an information-computation tradeoff suggesting an inherent gap between the sample complexity of the problem and the sample complexity of computationally efficient algorithms. Concretely, the sample complexity of the problem is $\\widetilde{\\Theta}(1/(\\gamma^2 \\epsilon))$. We start by giving a simple efficient algorithm with sample complexity $\\widetilde{O}(1/(\\gamma^2 \\epsilon^2))$. Our main result is a lower bound for Statistical Query (SQ) algorithms and low-degree polynomial tests s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16352","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/2306.16352/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":"2306.16352","created_at":"2026-07-05T06:25:55.185130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.16352v1","created_at":"2026-07-05T06:25:55.185130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16352","created_at":"2026-07-05T06:25:55.185130+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKFURUSX2ZB4","created_at":"2026-07-05T06:25:55.185130+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKFURUSX2ZB4UPAE","created_at":"2026-07-05T06:25:55.185130+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKFURUSX","created_at":"2026-07-05T06:25:55.185130+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/CKFURUSX2ZB4UPAEEAZ2B3XVHA","json":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA.json","graph_json":"https://pith.science/api/pith-number/CKFURUSX2ZB4UPAEEAZ2B3XVHA/graph.json","events_json":"https://pith.science/api/pith-number/CKFURUSX2ZB4UPAEEAZ2B3XVHA/events.json","paper":"https://pith.science/paper/CKFURUSX"},"agent_actions":{"view_html":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA","download_json":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA.json","view_paper":"https://pith.science/paper/CKFURUSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.16352&json=true","fetch_graph":"https://pith.science/api/pith-number/CKFURUSX2ZB4UPAEEAZ2B3XVHA/graph.json","fetch_events":"https://pith.science/api/pith-number/CKFURUSX2ZB4UPAEEAZ2B3XVHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA/action/storage_attestation","attest_author":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA/action/author_attestation","sign_citation":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA/action/citation_signature","submit_replication":"https://pith.science/pith/CKFURUSX2ZB4UPAEEAZ2B3XVHA/action/replication_record"}},"created_at":"2026-07-05T06:25:55.185130+00:00","updated_at":"2026-07-05T06:25:55.185130+00:00"}