{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AFXGONJXZFM5NHWFGCGASOQUPG","short_pith_number":"pith:AFXGONJX","schema_version":"1.0","canonical_sha256":"016e673537c959d69ec5308c093a1479afa0525f52e898fee924f0c7a6b68a49","source":{"kind":"arxiv","id":"2012.06188","version":3},"attestation_state":"computed","paper":{"title":"Recent Theoretical Advances in Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Dmitry Kamzolov, Eduard Gorbunov, Innokentiy Shibaev, Marina Danilova, Pavel Dvurechensky, Sergey Guminov","submitted_at":"2020-12-11T08:28:51Z","abstract_excerpt":"Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical results on global performance guarantees of optimization algorithms for non-convex optimization. We start with classical arguments showing that general non-convex problems could not be solved efficiently in a reasonable time. Then we give a list of problems that can be solved efficiently to find the global minimizer by exploiting the structure of the problem as mu"},"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":"2012.06188","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-12-11T08:28:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"be641ce3d13d733209524962b6c3f720fb973b1002dc638f29fae7de79e50861","abstract_canon_sha256":"be731bf63ca45983133551e2c8733ea8b876b2b0cbcf2a5acc7a48092ac73223"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:07.944377Z","signature_b64":"shx890DbqWuEoS67cjWTbT7jFew1oyD0bcTDrX8NwHCW/+BzfGPQ282LxIWSX3by9i4g1njps/+TMsWD2+PcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"016e673537c959d69ec5308c093a1479afa0525f52e898fee924f0c7a6b68a49","last_reissued_at":"2026-07-05T03:35:07.943863Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:07.943863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recent Theoretical Advances in Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Dmitry Kamzolov, Eduard Gorbunov, Innokentiy Shibaev, Marina Danilova, Pavel Dvurechensky, Sergey Guminov","submitted_at":"2020-12-11T08:28:51Z","abstract_excerpt":"Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical results on global performance guarantees of optimization algorithms for non-convex optimization. We start with classical arguments showing that general non-convex problems could not be solved efficiently in a reasonable time. Then we give a list of problems that can be solved efficiently to find the global minimizer by exploiting the structure of the problem as mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06188","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/2012.06188/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":"2012.06188","created_at":"2026-07-05T03:35:07.943923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.06188v3","created_at":"2026-07-05T03:35:07.943923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06188","created_at":"2026-07-05T03:35:07.943923+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFXGONJXZFM5","created_at":"2026-07-05T03:35:07.943923+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFXGONJXZFM5NHWF","created_at":"2026-07-05T03:35:07.943923+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFXGONJX","created_at":"2026-07-05T03:35:07.943923+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20866","citing_title":"LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging","ref_index":141,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18174","citing_title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","ref_index":139,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08871","citing_title":"Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction","ref_index":137,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11810","citing_title":"GRACE: A Dynamic Coreset Selection Framework for Large Language Model Optimization","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07795","citing_title":"Scalable Distributed Stochastic Optimization via Bidirectional Compression: Beyond Pessimistic Limits","ref_index":60,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG","json":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG.json","graph_json":"https://pith.science/api/pith-number/AFXGONJXZFM5NHWFGCGASOQUPG/graph.json","events_json":"https://pith.science/api/pith-number/AFXGONJXZFM5NHWFGCGASOQUPG/events.json","paper":"https://pith.science/paper/AFXGONJX"},"agent_actions":{"view_html":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG","download_json":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG.json","view_paper":"https://pith.science/paper/AFXGONJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.06188&json=true","fetch_graph":"https://pith.science/api/pith-number/AFXGONJXZFM5NHWFGCGASOQUPG/graph.json","fetch_events":"https://pith.science/api/pith-number/AFXGONJXZFM5NHWFGCGASOQUPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG/action/storage_attestation","attest_author":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG/action/author_attestation","sign_citation":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG/action/citation_signature","submit_replication":"https://pith.science/pith/AFXGONJXZFM5NHWFGCGASOQUPG/action/replication_record"}},"created_at":"2026-07-05T03:35:07.943923+00:00","updated_at":"2026-07-05T03:35:07.943923+00:00"}