{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UN6SEYYLO2QDNE4OMHGGJSKKFJ","short_pith_number":"pith:UN6SEYYL","schema_version":"1.0","canonical_sha256":"a37d22630b76a036938e61cc64c94a2a7bc4bbc4afcc222904532fcd6f34f638","source":{"kind":"arxiv","id":"1709.08571","version":2},"attestation_state":"computed","paper":{"title":"On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Mingrui Liu, Tianbao Yang","submitted_at":"2017-09-25T16:19:37Z","abstract_excerpt":"The Hessian-vector product has been utilized to find a second-order stationary solution with strong complexity guarantee (e.g., almost linear time complexity in the problem's dimensionality). In this paper, we propose to further reduce the number of Hessian-vector products for faster non-convex optimization. Previous algorithms need to approximate the smallest eigen-value with a sufficient precision (e.g., $\\epsilon_2\\ll 1$) in order to achieve a sufficiently accurate second-order stationary solution (i.e., $\\lambda_{\\min}(\\nabla^2 f(\\x))\\geq -\\epsilon_2)$. In contrast, the proposed algorithms"},"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":"1709.08571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T16:19:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e78c428680f3e1fab1a048619e7e5b58cd605ad22bf90ccc76e75e291b11908c","abstract_canon_sha256":"acfe434070f0ba8bc5376f16dc894a432a93b3dce1c12e0209a5141e116f4045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:58.312833Z","signature_b64":"DphvmdXQR50cgb2RKmcMLsxle/6GHtz1SrRpp32bvgYEDwTg+PCT3ioA3qgyP/XENq5DUMbmjNL0a9DnXnrbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a37d22630b76a036938e61cc64c94a2a7bc4bbc4afcc222904532fcd6f34f638","last_reissued_at":"2026-05-18T00:33:58.312213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:58.312213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Mingrui Liu, Tianbao Yang","submitted_at":"2017-09-25T16:19:37Z","abstract_excerpt":"The Hessian-vector product has been utilized to find a second-order stationary solution with strong complexity guarantee (e.g., almost linear time complexity in the problem's dimensionality). In this paper, we propose to further reduce the number of Hessian-vector products for faster non-convex optimization. Previous algorithms need to approximate the smallest eigen-value with a sufficient precision (e.g., $\\epsilon_2\\ll 1$) in order to achieve a sufficiently accurate second-order stationary solution (i.e., $\\lambda_{\\min}(\\nabla^2 f(\\x))\\geq -\\epsilon_2)$. In contrast, the proposed algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08571","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":"1709.08571","created_at":"2026-05-18T00:33:58.312296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08571v2","created_at":"2026-05-18T00:33:58.312296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08571","created_at":"2026-05-18T00:33:58.312296+00:00"},{"alias_kind":"pith_short_12","alias_value":"UN6SEYYLO2QD","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UN6SEYYLO2QDNE4O","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UN6SEYYL","created_at":"2026-05-18T12:31:46.661854+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/UN6SEYYLO2QDNE4OMHGGJSKKFJ","json":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ.json","graph_json":"https://pith.science/api/pith-number/UN6SEYYLO2QDNE4OMHGGJSKKFJ/graph.json","events_json":"https://pith.science/api/pith-number/UN6SEYYLO2QDNE4OMHGGJSKKFJ/events.json","paper":"https://pith.science/paper/UN6SEYYL"},"agent_actions":{"view_html":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ","download_json":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ.json","view_paper":"https://pith.science/paper/UN6SEYYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08571&json=true","fetch_graph":"https://pith.science/api/pith-number/UN6SEYYLO2QDNE4OMHGGJSKKFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UN6SEYYLO2QDNE4OMHGGJSKKFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/action/storage_attestation","attest_author":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/action/author_attestation","sign_citation":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/action/citation_signature","submit_replication":"https://pith.science/pith/UN6SEYYLO2QDNE4OMHGGJSKKFJ/action/replication_record"}},"created_at":"2026-05-18T00:33:58.312296+00:00","updated_at":"2026-05-18T00:33:58.312296+00:00"}