{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:34GCKTOC5PSZCN7JWG7QF7JCWE","short_pith_number":"pith:34GCKTOC","schema_version":"1.0","canonical_sha256":"df0c254dc2ebe59137e9b1bf02fd22b11661dea99fa457dfe2d56c0fe15bc4c2","source":{"kind":"arxiv","id":"1709.05069","version":1},"attestation_state":"computed","paper":{"title":"Accelerating SGD for Distributed Deep-Learning Using Approximated Hessian Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunming Wang, S\\'ebastien M. R. Arnold","submitted_at":"2017-09-15T06:27:49Z","abstract_excerpt":"We introduce a novel method to compute a rank $m$ approximation of the inverse of the Hessian matrix in the distributed regime. By leveraging the differences in gradients and parameters of multiple Workers, we are able to efficiently implement a distributed approximation of the Newton-Raphson method. We also present preliminary results which underline advantages and challenges of second-order methods for large stochastic optimization problems. In particular, our work suggests that novel strategies for combining gradients provide further information on the loss surface."},"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":"1709.05069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-15T06:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"67511554c3891487a7725261dd485b1ab7f0b79605f531e9b42033c8106c0b59","abstract_canon_sha256":"426785544f46d56c60b7add1523d81e411b498689a4ac2c6cfbc69f56748a6ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.787287Z","signature_b64":"OPhkkt+rix3vPzdZhmQuDWJ/9hvItLShf66RKoZzMW9c6fKctUCVBFuKnBZJS24B5fk9gpsQKoiC2+2Sem/MBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df0c254dc2ebe59137e9b1bf02fd22b11661dea99fa457dfe2d56c0fe15bc4c2","last_reissued_at":"2026-05-18T00:35:06.786871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.786871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating SGD for Distributed Deep-Learning Using Approximated Hessian Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunming Wang, S\\'ebastien M. R. Arnold","submitted_at":"2017-09-15T06:27:49Z","abstract_excerpt":"We introduce a novel method to compute a rank $m$ approximation of the inverse of the Hessian matrix in the distributed regime. By leveraging the differences in gradients and parameters of multiple Workers, we are able to efficiently implement a distributed approximation of the Newton-Raphson method. We also present preliminary results which underline advantages and challenges of second-order methods for large stochastic optimization problems. In particular, our work suggests that novel strategies for combining gradients provide further information on the loss surface."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05069","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":"1709.05069","created_at":"2026-05-18T00:35:06.786938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05069v1","created_at":"2026-05-18T00:35:06.786938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05069","created_at":"2026-05-18T00:35:06.786938+00:00"},{"alias_kind":"pith_short_12","alias_value":"34GCKTOC5PSZ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"34GCKTOC5PSZCN7J","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"34GCKTOC","created_at":"2026-05-18T12:30:58.224056+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/34GCKTOC5PSZCN7JWG7QF7JCWE","json":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE.json","graph_json":"https://pith.science/api/pith-number/34GCKTOC5PSZCN7JWG7QF7JCWE/graph.json","events_json":"https://pith.science/api/pith-number/34GCKTOC5PSZCN7JWG7QF7JCWE/events.json","paper":"https://pith.science/paper/34GCKTOC"},"agent_actions":{"view_html":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE","download_json":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE.json","view_paper":"https://pith.science/paper/34GCKTOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05069&json=true","fetch_graph":"https://pith.science/api/pith-number/34GCKTOC5PSZCN7JWG7QF7JCWE/graph.json","fetch_events":"https://pith.science/api/pith-number/34GCKTOC5PSZCN7JWG7QF7JCWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE/action/storage_attestation","attest_author":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE/action/author_attestation","sign_citation":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE/action/citation_signature","submit_replication":"https://pith.science/pith/34GCKTOC5PSZCN7JWG7QF7JCWE/action/replication_record"}},"created_at":"2026-05-18T00:35:06.786938+00:00","updated_at":"2026-05-18T00:35:06.786938+00:00"}