{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GPFGM6ZUQIQ3YRNEOOIYGXO5BH","short_pith_number":"pith:GPFGM6ZU","schema_version":"1.0","canonical_sha256":"33ca667b348221bc45a47391835ddd09c8cc39397cb6d5e432e55b30894972bf","source":{"kind":"arxiv","id":"1612.03441","version":1},"attestation_state":"computed","paper":{"title":"Lock-Free Optimization for Non-Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Gong-Duo Zhang, Shen-Yi Zhao, Wu-Jun Li","submitted_at":"2016-12-11T17:26:43Z","abstract_excerpt":"Stochastic gradient descent~(SGD) and its variants have attracted much attention in machine learning due to their efficiency and effectiveness for optimization. To handle large-scale problems, researchers have recently proposed several lock-free strategy based parallel SGD~(LF-PSGD) methods for multi-core systems. However, existing works have only proved the convergence of these LF-PSGD methods for convex problems. To the best of our knowledge, no work has proved the convergence of the LF-PSGD methods for non-convex problems. In this paper, we provide the theoretical proof about the convergenc"},"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":"1612.03441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-11T17:26:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3e94216cc64e977fc0aaaecdd71688a7c72ef9b14b8b83ea27ba1d6773cb67f0","abstract_canon_sha256":"6f7dd97217e9ad474cde3ae434f90a919750fdccb2ad2a1f468cdd6718e5c06e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:52.384180Z","signature_b64":"JLYqKKqmWSOrTwaDS+SUxodWhf2X5uZrGzeNbBuEV8m1J7B0NzJ6qwEC2Lg4Rwh9hAqGa4EhRjCRLxZ+kceYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ca667b348221bc45a47391835ddd09c8cc39397cb6d5e432e55b30894972bf","last_reissued_at":"2026-05-18T00:54:52.383725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:52.383725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lock-Free Optimization for Non-Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Gong-Duo Zhang, Shen-Yi Zhao, Wu-Jun Li","submitted_at":"2016-12-11T17:26:43Z","abstract_excerpt":"Stochastic gradient descent~(SGD) and its variants have attracted much attention in machine learning due to their efficiency and effectiveness for optimization. To handle large-scale problems, researchers have recently proposed several lock-free strategy based parallel SGD~(LF-PSGD) methods for multi-core systems. However, existing works have only proved the convergence of these LF-PSGD methods for convex problems. To the best of our knowledge, no work has proved the convergence of the LF-PSGD methods for non-convex problems. In this paper, we provide the theoretical proof about the convergenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03441","kind":"arxiv","version":1},"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":"1612.03441","created_at":"2026-05-18T00:54:52.383791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.03441v1","created_at":"2026-05-18T00:54:52.383791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03441","created_at":"2026-05-18T00:54:52.383791+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPFGM6ZUQIQ3","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPFGM6ZUQIQ3YRNE","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPFGM6ZU","created_at":"2026-05-18T12:30:19.053100+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/GPFGM6ZUQIQ3YRNEOOIYGXO5BH","json":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH.json","graph_json":"https://pith.science/api/pith-number/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/graph.json","events_json":"https://pith.science/api/pith-number/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/events.json","paper":"https://pith.science/paper/GPFGM6ZU"},"agent_actions":{"view_html":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH","download_json":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH.json","view_paper":"https://pith.science/paper/GPFGM6ZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.03441&json=true","fetch_graph":"https://pith.science/api/pith-number/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/graph.json","fetch_events":"https://pith.science/api/pith-number/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/action/storage_attestation","attest_author":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/action/author_attestation","sign_citation":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/action/citation_signature","submit_replication":"https://pith.science/pith/GPFGM6ZUQIQ3YRNEOOIYGXO5BH/action/replication_record"}},"created_at":"2026-05-18T00:54:52.383791+00:00","updated_at":"2026-05-18T00:54:52.383791+00:00"}