{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:A3LO2NRWZPTCT2ZQYPOOSCTLOX","short_pith_number":"pith:A3LO2NRW","schema_version":"1.0","canonical_sha256":"06d6ed3636cbe629eb30c3dce90a6b75e497e4e789a744bd30e00aa218ad44f7","source":{"kind":"arxiv","id":"2107.05598","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear Least Squares for Large-Scale Machine Learning using Stochastic Jacobian Estimates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Johannes J. Brust","submitted_at":"2021-07-12T17:29:08Z","abstract_excerpt":"For large nonlinear least squares loss functions in machine learning we exploit the property that the number of model parameters typically exceeds the data in one batch. This implies a low-rank structure in the Hessian of the loss, which enables effective means to compute search directions. Using this property, we develop two algorithms that estimate Jacobian matrices and perform well when compared to state-of-the-art methods."},"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":"2107.05598","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-12T17:29:08Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"b292e978243a4f56ebd76229f4690074feae13272b6a4c1dd6a6a84dc525198d","abstract_canon_sha256":"c2ec683782611941a3768ee0df61d7d2f9c714f8a1aa317a2d88f9c02b2ff604"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:04.234727Z","signature_b64":"6Vb67XOvdTn6e4c6lBwY1IymjadwEnIpAhk9jjNcSTP0YKA1BDy0gz3bvTlXD9Mqp55OXdE47bxBcSs1AyxUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06d6ed3636cbe629eb30c3dce90a6b75e497e4e789a744bd30e00aa218ad44f7","last_reissued_at":"2026-07-05T02:57:04.234361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:04.234361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear Least Squares for Large-Scale Machine Learning using Stochastic Jacobian Estimates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Johannes J. Brust","submitted_at":"2021-07-12T17:29:08Z","abstract_excerpt":"For large nonlinear least squares loss functions in machine learning we exploit the property that the number of model parameters typically exceeds the data in one batch. This implies a low-rank structure in the Hessian of the loss, which enables effective means to compute search directions. Using this property, we develop two algorithms that estimate Jacobian matrices and perform well when compared to state-of-the-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.05598","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.05598/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":"2107.05598","created_at":"2026-07-05T02:57:04.234416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.05598v1","created_at":"2026-07-05T02:57:04.234416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.05598","created_at":"2026-07-05T02:57:04.234416+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3LO2NRWZPTC","created_at":"2026-07-05T02:57:04.234416+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3LO2NRWZPTCT2ZQ","created_at":"2026-07-05T02:57:04.234416+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3LO2NRW","created_at":"2026-07-05T02:57:04.234416+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02887","citing_title":"A Nonmonotone Gradient-Based Algorithm for Symmetric Nonnegative Matrix Factorization and Graph Clustering","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX","json":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX.json","graph_json":"https://pith.science/api/pith-number/A3LO2NRWZPTCT2ZQYPOOSCTLOX/graph.json","events_json":"https://pith.science/api/pith-number/A3LO2NRWZPTCT2ZQYPOOSCTLOX/events.json","paper":"https://pith.science/paper/A3LO2NRW"},"agent_actions":{"view_html":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX","download_json":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX.json","view_paper":"https://pith.science/paper/A3LO2NRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.05598&json=true","fetch_graph":"https://pith.science/api/pith-number/A3LO2NRWZPTCT2ZQYPOOSCTLOX/graph.json","fetch_events":"https://pith.science/api/pith-number/A3LO2NRWZPTCT2ZQYPOOSCTLOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX/action/storage_attestation","attest_author":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX/action/author_attestation","sign_citation":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX/action/citation_signature","submit_replication":"https://pith.science/pith/A3LO2NRWZPTCT2ZQYPOOSCTLOX/action/replication_record"}},"created_at":"2026-07-05T02:57:04.234416+00:00","updated_at":"2026-07-05T02:57:04.234416+00:00"}