{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6YLRPN5BFLXSPMZAQCB6OWT7BW","short_pith_number":"pith:6YLRPN5B","schema_version":"1.0","canonical_sha256":"f61717b7a12aef27b3208083e75a7f0d803514f956e896f734caf15194da6756","source":{"kind":"arxiv","id":"1810.01269","version":1},"attestation_state":"computed","paper":{"title":"A fast quasi-Newton-type method for large-scale stochastic optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Adrian Wills, Carl Jidling, Thomas Schon","submitted_at":"2018-09-29T20:59:41Z","abstract_excerpt":"During recent years there has been an increased interest in stochastic adaptations of limited memory quasi-Newton methods, which compared to pure gradient-based routines can improve the convergence by incorporating second order information. In this work we propose a direct least-squares approach conceptually similar to the limited memory quasi-Newton methods, but that computes the search direction in a slightly different way. This is achieved in a fast and numerically robust manner by maintaining a Cholesky factor of low dimension. This is combined with a stochastic line search relying upon fu"},"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":"1810.01269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-29T20:59:41Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f83a7ac0c3f052aba79038f01d511a9a813707a18bc0b03debbf3d067e6af4e3","abstract_canon_sha256":"751b4ad886cdaf99890756c75b1e6f128bd92ed39e87c5820ed8a3d0bdf7ceeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:18.360492Z","signature_b64":"IDV2Tea04FH5+URPkVLMr0sJd/iPVV8wt6hii5YDv3MNv1bRXK5hZMH+SmepA/VMZlnVtfrgtsyFn383j/1sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f61717b7a12aef27b3208083e75a7f0d803514f956e896f734caf15194da6756","last_reissued_at":"2026-05-18T00:04:18.359821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:18.359821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast quasi-Newton-type method for large-scale stochastic optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Adrian Wills, Carl Jidling, Thomas Schon","submitted_at":"2018-09-29T20:59:41Z","abstract_excerpt":"During recent years there has been an increased interest in stochastic adaptations of limited memory quasi-Newton methods, which compared to pure gradient-based routines can improve the convergence by incorporating second order information. In this work we propose a direct least-squares approach conceptually similar to the limited memory quasi-Newton methods, but that computes the search direction in a slightly different way. This is achieved in a fast and numerically robust manner by maintaining a Cholesky factor of low dimension. This is combined with a stochastic line search relying upon fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01269","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":"1810.01269","created_at":"2026-05-18T00:04:18.359913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01269v1","created_at":"2026-05-18T00:04:18.359913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01269","created_at":"2026-05-18T00:04:18.359913+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YLRPN5BFLXS","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YLRPN5BFLXSPMZA","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YLRPN5B","created_at":"2026-05-18T12:32:11.075285+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/6YLRPN5BFLXSPMZAQCB6OWT7BW","json":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW.json","graph_json":"https://pith.science/api/pith-number/6YLRPN5BFLXSPMZAQCB6OWT7BW/graph.json","events_json":"https://pith.science/api/pith-number/6YLRPN5BFLXSPMZAQCB6OWT7BW/events.json","paper":"https://pith.science/paper/6YLRPN5B"},"agent_actions":{"view_html":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW","download_json":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW.json","view_paper":"https://pith.science/paper/6YLRPN5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01269&json=true","fetch_graph":"https://pith.science/api/pith-number/6YLRPN5BFLXSPMZAQCB6OWT7BW/graph.json","fetch_events":"https://pith.science/api/pith-number/6YLRPN5BFLXSPMZAQCB6OWT7BW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW/action/storage_attestation","attest_author":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW/action/author_attestation","sign_citation":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW/action/citation_signature","submit_replication":"https://pith.science/pith/6YLRPN5BFLXSPMZAQCB6OWT7BW/action/replication_record"}},"created_at":"2026-05-18T00:04:18.359913+00:00","updated_at":"2026-05-18T00:04:18.359913+00:00"}