{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LEHAOCAPFFJID5YSHWWD2AHDIW","short_pith_number":"pith:LEHAOCAP","schema_version":"1.0","canonical_sha256":"590e07080f295281f7123dac3d00e34594cd6fa6e6917e6b29926335e67aa546","source":{"kind":"arxiv","id":"1503.03712","version":2},"attestation_state":"computed","paper":{"title":"On Graduated Optimization for Stochastic Non-Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Kfir Y. Levy, Shai Shalev-Shwartz","submitted_at":"2015-03-12T13:39:28Z","abstract_excerpt":"The graduated optimization approach, also known as the continuation method, is a popular heuristic to solving non-convex problems that has received renewed interest over the last decade. Despite its popularity, very little is known in terms of theoretical convergence analysis. In this paper we describe a new first-order algorithm based on graduated optimiza- tion and analyze its performance. We characterize a parameterized family of non- convex functions for which this algorithm provably converges to a global optimum. In particular, we prove that the algorithm converges to an {\\epsilon}-approx"},"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":"1503.03712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T13:39:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"aeaa7d142e6cf04a71b1dd27152d86bbc74d133e69f8d4cc9ad8d24d8230b0e1","abstract_canon_sha256":"dad28531d51a17a7f42ba9782af2144d86c18032f22f4bb72412eec8cd91e247"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:18.234873Z","signature_b64":"gfB+wTIwmOUv8FNWNMQ2W5bUWesDK2aFACjetPGK47Re/UuXpgR+hC/1jqeAt9P0sd4PsIFVLIay8hw0aTe6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590e07080f295281f7123dac3d00e34594cd6fa6e6917e6b29926335e67aa546","last_reissued_at":"2026-05-18T01:36:18.234178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:18.234178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Graduated Optimization for Stochastic Non-Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Kfir Y. Levy, Shai Shalev-Shwartz","submitted_at":"2015-03-12T13:39:28Z","abstract_excerpt":"The graduated optimization approach, also known as the continuation method, is a popular heuristic to solving non-convex problems that has received renewed interest over the last decade. Despite its popularity, very little is known in terms of theoretical convergence analysis. In this paper we describe a new first-order algorithm based on graduated optimiza- tion and analyze its performance. We characterize a parameterized family of non- convex functions for which this algorithm provably converges to a global optimum. In particular, we prove that the algorithm converges to an {\\epsilon}-approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03712","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":"1503.03712","created_at":"2026-05-18T01:36:18.234264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03712v2","created_at":"2026-05-18T01:36:18.234264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03712","created_at":"2026-05-18T01:36:18.234264+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEHAOCAPFFJI","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEHAOCAPFFJID5YS","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEHAOCAP","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":92,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW","json":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW.json","graph_json":"https://pith.science/api/pith-number/LEHAOCAPFFJID5YSHWWD2AHDIW/graph.json","events_json":"https://pith.science/api/pith-number/LEHAOCAPFFJID5YSHWWD2AHDIW/events.json","paper":"https://pith.science/paper/LEHAOCAP"},"agent_actions":{"view_html":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW","download_json":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW.json","view_paper":"https://pith.science/paper/LEHAOCAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03712&json=true","fetch_graph":"https://pith.science/api/pith-number/LEHAOCAPFFJID5YSHWWD2AHDIW/graph.json","fetch_events":"https://pith.science/api/pith-number/LEHAOCAPFFJID5YSHWWD2AHDIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/action/storage_attestation","attest_author":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/action/author_attestation","sign_citation":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/action/citation_signature","submit_replication":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/action/replication_record"}},"created_at":"2026-05-18T01:36:18.234264+00:00","updated_at":"2026-05-18T01:36:18.234264+00:00"}