{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EF7VOGQVJLOA4DG4372WVHOG4Z","short_pith_number":"pith:EF7VOGQV","schema_version":"1.0","canonical_sha256":"217f571a154adc0e0cdcdff56a9dc6e64591f239f7cbb2dd243c970b90505168","source":{"kind":"arxiv","id":"1107.4623","version":5},"attestation_state":"computed","paper":{"title":"A Unifying Analysis of Projected Gradient Descent for $\\ell_p$-constrained Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Bhiksha Raj, Sohail Bahmani","submitted_at":"2011-07-22T20:42:47Z","abstract_excerpt":"In this paper we study the performance of the Projected Gradient Descent(PGD) algorithm for $\\ell_{p}$-constrained least squares problems that arise in the framework of Compressed Sensing. Relying on the Restricted Isometry Property, we provide convergence guarantees for this algorithm for the entire range of $0\\leq p\\leq1$, that include and generalize the existing results for the Iterative Hard Thresholding algorithm and provide a new accuracy guarantee for the Iterative Soft Thresholding algorithm as special cases. Our results suggest that in this group of algorithms, as $p$ increases from z"},"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":"1107.4623","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-07-22T20:42:47Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"48eb619bcb159c486a9b959b26ffb4654bb065a24b337119765c22e2e63c6f82","abstract_canon_sha256":"9418a60f16a5cdfb66b09a72cd1a0a63b30920c5a2dddb7f0504a48ddda08ac4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:05.929976Z","signature_b64":"fnpCo/tIhoZSdZVsuTIZWq6nup6u4cKgZsuBERL0rO+Xjz9EmLimOKUUFdh9vxsJEZypSwl0szo2IDmTEZrxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217f571a154adc0e0cdcdff56a9dc6e64591f239f7cbb2dd243c970b90505168","last_reissued_at":"2026-05-18T03:32:05.929528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:05.929528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unifying Analysis of Projected Gradient Descent for $\\ell_p$-constrained Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Bhiksha Raj, Sohail Bahmani","submitted_at":"2011-07-22T20:42:47Z","abstract_excerpt":"In this paper we study the performance of the Projected Gradient Descent(PGD) algorithm for $\\ell_{p}$-constrained least squares problems that arise in the framework of Compressed Sensing. Relying on the Restricted Isometry Property, we provide convergence guarantees for this algorithm for the entire range of $0\\leq p\\leq1$, that include and generalize the existing results for the Iterative Hard Thresholding algorithm and provide a new accuracy guarantee for the Iterative Soft Thresholding algorithm as special cases. Our results suggest that in this group of algorithms, as $p$ increases from z"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4623","kind":"arxiv","version":5},"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":"1107.4623","created_at":"2026-05-18T03:32:05.929592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4623v5","created_at":"2026-05-18T03:32:05.929592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4623","created_at":"2026-05-18T03:32:05.929592+00:00"},{"alias_kind":"pith_short_12","alias_value":"EF7VOGQVJLOA","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EF7VOGQVJLOA4DG4","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EF7VOGQV","created_at":"2026-05-18T12:26:28.662955+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/EF7VOGQVJLOA4DG4372WVHOG4Z","json":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z.json","graph_json":"https://pith.science/api/pith-number/EF7VOGQVJLOA4DG4372WVHOG4Z/graph.json","events_json":"https://pith.science/api/pith-number/EF7VOGQVJLOA4DG4372WVHOG4Z/events.json","paper":"https://pith.science/paper/EF7VOGQV"},"agent_actions":{"view_html":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z","download_json":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z.json","view_paper":"https://pith.science/paper/EF7VOGQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4623&json=true","fetch_graph":"https://pith.science/api/pith-number/EF7VOGQVJLOA4DG4372WVHOG4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/EF7VOGQVJLOA4DG4372WVHOG4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/action/storage_attestation","attest_author":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/action/author_attestation","sign_citation":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/action/citation_signature","submit_replication":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/action/replication_record"}},"created_at":"2026-05-18T03:32:05.929592+00:00","updated_at":"2026-05-18T03:32:05.929592+00:00"}