{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JT35F3EFUA3WRG3WUUCS77PBGJ","short_pith_number":"pith:JT35F3EF","schema_version":"1.0","canonical_sha256":"4cf7d2ec85a037689b76a5052ffde1325b0039ca24acb519d6732413f02f8c99","source":{"kind":"arxiv","id":"2002.12266","version":3},"attestation_state":"computed","paper":{"title":"SPRING: A fast stochastic proximal alternating method for non-smooth non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carola-Bibiane Sch\\\"onlieb, Derek Driggs, Jingwei Liang, Junqi Tang, Mike Davies","submitted_at":"2020-02-27T17:11:32Z","abstract_excerpt":"We introduce SPRING, a novel stochastic proximal alternating linearized minimization algorithm for solving a class of non-smooth and non-convex optimization problems. Large-scale imaging problems are becoming increasingly prevalent due to advances in data acquisition and computational capabilities. Motivated by the success of stochastic optimization methods, we propose a stochastic variant of proximal alternating linearized minimization (PALM) algorithm \\cite{bolte2014proximal}. We provide global convergence guarantees, demonstrating that our proposed method with variance-reduced stochastic gr"},"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":"2002.12266","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-27T17:11:32Z","cross_cats_sorted":[],"title_canon_sha256":"893a39b40be3d2478c2e37cb9d9e5463626f81d325485156dc016148bf64be5c","abstract_canon_sha256":"29a7dc43b075450cfb0767e8a38fe8ababd553dfc3bfb775e18a011f35f74c3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:07:45.377976Z","signature_b64":"rg1nHPh/VcuN7PAL75dQVDHtQywVQh5dv9W1DOZWweF1576mydjTvXYRZJdf+5K+jxTk9SKHH7AoLNe3517dCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cf7d2ec85a037689b76a5052ffde1325b0039ca24acb519d6732413f02f8c99","last_reissued_at":"2026-07-05T02:07:45.377554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:07:45.377554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPRING: A fast stochastic proximal alternating method for non-smooth non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carola-Bibiane Sch\\\"onlieb, Derek Driggs, Jingwei Liang, Junqi Tang, Mike Davies","submitted_at":"2020-02-27T17:11:32Z","abstract_excerpt":"We introduce SPRING, a novel stochastic proximal alternating linearized minimization algorithm for solving a class of non-smooth and non-convex optimization problems. Large-scale imaging problems are becoming increasingly prevalent due to advances in data acquisition and computational capabilities. Motivated by the success of stochastic optimization methods, we propose a stochastic variant of proximal alternating linearized minimization (PALM) algorithm \\cite{bolte2014proximal}. We provide global convergence guarantees, demonstrating that our proposed method with variance-reduced stochastic gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.12266","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/2002.12266/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":"2002.12266","created_at":"2026-07-05T02:07:45.377612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.12266v3","created_at":"2026-07-05T02:07:45.377612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.12266","created_at":"2026-07-05T02:07:45.377612+00:00"},{"alias_kind":"pith_short_12","alias_value":"JT35F3EFUA3W","created_at":"2026-07-05T02:07:45.377612+00:00"},{"alias_kind":"pith_short_16","alias_value":"JT35F3EFUA3WRG3W","created_at":"2026-07-05T02:07:45.377612+00:00"},{"alias_kind":"pith_short_8","alias_value":"JT35F3EF","created_at":"2026-07-05T02:07:45.377612+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09941","citing_title":"Stochastic Optimization for Non-convex Inf-Projection Problems","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ","json":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ.json","graph_json":"https://pith.science/api/pith-number/JT35F3EFUA3WRG3WUUCS77PBGJ/graph.json","events_json":"https://pith.science/api/pith-number/JT35F3EFUA3WRG3WUUCS77PBGJ/events.json","paper":"https://pith.science/paper/JT35F3EF"},"agent_actions":{"view_html":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ","download_json":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ.json","view_paper":"https://pith.science/paper/JT35F3EF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.12266&json=true","fetch_graph":"https://pith.science/api/pith-number/JT35F3EFUA3WRG3WUUCS77PBGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JT35F3EFUA3WRG3WUUCS77PBGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ/action/storage_attestation","attest_author":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ/action/author_attestation","sign_citation":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ/action/citation_signature","submit_replication":"https://pith.science/pith/JT35F3EFUA3WRG3WUUCS77PBGJ/action/replication_record"}},"created_at":"2026-07-05T02:07:45.377612+00:00","updated_at":"2026-07-05T02:07:45.377612+00:00"}