{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GV4IEIHHXGLVEO2TUAU4KA6P4K","short_pith_number":"pith:GV4IEIHH","schema_version":"1.0","canonical_sha256":"35788220e7b997523b53a029c503cfe2b93c657dd442b7dc56a2a753c4811b50","source":{"kind":"arxiv","id":"1407.0088","version":1},"attestation_state":"computed","paper":{"title":"Linear Convergence of Stochastic Iterative Greedy Algorithms with Sparse Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.NA","authors_text":"Deanna Needell, Nam Nguyen, Tina Woolf","submitted_at":"2014-07-01T01:15:02Z","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"},"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":"1407.0088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-01T01:15:02Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"3ae9f2d16430b9830ae783bef5b84fb6ceb3ccf09be242f09915d381a2530ec4","abstract_canon_sha256":"d465ee696264f132678b9f8394083fd762a618981855bbe675890eb7409732c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:35.254753Z","signature_b64":"Zh8pay/cBEg0d4ia0AyDMQWtWf/5Jj94h2uPPJXNnN4EBjdIs1DR9tOXNGTbc7vJqmnXbnUwTXeaGVodTCVuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35788220e7b997523b53a029c503cfe2b93c657dd442b7dc56a2a753c4811b50","last_reissued_at":"2026-05-18T02:48:35.254165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:35.254165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Convergence of Stochastic Iterative Greedy Algorithms with Sparse Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.NA","authors_text":"Deanna Needell, Nam Nguyen, Tina Woolf","submitted_at":"2014-07-01T01:15:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0088","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":"1407.0088","created_at":"2026-05-18T02:48:35.254252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0088v1","created_at":"2026-05-18T02:48:35.254252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0088","created_at":"2026-05-18T02:48:35.254252+00:00"},{"alias_kind":"pith_short_12","alias_value":"GV4IEIHHXGLV","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GV4IEIHHXGLVEO2T","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GV4IEIHH","created_at":"2026-05-18T12:28:30.664211+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/GV4IEIHHXGLVEO2TUAU4KA6P4K","json":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K.json","graph_json":"https://pith.science/api/pith-number/GV4IEIHHXGLVEO2TUAU4KA6P4K/graph.json","events_json":"https://pith.science/api/pith-number/GV4IEIHHXGLVEO2TUAU4KA6P4K/events.json","paper":"https://pith.science/paper/GV4IEIHH"},"agent_actions":{"view_html":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K","download_json":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K.json","view_paper":"https://pith.science/paper/GV4IEIHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0088&json=true","fetch_graph":"https://pith.science/api/pith-number/GV4IEIHHXGLVEO2TUAU4KA6P4K/graph.json","fetch_events":"https://pith.science/api/pith-number/GV4IEIHHXGLVEO2TUAU4KA6P4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K/action/storage_attestation","attest_author":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K/action/author_attestation","sign_citation":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K/action/citation_signature","submit_replication":"https://pith.science/pith/GV4IEIHHXGLVEO2TUAU4KA6P4K/action/replication_record"}},"created_at":"2026-05-18T02:48:35.254252+00:00","updated_at":"2026-05-18T02:48:35.254252+00:00"}