{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U5ID35FSO3SXVAPRTFD65RMIIJ","short_pith_number":"pith:U5ID35FS","schema_version":"1.0","canonical_sha256":"a7503df4b276e57a81f19947eec588424c7e62a777b4512d814acf43ba44bdb4","source":{"kind":"arxiv","id":"1702.06081","version":3},"attestation_state":"computed","paper":{"title":"Learning Non-Discriminatory Predictors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Blake Woodworth, Mesrob I. Ohannessian, Nathan Srebro, Suriya Gunasekar","submitted_at":"2017-02-20T17:52:14Z","abstract_excerpt":"We consider learning a predictor which is non-discriminatory with respect to a \"protected attribute\" according to the notion of \"equalized odds\" proposed by Hardt et al. [2016]. We study the problem of learning such a non-discriminatory predictor from a finite training set, both statistically and computationally. We show that a post-hoc correction approach, as suggested by Hardt et al, can be highly suboptimal, present a nearly-optimal statistical procedure, argue that the associated computational problem is intractable, and suggest a second moment relaxation of the non-discrimination definiti"},"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":"1702.06081","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T17:52:14Z","cross_cats_sorted":[],"title_canon_sha256":"73e173e34b63c9c4ed15dee082c0ddb98fc84e266a62e75fbc72822d988a9629","abstract_canon_sha256":"c555878178b5547eea6f4859a501c5934207d61a6bc2a33fec1e80623fd52bee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.331958Z","signature_b64":"WM6i3y6RJpFzHyRRtGiKZMQLd6OY6euDcLJafHkyuN5VMV1UhdDV3t7L7R9XcvGEvsmtcPp+kuTjhGHJLowEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7503df4b276e57a81f19947eec588424c7e62a777b4512d814acf43ba44bdb4","last_reissued_at":"2026-05-18T00:31:31.331340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.331340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Non-Discriminatory Predictors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Blake Woodworth, Mesrob I. Ohannessian, Nathan Srebro, Suriya Gunasekar","submitted_at":"2017-02-20T17:52:14Z","abstract_excerpt":"We consider learning a predictor which is non-discriminatory with respect to a \"protected attribute\" according to the notion of \"equalized odds\" proposed by Hardt et al. [2016]. We study the problem of learning such a non-discriminatory predictor from a finite training set, both statistically and computationally. We show that a post-hoc correction approach, as suggested by Hardt et al, can be highly suboptimal, present a nearly-optimal statistical procedure, argue that the associated computational problem is intractable, and suggest a second moment relaxation of the non-discrimination definiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06081","kind":"arxiv","version":3},"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":"1702.06081","created_at":"2026-05-18T00:31:31.331428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06081v3","created_at":"2026-05-18T00:31:31.331428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06081","created_at":"2026-05-18T00:31:31.331428+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5ID35FSO3SX","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5ID35FSO3SXVAPR","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5ID35FS","created_at":"2026-05-18T12:31:46.661854+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/U5ID35FSO3SXVAPRTFD65RMIIJ","json":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ.json","graph_json":"https://pith.science/api/pith-number/U5ID35FSO3SXVAPRTFD65RMIIJ/graph.json","events_json":"https://pith.science/api/pith-number/U5ID35FSO3SXVAPRTFD65RMIIJ/events.json","paper":"https://pith.science/paper/U5ID35FS"},"agent_actions":{"view_html":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ","download_json":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ.json","view_paper":"https://pith.science/paper/U5ID35FS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06081&json=true","fetch_graph":"https://pith.science/api/pith-number/U5ID35FSO3SXVAPRTFD65RMIIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U5ID35FSO3SXVAPRTFD65RMIIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ/action/storage_attestation","attest_author":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ/action/author_attestation","sign_citation":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ/action/citation_signature","submit_replication":"https://pith.science/pith/U5ID35FSO3SXVAPRTFD65RMIIJ/action/replication_record"}},"created_at":"2026-05-18T00:31:31.331428+00:00","updated_at":"2026-05-18T00:31:31.331428+00:00"}