{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2ZRZXK6HGZ7OJMMDXINDZUQ53Z","short_pith_number":"pith:2ZRZXK6H","schema_version":"1.0","canonical_sha256":"d6639babc7367ee4b183ba1a3cd21dde573044dd57d566c93113dc21b14a61dd","source":{"kind":"arxiv","id":"1902.00146","version":1},"attestation_state":"computed","paper":{"title":"Agnostic Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ananda Theertha Suresh, Gary Sivek, Mehryar Mohri","submitted_at":"2019-02-01T01:34:49Z","abstract_excerpt":"A key learning scenario in large-scale applications is that of federated learning, where a centralized model is trained based on data originating from a large number of clients. We argue that, with the existing training and inference, federated models can be biased towards different clients. Instead, we propose a new framework of agnostic federated learning, where the centralized model is optimized for any target distribution formed by a mixture of the client distributions. We further show that this framework naturally yields a notion of fairness. We present data-dependent Rademacher complexit"},"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":"1902.00146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-01T01:34:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6883be1ed61c80240a8e103b179d4bce6fac52cb7dbfd6bdd3b98437b696d9a9","abstract_canon_sha256":"7f945992eda1d37de39f8f8b2428aad83af12d117f816ac246d2ba37d3946bc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.194439Z","signature_b64":"K+kaUY4upD/I4RxYzVOkeaE0ZFqPzXGfIq4WKAdAmmrYRCkf/c8OBD36ov1NjWrbtUsNcxz7l1IhaELf6kd4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6639babc7367ee4b183ba1a3cd21dde573044dd57d566c93113dc21b14a61dd","last_reissued_at":"2026-05-17T23:54:58.193938Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.193938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Agnostic Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ananda Theertha Suresh, Gary Sivek, Mehryar Mohri","submitted_at":"2019-02-01T01:34:49Z","abstract_excerpt":"A key learning scenario in large-scale applications is that of federated learning, where a centralized model is trained based on data originating from a large number of clients. We argue that, with the existing training and inference, federated models can be biased towards different clients. Instead, we propose a new framework of agnostic federated learning, where the centralized model is optimized for any target distribution formed by a mixture of the client distributions. We further show that this framework naturally yields a notion of fairness. We present data-dependent Rademacher complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00146","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":""},"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":"1902.00146","created_at":"2026-05-17T23:54:58.194014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00146v1","created_at":"2026-05-17T23:54:58.194014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00146","created_at":"2026-05-17T23:54:58.194014+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZRZXK6HGZ7O","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZRZXK6HGZ7OJMMD","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZRZXK6H","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.07621","citing_title":"HASA: Subnet Allocation for Compute-Constrained Model-Heterogeneous Federated Learning","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z","json":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z.json","graph_json":"https://pith.science/api/pith-number/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/graph.json","events_json":"https://pith.science/api/pith-number/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/events.json","paper":"https://pith.science/paper/2ZRZXK6H"},"agent_actions":{"view_html":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z","download_json":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z.json","view_paper":"https://pith.science/paper/2ZRZXK6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00146&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/action/storage_attestation","attest_author":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/action/author_attestation","sign_citation":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/action/citation_signature","submit_replication":"https://pith.science/pith/2ZRZXK6HGZ7OJMMDXINDZUQ53Z/action/replication_record"}},"created_at":"2026-05-17T23:54:58.194014+00:00","updated_at":"2026-05-17T23:54:58.194014+00:00"}