{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M6A33P7QYQ3S5L6XW362TOYCUH","short_pith_number":"pith:M6A33P7Q","schema_version":"1.0","canonical_sha256":"6781bdbff0c4372eafd7b6fda9bb02a1fafc1c7da9330552c2bbe20f8f0276b8","source":{"kind":"arxiv","id":"1602.03943","version":5},"attestation_state":"computed","paper":{"title":"Second-Order Stochastic Optimization for Machine Learning in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Brian Bullins, Elad Hazan, Naman Agarwal","submitted_at":"2016-02-12T01:38:05Z","abstract_excerpt":"First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored due to the high cost of computing the second-order information. In this paper we develop second-order stochastic methods for optimization problems in machine learning that match the per-iteration cost of gradient based methods, and in certain settings improve upon the overall running time over popular first-order methods. Furthermore, our algorithm has the de"},"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":"1602.03943","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-12T01:38:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6e12f70470b713e9ee3e0e587f9331ad92721bc78f46ba3b3aeb4b8cf2f05f33","abstract_canon_sha256":"42132f9eeeed0a621f399b48b1cf74a89e7df7e0e4eee5baf22639e84f9bae29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.696335Z","signature_b64":"Hj3oQPAJzyVJKXRN5WKpEsKj2BgBcM+DbhxCVDjNiim8UaJizrkPyZYgT4Ejy6yQZoJja7dEq4Y50Ig5/97IDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6781bdbff0c4372eafd7b6fda9bb02a1fafc1c7da9330552c2bbe20f8f0276b8","last_reissued_at":"2026-05-18T00:29:15.695724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.695724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Second-Order Stochastic Optimization for Machine Learning in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Brian Bullins, Elad Hazan, Naman Agarwal","submitted_at":"2016-02-12T01:38:05Z","abstract_excerpt":"First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored due to the high cost of computing the second-order information. In this paper we develop second-order stochastic methods for optimization problems in machine learning that match the per-iteration cost of gradient based methods, and in certain settings improve upon the overall running time over popular first-order methods. Furthermore, our algorithm has the de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03943","kind":"arxiv","version":5},"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":"1602.03943","created_at":"2026-05-18T00:29:15.695812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03943v5","created_at":"2026-05-18T00:29:15.695812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03943","created_at":"2026-05-18T00:29:15.695812+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6A33P7QYQ3S","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6A33P7QYQ3S5L6X","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6A33P7Q","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2408.00920","citing_title":"Towards Certified Unlearning for Deep Neural Networks","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH","json":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH.json","graph_json":"https://pith.science/api/pith-number/M6A33P7QYQ3S5L6XW362TOYCUH/graph.json","events_json":"https://pith.science/api/pith-number/M6A33P7QYQ3S5L6XW362TOYCUH/events.json","paper":"https://pith.science/paper/M6A33P7Q"},"agent_actions":{"view_html":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH","download_json":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH.json","view_paper":"https://pith.science/paper/M6A33P7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03943&json=true","fetch_graph":"https://pith.science/api/pith-number/M6A33P7QYQ3S5L6XW362TOYCUH/graph.json","fetch_events":"https://pith.science/api/pith-number/M6A33P7QYQ3S5L6XW362TOYCUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/action/storage_attestation","attest_author":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/action/author_attestation","sign_citation":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/action/citation_signature","submit_replication":"https://pith.science/pith/M6A33P7QYQ3S5L6XW362TOYCUH/action/replication_record"}},"created_at":"2026-05-18T00:29:15.695812+00:00","updated_at":"2026-05-18T00:29:15.695812+00:00"}