{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EXYO3IG4BCOFJ6OBUQTBUU764U","short_pith_number":"pith:EXYO3IG4","canonical_record":{"source":{"id":"1508.02810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-12T04:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"23efcfaed23af7010f6c7766bff84dd3f87f22b6404a02238d97d5fef2bc5d95","abstract_canon_sha256":"952b2893b4756f934b52fe68b88129f8d70cb69cf2497a22d1477f4e52be04f5"},"schema_version":"1.0"},"canonical_sha256":"25f0eda0dc089c54f9c1a4261a53fee500cae58385f791be38b0ca5d3f57bc44","source":{"kind":"arxiv","id":"1508.02810","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02810","created_at":"2026-05-18T01:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02810v2","created_at":"2026-05-18T01:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02810","created_at":"2026-05-18T01:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"EXYO3IG4BCOF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EXYO3IG4BCOFJ6OB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EXYO3IG4","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EXYO3IG4BCOFJ6OBUQTBUU764U","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-12T04:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"23efcfaed23af7010f6c7766bff84dd3f87f22b6404a02238d97d5fef2bc5d95","abstract_canon_sha256":"952b2893b4756f934b52fe68b88129f8d70cb69cf2497a22d1477f4e52be04f5"},"schema_version":"1.0"},"canonical_sha256":"25f0eda0dc089c54f9c1a4261a53fee500cae58385f791be38b0ca5d3f57bc44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:26.215771Z","signature_b64":"cjfJMGm4B6lcGp2nTrJ8EKIt9sfl+Ph9adbOjh3yaguDL8h4cGkMb/3WaMwU6EAuJz0LbNPTWCCB9zMC8MojCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25f0eda0dc089c54f9c1a4261a53fee500cae58385f791be38b0ca5d3f57bc44","last_reissued_at":"2026-05-18T01:25:26.215106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:26.215106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02810","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sywY/FVwqnB3U5FLgkDaiCnOjofJX2Gqv1zHxhPIn5JZch8IYrUhxjHTgEtQNHsd/lJGHeQrSBKbBmI+3T92AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:20:52.112680Z"},"content_sha256":"bfc3dbde96b6fcc4564001fcd9c17f59de110ccd2399b00212e9b0b9419dc3be","schema_version":"1.0","event_id":"sha256:bfc3dbde96b6fcc4564001fcd9c17f59de110ccd2399b00212e9b0b9419dc3be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EXYO3IG4BCOFJ6OBUQTBUU764U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence rates of sub-sampled Newton methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Andrea Montanari, Murat A. Erdogdu","submitted_at":"2015-08-12T04:52:58Z","abstract_excerpt":"We consider the problem of minimizing a sum of $n$ functions over a convex parameter set $\\mathcal{C} \\subset \\mathbb{R}^p$ where $n\\gg p\\gg 1$. In this regime, algorithms which utilize sub-sampling techniques are known to be effective. In this paper, we use sub-sampling techniques together with low-rank approximation to design a new randomized batch algorithm which possesses comparable convergence rate to Newton's method, yet has much smaller per-iteration cost. The proposed algorithm is robust in terms of starting point and step size, and enjoys a composite convergence rate, namely, quadrati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02810","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtdqx+uKASDAAUx+a7/u3k0PRiv1eMdlr8Ok1I++BXAXsSWteO/CRt4VIanHP+XDucVkw3Ib3XxDYBakxpgKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:20:52.113024Z"},"content_sha256":"12538f776c437672ef9647a0c380ee5b82f06e9a45e993ed0a98420fca075693","schema_version":"1.0","event_id":"sha256:12538f776c437672ef9647a0c380ee5b82f06e9a45e993ed0a98420fca075693"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXYO3IG4BCOFJ6OBUQTBUU764U/bundle.json","state_url":"https://pith.science/pith/EXYO3IG4BCOFJ6OBUQTBUU764U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXYO3IG4BCOFJ6OBUQTBUU764U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T10:20:52Z","links":{"resolver":"https://pith.science/pith/EXYO3IG4BCOFJ6OBUQTBUU764U","bundle":"https://pith.science/pith/EXYO3IG4BCOFJ6OBUQTBUU764U/bundle.json","state":"https://pith.science/pith/EXYO3IG4BCOFJ6OBUQTBUU764U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXYO3IG4BCOFJ6OBUQTBUU764U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EXYO3IG4BCOFJ6OBUQTBUU764U","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"952b2893b4756f934b52fe68b88129f8d70cb69cf2497a22d1477f4e52be04f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-12T04:52:58Z","title_canon_sha256":"23efcfaed23af7010f6c7766bff84dd3f87f22b6404a02238d97d5fef2bc5d95"},"schema_version":"1.0","source":{"id":"1508.02810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02810","created_at":"2026-05-18T01:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02810v2","created_at":"2026-05-18T01:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02810","created_at":"2026-05-18T01:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"EXYO3IG4BCOF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EXYO3IG4BCOFJ6OB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EXYO3IG4","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:12538f776c437672ef9647a0c380ee5b82f06e9a45e993ed0a98420fca075693","target":"graph","created_at":"2026-05-18T01:25:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the problem of minimizing a sum of $n$ functions over a convex parameter set $\\mathcal{C} \\subset \\mathbb{R}^p$ where $n\\gg p\\gg 1$. In this regime, algorithms which utilize sub-sampling techniques are known to be effective. In this paper, we use sub-sampling techniques together with low-rank approximation to design a new randomized batch algorithm which possesses comparable convergence rate to Newton's method, yet has much smaller per-iteration cost. The proposed algorithm is robust in terms of starting point and step size, and enjoys a composite convergence rate, namely, quadrati","authors_text":"Andrea Montanari, Murat A. Erdogdu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-12T04:52:58Z","title":"Convergence rates of sub-sampled Newton methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02810","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bfc3dbde96b6fcc4564001fcd9c17f59de110ccd2399b00212e9b0b9419dc3be","target":"record","created_at":"2026-05-18T01:25:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"952b2893b4756f934b52fe68b88129f8d70cb69cf2497a22d1477f4e52be04f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-12T04:52:58Z","title_canon_sha256":"23efcfaed23af7010f6c7766bff84dd3f87f22b6404a02238d97d5fef2bc5d95"},"schema_version":"1.0","source":{"id":"1508.02810","kind":"arxiv","version":2}},"canonical_sha256":"25f0eda0dc089c54f9c1a4261a53fee500cae58385f791be38b0ca5d3f57bc44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25f0eda0dc089c54f9c1a4261a53fee500cae58385f791be38b0ca5d3f57bc44","first_computed_at":"2026-05-18T01:25:26.215106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:26.215106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cjfJMGm4B6lcGp2nTrJ8EKIt9sfl+Ph9adbOjh3yaguDL8h4cGkMb/3WaMwU6EAuJz0LbNPTWCCB9zMC8MojCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:26.215771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfc3dbde96b6fcc4564001fcd9c17f59de110ccd2399b00212e9b0b9419dc3be","sha256:12538f776c437672ef9647a0c380ee5b82f06e9a45e993ed0a98420fca075693"],"state_sha256":"8cc38289f244267bbc60e39c7cc65710eeb76d3a7b0e53eb81ae47d2e941aa24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EdNhVwfIUmdrmFxTAGy96CIN2LFt5cPCX0deQy+m6z6VGzsT+u8sPgadIEIKl/sQThd6NecBkrw4GX9mXNpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T10:20:52.114681Z","bundle_sha256":"d13397c533ed29273d28ad6e2441ee842d565c7a7139e6608c07fd1c3e53fb42"}}