{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NM2FOENF4XSA6VXBD7LJHWR5WP","short_pith_number":"pith:NM2FOENF","schema_version":"1.0","canonical_sha256":"6b345711a5e5e40f56e11fd693da3db3dd332e3a92355284ac44afc5d5028cf2","source":{"kind":"arxiv","id":"1811.01564","version":2},"attestation_state":"computed","paper":{"title":"Parallel training of linear models without compromising convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Celestine D\\\"unner, Kornilios Kourtis, Nikolas Ioannou, Thomas Parnell","submitted_at":"2018-11-05T09:23:41Z","abstract_excerpt":"In this paper we analyze, evaluate, and improve the performance of training generalized linear models on modern CPUs. We start with a state-of-the-art asynchronous parallel training algorithm, identify system-level performance bottlenecks, and apply optimizations that improve data parallelism, cache line locality, and cache line prefetching of the algorithm. These modifications reduce the per-epoch run-time significantly, but take a toll on algorithm convergence in terms of the required number of epochs. To alleviate these shortcomings of our systems-optimized version, we propose a novel, dyna"},"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":"1811.01564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-05T09:23:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1e2c441dbdfe2f629e47b46f322e36647cacf85da3205a406c995d4585b281ee","abstract_canon_sha256":"906788c38a4217289ea2eb60418f7ec96fdd2f3e330bbf9ee366c742bdaf5a0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.906844Z","signature_b64":"X6ikCmuFokYolZnDt+eOx0oEXnGnHpj+RhvXnWuXdMO9C0JoFAYmsgMMAZm1LQCp+C5P+mKJStx++DB5BMgPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b345711a5e5e40f56e11fd693da3db3dd332e3a92355284ac44afc5d5028cf2","last_reissued_at":"2026-05-17T23:57:56.906162Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.906162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel training of linear models without compromising convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Celestine D\\\"unner, Kornilios Kourtis, Nikolas Ioannou, Thomas Parnell","submitted_at":"2018-11-05T09:23:41Z","abstract_excerpt":"In this paper we analyze, evaluate, and improve the performance of training generalized linear models on modern CPUs. We start with a state-of-the-art asynchronous parallel training algorithm, identify system-level performance bottlenecks, and apply optimizations that improve data parallelism, cache line locality, and cache line prefetching of the algorithm. These modifications reduce the per-epoch run-time significantly, but take a toll on algorithm convergence in terms of the required number of epochs. To alleviate these shortcomings of our systems-optimized version, we propose a novel, dyna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01564","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":""},"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":"1811.01564","created_at":"2026-05-17T23:57:56.906272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01564v2","created_at":"2026-05-17T23:57:56.906272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01564","created_at":"2026-05-17T23:57:56.906272+00:00"},{"alias_kind":"pith_short_12","alias_value":"NM2FOENF4XSA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NM2FOENF4XSA6VXB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NM2FOENF","created_at":"2026-05-18T12:32:40.477152+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/NM2FOENF4XSA6VXBD7LJHWR5WP","json":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP.json","graph_json":"https://pith.science/api/pith-number/NM2FOENF4XSA6VXBD7LJHWR5WP/graph.json","events_json":"https://pith.science/api/pith-number/NM2FOENF4XSA6VXBD7LJHWR5WP/events.json","paper":"https://pith.science/paper/NM2FOENF"},"agent_actions":{"view_html":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP","download_json":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP.json","view_paper":"https://pith.science/paper/NM2FOENF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01564&json=true","fetch_graph":"https://pith.science/api/pith-number/NM2FOENF4XSA6VXBD7LJHWR5WP/graph.json","fetch_events":"https://pith.science/api/pith-number/NM2FOENF4XSA6VXBD7LJHWR5WP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/action/storage_attestation","attest_author":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/action/author_attestation","sign_citation":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/action/citation_signature","submit_replication":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/action/replication_record"}},"created_at":"2026-05-17T23:57:56.906272+00:00","updated_at":"2026-05-17T23:57:56.906272+00:00"}