{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R3J2IJERJSE7TUVGY2GCYV2XSS","short_pith_number":"pith:R3J2IJER","schema_version":"1.0","canonical_sha256":"8ed3a424914c89f9d2a6c68c2c5757949fcdfcacb9f618be0d71dcadb8956bf4","source":{"kind":"arxiv","id":"2411.11238","version":1},"attestation_state":"computed","paper":{"title":"Reliable Learning of Halfspaces under Gaussian Marginals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Lisheng Ren, Nikos Zarifis","submitted_at":"2024-11-18T02:13:11Z","abstract_excerpt":"We study the problem of PAC learning halfspaces in the reliable agnostic model of Kalai et al. (2012). The reliable PAC model captures learning scenarios where one type of error is costlier than the others. Our main positive result is a new algorithm for reliable learning of Gaussian halfspaces on $\\mathbb{R}^d$ with sample and computational complexity $$d^{O(\\log (\\min\\{1/\\alpha, 1/\\epsilon\\}))}\\min (2^{\\log(1/\\epsilon)^{O(\\log (1/\\alpha))}},2^{\\mathrm{poly}(1/\\epsilon)})\\;,$$ where $\\epsilon$ is the excess error and $\\alpha$ is the bias of the optimal halfspace. We complement our upper bound"},"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.11238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-18T02:13:11Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"dd35439916f277bf3efe866ba1527de11cc98280576dfcc9c610ee5f495abad2","abstract_canon_sha256":"7a3ab8ee3031e01c2803d33caf81d2d6e37ea703ab2fa52a1cc07d4417053e3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:53.331979Z","signature_b64":"GNuUHp7yDsPhbUpTC/Uq84F38yF2rZnKAdmXl808QQbU8CqWI8egG+JXBd86MwmaN5Z/SICQ0dZLAdLJfg1LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ed3a424914c89f9d2a6c68c2c5757949fcdfcacb9f618be0d71dcadb8956bf4","last_reissued_at":"2026-07-05T09:36:53.331525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:53.331525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliable Learning of Halfspaces under Gaussian Marginals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Lisheng Ren, Nikos Zarifis","submitted_at":"2024-11-18T02:13:11Z","abstract_excerpt":"We study the problem of PAC learning halfspaces in the reliable agnostic model of Kalai et al. (2012). The reliable PAC model captures learning scenarios where one type of error is costlier than the others. Our main positive result is a new algorithm for reliable learning of Gaussian halfspaces on $\\mathbb{R}^d$ with sample and computational complexity $$d^{O(\\log (\\min\\{1/\\alpha, 1/\\epsilon\\}))}\\min (2^{\\log(1/\\epsilon)^{O(\\log (1/\\alpha))}},2^{\\mathrm{poly}(1/\\epsilon)})\\;,$$ where $\\epsilon$ is the excess error and $\\alpha$ is the bias of the optimal halfspace. We complement our upper bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11238","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.11238/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.11238","created_at":"2026-07-05T09:36:53.331578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.11238v1","created_at":"2026-07-05T09:36:53.331578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11238","created_at":"2026-07-05T09:36:53.331578+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3J2IJERJSE7","created_at":"2026-07-05T09:36:53.331578+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3J2IJERJSE7TUVG","created_at":"2026-07-05T09:36:53.331578+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3J2IJER","created_at":"2026-07-05T09:36:53.331578+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/R3J2IJERJSE7TUVGY2GCYV2XSS","json":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS.json","graph_json":"https://pith.science/api/pith-number/R3J2IJERJSE7TUVGY2GCYV2XSS/graph.json","events_json":"https://pith.science/api/pith-number/R3J2IJERJSE7TUVGY2GCYV2XSS/events.json","paper":"https://pith.science/paper/R3J2IJER"},"agent_actions":{"view_html":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS","download_json":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS.json","view_paper":"https://pith.science/paper/R3J2IJER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.11238&json=true","fetch_graph":"https://pith.science/api/pith-number/R3J2IJERJSE7TUVGY2GCYV2XSS/graph.json","fetch_events":"https://pith.science/api/pith-number/R3J2IJERJSE7TUVGY2GCYV2XSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS/action/storage_attestation","attest_author":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS/action/author_attestation","sign_citation":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS/action/citation_signature","submit_replication":"https://pith.science/pith/R3J2IJERJSE7TUVGY2GCYV2XSS/action/replication_record"}},"created_at":"2026-07-05T09:36:53.331578+00:00","updated_at":"2026-07-05T09:36:53.331578+00:00"}