{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GDDBHLDX6ZKFULZGFPSMLKBE6W","short_pith_number":"pith:GDDBHLDX","schema_version":"1.0","canonical_sha256":"30c613ac77f6545a2f262be4c5a824f5a367ddc4ac9dfe89f00b47f71811e785","source":{"kind":"arxiv","id":"2006.13591","version":2},"attestation_state":"computed","paper":{"title":"Randomized Block-Diagonal Preconditioning for Parallel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aurelien Lucchi, Celestine Mendler-D\\\"unner","submitted_at":"2020-06-24T10:12:36Z","abstract_excerpt":"We study preconditioned gradient-based optimization methods where the preconditioning matrix has block-diagonal form. Such a structural constraint comes with the advantage that the update computation is block-separable and can be parallelized across multiple independent tasks. Our main contribution is to demonstrate that the convergence of these methods can significantly be improved by a randomization technique which corresponds to repartitioning coordinates across tasks during the optimization procedure. We provide a theoretical analysis that accurately characterizes the expected convergence "},"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":"2006.13591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-24T10:12:36Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"600e37e5a92eaadc3c68c3ace48431781d1acf789c100b2cd170093fed2ed226","abstract_canon_sha256":"3f56776b4c6573a30d06fa596547e1e512f6430cb254cd9d55ccaba003a88ff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:57:17.665242Z","signature_b64":"SiZSkD2B6eZwicBQOq1OHgzOJUCk6dLoHbt+zv739PrrSZzHlnKsSfePArOsM8FsqXkNjYki7YqnXepxyA5hAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c613ac77f6545a2f262be4c5a824f5a367ddc4ac9dfe89f00b47f71811e785","last_reissued_at":"2026-07-05T01:57:17.664843Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:57:17.664843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Block-Diagonal Preconditioning for Parallel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aurelien Lucchi, Celestine Mendler-D\\\"unner","submitted_at":"2020-06-24T10:12:36Z","abstract_excerpt":"We study preconditioned gradient-based optimization methods where the preconditioning matrix has block-diagonal form. Such a structural constraint comes with the advantage that the update computation is block-separable and can be parallelized across multiple independent tasks. Our main contribution is to demonstrate that the convergence of these methods can significantly be improved by a randomization technique which corresponds to repartitioning coordinates across tasks during the optimization procedure. We provide a theoretical analysis that accurately characterizes the expected convergence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.13591","kind":"arxiv","version":2},"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/2006.13591/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":"2006.13591","created_at":"2026-07-05T01:57:17.664893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.13591v2","created_at":"2026-07-05T01:57:17.664893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13591","created_at":"2026-07-05T01:57:17.664893+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDDBHLDX6ZKF","created_at":"2026-07-05T01:57:17.664893+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDDBHLDX6ZKFULZG","created_at":"2026-07-05T01:57:17.664893+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDDBHLDX","created_at":"2026-07-05T01:57:17.664893+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/GDDBHLDX6ZKFULZGFPSMLKBE6W","json":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W.json","graph_json":"https://pith.science/api/pith-number/GDDBHLDX6ZKFULZGFPSMLKBE6W/graph.json","events_json":"https://pith.science/api/pith-number/GDDBHLDX6ZKFULZGFPSMLKBE6W/events.json","paper":"https://pith.science/paper/GDDBHLDX"},"agent_actions":{"view_html":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W","download_json":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W.json","view_paper":"https://pith.science/paper/GDDBHLDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.13591&json=true","fetch_graph":"https://pith.science/api/pith-number/GDDBHLDX6ZKFULZGFPSMLKBE6W/graph.json","fetch_events":"https://pith.science/api/pith-number/GDDBHLDX6ZKFULZGFPSMLKBE6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W/action/storage_attestation","attest_author":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W/action/author_attestation","sign_citation":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W/action/citation_signature","submit_replication":"https://pith.science/pith/GDDBHLDX6ZKFULZGFPSMLKBE6W/action/replication_record"}},"created_at":"2026-07-05T01:57:17.664893+00:00","updated_at":"2026-07-05T01:57:17.664893+00:00"}