{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GV4IEIHHXGLVEO2TUAU4KA6P4K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d465ee696264f132678b9f8394083fd762a618981855bbe675890eb7409732c3","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-01T01:15:02Z","title_canon_sha256":"3ae9f2d16430b9830ae783bef5b84fb6ceb3ccf09be242f09915d381a2530ec4"},"schema_version":"1.0","source":{"id":"1407.0088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0088","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0088v1","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0088","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"GV4IEIHHXGLV","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GV4IEIHHXGLVEO2T","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GV4IEIHH","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:59408e0abe6d05caa19f1c51dbb0bdbbf15b604fe2a9bbc3dfe9faa2a9db9daf","target":"graph","created_at":"2026-05-18T02:48:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Motivated by recent work on stochastic gradient descent methods, we develop two stochastic variants of greedy algorithms for possibly non-convex optimization problems with sparsity constraints. We prove linear convergence in expectation to the solution within a specified tolerance. This generalized framework applies to problems such as sparse signal recovery in compressed sensing, low-rank matrix recovery, and covariance matrix estimation, giving methods with provable convergence guarantees that often outperform their deterministic counterparts. We also analyze the settings where gradients and","authors_text":"Deanna Needell, Nam Nguyen, Tina Woolf","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-01T01:15:02Z","title":"Linear Convergence of Stochastic Iterative Greedy Algorithms with Sparse Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0088","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:894732d5d91d3ac8b086b3773b598d5702a8f9422b69940ec5fbde58146dc9c8","target":"record","created_at":"2026-05-18T02:48:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d465ee696264f132678b9f8394083fd762a618981855bbe675890eb7409732c3","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-01T01:15:02Z","title_canon_sha256":"3ae9f2d16430b9830ae783bef5b84fb6ceb3ccf09be242f09915d381a2530ec4"},"schema_version":"1.0","source":{"id":"1407.0088","kind":"arxiv","version":1}},"canonical_sha256":"35788220e7b997523b53a029c503cfe2b93c657dd442b7dc56a2a753c4811b50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35788220e7b997523b53a029c503cfe2b93c657dd442b7dc56a2a753c4811b50","first_computed_at":"2026-05-18T02:48:35.254165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:35.254165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zh8pay/cBEg0d4ia0AyDMQWtWf/5Jj94h2uPPJXNnN4EBjdIs1DR9tOXNGTbc7vJqmnXbnUwTXeaGVodTCVuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:35.254753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:894732d5d91d3ac8b086b3773b598d5702a8f9422b69940ec5fbde58146dc9c8","sha256:59408e0abe6d05caa19f1c51dbb0bdbbf15b604fe2a9bbc3dfe9faa2a9db9daf"],"state_sha256":"5740836f4afe15e35912652afdc74667704cfe19eff498d3eaad1b24621cdd88"}