{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:34I5IJD7XZGONDFKVJSDETDLXM","short_pith_number":"pith:34I5IJD7","schema_version":"1.0","canonical_sha256":"df11d4247fbe4ce68caaaa64324c6bbb1365b7ffde25d27e496de0d4a29e06e7","source":{"kind":"arxiv","id":"1510.02533","version":2},"attestation_state":"computed","paper":{"title":"New Optimisation Methods for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Defazio","submitted_at":"2015-10-09T00:34:12Z","abstract_excerpt":"A thesis submitted for the degree of Doctor of Philosophy of The Australian National University.\n  In this work we introduce several new optimisation methods for problems in machine learning. Our algorithms broadly fall into two categories: optimisation of finite sums and of graph structured objectives. The finite sum problem is simply the minimisation of objective functions that are naturally expressed as a summation over a large number of terms, where each term has a similar or identical weight. Such objectives most often appear in machine learning in the empirical risk minimisation framewor"},"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":"1510.02533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-09T00:34:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3a1807fa8f31e6007e1e33d15bec465c20371ecb43a419a057cbb590c2f88616","abstract_canon_sha256":"2f58447bf25e2a64cd6d1e0391b3ea5c63f8e85a5aef930e7874bf01cca6a44d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.444779Z","signature_b64":"JsOkyvKDwtbq1XJX+wE0iv6XB8cGJbK2B4nevGfiPNutV1OhJxm9FkTwULJeT51sqSVsqMCy1JyR2tQQ9LnBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df11d4247fbe4ce68caaaa64324c6bbb1365b7ffde25d27e496de0d4a29e06e7","last_reissued_at":"2026-05-18T01:18:52.444188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.444188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Optimisation Methods for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Defazio","submitted_at":"2015-10-09T00:34:12Z","abstract_excerpt":"A thesis submitted for the degree of Doctor of Philosophy of The Australian National University.\n  In this work we introduce several new optimisation methods for problems in machine learning. Our algorithms broadly fall into two categories: optimisation of finite sums and of graph structured objectives. The finite sum problem is simply the minimisation of objective functions that are naturally expressed as a summation over a large number of terms, where each term has a similar or identical weight. Such objectives most often appear in machine learning in the empirical risk minimisation framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02533","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":"1510.02533","created_at":"2026-05-18T01:18:52.444268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02533v2","created_at":"2026-05-18T01:18:52.444268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02533","created_at":"2026-05-18T01:18:52.444268+00:00"},{"alias_kind":"pith_short_12","alias_value":"34I5IJD7XZGO","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"34I5IJD7XZGONDFK","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"34I5IJD7","created_at":"2026-05-18T12:29:02.477457+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/34I5IJD7XZGONDFKVJSDETDLXM","json":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM.json","graph_json":"https://pith.science/api/pith-number/34I5IJD7XZGONDFKVJSDETDLXM/graph.json","events_json":"https://pith.science/api/pith-number/34I5IJD7XZGONDFKVJSDETDLXM/events.json","paper":"https://pith.science/paper/34I5IJD7"},"agent_actions":{"view_html":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM","download_json":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM.json","view_paper":"https://pith.science/paper/34I5IJD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02533&json=true","fetch_graph":"https://pith.science/api/pith-number/34I5IJD7XZGONDFKVJSDETDLXM/graph.json","fetch_events":"https://pith.science/api/pith-number/34I5IJD7XZGONDFKVJSDETDLXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM/action/storage_attestation","attest_author":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM/action/author_attestation","sign_citation":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM/action/citation_signature","submit_replication":"https://pith.science/pith/34I5IJD7XZGONDFKVJSDETDLXM/action/replication_record"}},"created_at":"2026-05-18T01:18:52.444268+00:00","updated_at":"2026-05-18T01:18:52.444268+00:00"}