{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VRYG2FKYQJNBW36MLDYHKUOMFC","short_pith_number":"pith:VRYG2FKY","schema_version":"1.0","canonical_sha256":"ac706d1558825a1b6fcc58f07551cc28924f1c70f9fd66661ea4fb15b58d1c7e","source":{"kind":"arxiv","id":"1911.10367","version":3},"attestation_state":"computed","paper":{"title":"A Sub-sampled Tensor Method for Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Aurelien Lucchi, Jonas Kohler","submitted_at":"2019-11-23T13:46:39Z","abstract_excerpt":"We present a stochastic optimization method that uses a fourth-order regularized model to find local minima of smooth and potentially non-convex objective functions with a finite-sum structure. This algorithm uses sub-sampled derivatives instead of exact quantities. The proposed approach is shown to find an $(\\epsilon_1,\\epsilon_2,\\epsilon_3)$-third-order critical point in at most $\\bigO\\left(\\max\\left(\\epsilon_1^{-4/3}, \\epsilon_2^{-2}, \\epsilon_3^{-4}\\right)\\right)$ iterations, thereby matching the rate of deterministic approaches. In order to prove this result, we derive a novel tensor conc"},"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":"1911.10367","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-23T13:46:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fdf34151eea2a77bebbd2c0a2eb5ddcdbd3ed2c7bc1d049222707687e7552de","abstract_canon_sha256":"7a623c103ce878af7f5706436b0a0e7d7064b8c8bee96e9b8a500f28a3852964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:01.417145Z","signature_b64":"5EvmTmV5mUN54KECpW0Zr6xlENDXbekp+RSZkktq3LEQT7uQVFvBpkrxWP3PPUa3k3hnNTpfdyu5wIFqrUH+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac706d1558825a1b6fcc58f07551cc28924f1c70f9fd66661ea4fb15b58d1c7e","last_reissued_at":"2026-07-05T06:31:01.416520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:01.416520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sub-sampled Tensor Method for Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Aurelien Lucchi, Jonas Kohler","submitted_at":"2019-11-23T13:46:39Z","abstract_excerpt":"We present a stochastic optimization method that uses a fourth-order regularized model to find local minima of smooth and potentially non-convex objective functions with a finite-sum structure. This algorithm uses sub-sampled derivatives instead of exact quantities. The proposed approach is shown to find an $(\\epsilon_1,\\epsilon_2,\\epsilon_3)$-third-order critical point in at most $\\bigO\\left(\\max\\left(\\epsilon_1^{-4/3}, \\epsilon_2^{-2}, \\epsilon_3^{-4}\\right)\\right)$ iterations, thereby matching the rate of deterministic approaches. In order to prove this result, we derive a novel tensor conc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.10367","kind":"arxiv","version":3},"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/1911.10367/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":"1911.10367","created_at":"2026-07-05T06:31:01.416590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.10367v3","created_at":"2026-07-05T06:31:01.416590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.10367","created_at":"2026-07-05T06:31:01.416590+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRYG2FKYQJNB","created_at":"2026-07-05T06:31:01.416590+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRYG2FKYQJNBW36M","created_at":"2026-07-05T06:31:01.416590+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRYG2FKY","created_at":"2026-07-05T06:31:01.416590+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/VRYG2FKYQJNBW36MLDYHKUOMFC","json":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC.json","graph_json":"https://pith.science/api/pith-number/VRYG2FKYQJNBW36MLDYHKUOMFC/graph.json","events_json":"https://pith.science/api/pith-number/VRYG2FKYQJNBW36MLDYHKUOMFC/events.json","paper":"https://pith.science/paper/VRYG2FKY"},"agent_actions":{"view_html":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC","download_json":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC.json","view_paper":"https://pith.science/paper/VRYG2FKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.10367&json=true","fetch_graph":"https://pith.science/api/pith-number/VRYG2FKYQJNBW36MLDYHKUOMFC/graph.json","fetch_events":"https://pith.science/api/pith-number/VRYG2FKYQJNBW36MLDYHKUOMFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC/action/storage_attestation","attest_author":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC/action/author_attestation","sign_citation":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC/action/citation_signature","submit_replication":"https://pith.science/pith/VRYG2FKYQJNBW36MLDYHKUOMFC/action/replication_record"}},"created_at":"2026-07-05T06:31:01.416590+00:00","updated_at":"2026-07-05T06:31:01.416590+00:00"}