{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G4NPQNMYX5MVIMB5DSM44GCKNB","short_pith_number":"pith:G4NPQNMY","schema_version":"1.0","canonical_sha256":"371af83598bf5954303d1c99ce184a684d3c908ffe9e47591b0e1bb8771fc2dd","source":{"kind":"arxiv","id":"1711.08172","version":2},"attestation_state":"computed","paper":{"title":"Run-and-Inspect Method for Nonconvex Optimization and Global Optimality Bounds for R-Local Minimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Wotao Yin, Yifan Chen, Yuejiao Sun","submitted_at":"2017-11-22T08:15:03Z","abstract_excerpt":"Many optimization algorithms converge to stationary points. When the underlying problem is nonconvex, they may get trapped at local minimizers and occasionally stagnate near saddle points. We propose the Run-and-Inspect Method, which adds an \"inspect\" phase to existing algorithms that helps escape from non-global stationary points. The inspection samples a set of points in a radius $R$ around the current point. When a sample point yields a sufficient decrease in the objective, we move there and resume an existing algorithm. If no sufficient decrease is found, the current point is called an app"},"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":"1711.08172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-22T08:15:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"19b990c42249f8af83260a5acd331b3a3cb0c32921f9c517d1056961573a1ec9","abstract_canon_sha256":"2938c922874d5862d8278b77f62d0c3023d064dfe9deec97eec38b05b3229b4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:06.142778Z","signature_b64":"+fBOnqH/W35yLyJj5PLYE5t3/UCVlmVpnq2qYAM7Wl9JL63cHWV1ZuCs6jXZw1Dja5pzttzF6ZN9+82jVSwlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"371af83598bf5954303d1c99ce184a684d3c908ffe9e47591b0e1bb8771fc2dd","last_reissued_at":"2026-05-18T00:12:06.142104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:06.142104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Run-and-Inspect Method for Nonconvex Optimization and Global Optimality Bounds for R-Local Minimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Wotao Yin, Yifan Chen, Yuejiao Sun","submitted_at":"2017-11-22T08:15:03Z","abstract_excerpt":"Many optimization algorithms converge to stationary points. When the underlying problem is nonconvex, they may get trapped at local minimizers and occasionally stagnate near saddle points. We propose the Run-and-Inspect Method, which adds an \"inspect\" phase to existing algorithms that helps escape from non-global stationary points. The inspection samples a set of points in a radius $R$ around the current point. When a sample point yields a sufficient decrease in the objective, we move there and resume an existing algorithm. If no sufficient decrease is found, the current point is called an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08172","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":"1711.08172","created_at":"2026-05-18T00:12:06.142199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08172v2","created_at":"2026-05-18T00:12:06.142199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08172","created_at":"2026-05-18T00:12:06.142199+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4NPQNMYX5MV","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4NPQNMYX5MVIMB5","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4NPQNMY","created_at":"2026-05-18T12:31:15.632608+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/G4NPQNMYX5MVIMB5DSM44GCKNB","json":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB.json","graph_json":"https://pith.science/api/pith-number/G4NPQNMYX5MVIMB5DSM44GCKNB/graph.json","events_json":"https://pith.science/api/pith-number/G4NPQNMYX5MVIMB5DSM44GCKNB/events.json","paper":"https://pith.science/paper/G4NPQNMY"},"agent_actions":{"view_html":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB","download_json":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB.json","view_paper":"https://pith.science/paper/G4NPQNMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08172&json=true","fetch_graph":"https://pith.science/api/pith-number/G4NPQNMYX5MVIMB5DSM44GCKNB/graph.json","fetch_events":"https://pith.science/api/pith-number/G4NPQNMYX5MVIMB5DSM44GCKNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/action/storage_attestation","attest_author":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/action/author_attestation","sign_citation":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/action/citation_signature","submit_replication":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/action/replication_record"}},"created_at":"2026-05-18T00:12:06.142199+00:00","updated_at":"2026-05-18T00:12:06.142199+00:00"}