{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:COZMNWC4E7XEA2VPN6K7G6MZZU","short_pith_number":"pith:COZMNWC4","canonical_record":{"source":{"id":"1709.01230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T04:06:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8541a3562431e788e5c6866698da615b2e645c211a3496c9915c07caffe27715","abstract_canon_sha256":"05c7f50dedf14fac9cc3db80e44845aafd1788b1c308461b1de74f69433567a8"},"schema_version":"1.0"},"canonical_sha256":"13b2c6d85c27ee406aaf6f95f37999cd009a1ef36c765f1ab4ffe8b0c807048e","source":{"kind":"arxiv","id":"1709.01230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01230","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01230v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01230","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"COZMNWC4E7XE","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"COZMNWC4E7XEA2VP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"COZMNWC4","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:COZMNWC4E7XEA2VPN6K7G6MZZU","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T04:06:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8541a3562431e788e5c6866698da615b2e645c211a3496c9915c07caffe27715","abstract_canon_sha256":"05c7f50dedf14fac9cc3db80e44845aafd1788b1c308461b1de74f69433567a8"},"schema_version":"1.0"},"canonical_sha256":"13b2c6d85c27ee406aaf6f95f37999cd009a1ef36c765f1ab4ffe8b0c807048e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.617129Z","signature_b64":"6rBuQG/lWaVPqjcKV74EGZuZShh2kLM/BreoAg1usRTaxIkZuEx2/gmKlpagOgNGVvAn1IX+ufpd8gNhZd7fAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b2c6d85c27ee406aaf6f95f37999cd009a1ef36c765f1ab4ffe8b0c807048e","last_reissued_at":"2026-05-18T00:36:00.616717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.616717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01230","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbNiBPTVFzI97sR4qchHB3Q1VJALuOYNKeNEIVvkoPprEcPXwJPsL3Swo9CbTzyKbR2hvVwWLG1zYquwIK3jBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:42:14.739939Z"},"content_sha256":"23d623f6dc3a7590c0de8065e99358cd4c6fdca0082378abf1282a2761eadb19","schema_version":"1.0","event_id":"sha256:23d623f6dc3a7590c0de8065e99358cd4c6fdca0082378abf1282a2761eadb19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:COZMNWC4E7XEA2VPN6K7G6MZZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Suboptimality of Proximal Gradient Descent for $\\ell^{0}$ Sparse Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jianchao Yang, Jiashi Feng, Nebojsa Jojic, Thomas S. Huang, Yingzhen Yang","submitted_at":"2017-09-05T04:06:19Z","abstract_excerpt":"We study the proximal gradient descent (PGD) method for $\\ell^{0}$ sparse approximation problem as well as its accelerated optimization with randomized algorithms in this paper. We first offer theoretical analysis of PGD showing the bounded gap between the sub-optimal solution by PGD and the globally optimal solution for the $\\ell^{0}$ sparse approximation problem under conditions weaker than Restricted Isometry Property widely used in compressive sensing literature. Moreover, we propose randomized algorithms to accelerate the optimization by PGD using randomized low rank matrix approximation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01230","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DChWsiFYPE1lo6qLmBt/mu4ayLg/BvrjVDDoKi5hVrIEfFFlQz5RVnFOQlfoIzxQ09XerNUQhfwXsH4jQbzQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:42:14.740626Z"},"content_sha256":"30a8765bd727e0ce1d9595f24bbe1d0a2d893553cd3915cb76461ef9d4ebb0c6","schema_version":"1.0","event_id":"sha256:30a8765bd727e0ce1d9595f24bbe1d0a2d893553cd3915cb76461ef9d4ebb0c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COZMNWC4E7XEA2VPN6K7G6MZZU/bundle.json","state_url":"https://pith.science/pith/COZMNWC4E7XEA2VPN6K7G6MZZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COZMNWC4E7XEA2VPN6K7G6MZZU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T09:42:14Z","links":{"resolver":"https://pith.science/pith/COZMNWC4E7XEA2VPN6K7G6MZZU","bundle":"https://pith.science/pith/COZMNWC4E7XEA2VPN6K7G6MZZU/bundle.json","state":"https://pith.science/pith/COZMNWC4E7XEA2VPN6K7G6MZZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COZMNWC4E7XEA2VPN6K7G6MZZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:COZMNWC4E7XEA2VPN6K7G6MZZU","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":"05c7f50dedf14fac9cc3db80e44845aafd1788b1c308461b1de74f69433567a8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T04:06:19Z","title_canon_sha256":"8541a3562431e788e5c6866698da615b2e645c211a3496c9915c07caffe27715"},"schema_version":"1.0","source":{"id":"1709.01230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01230","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01230v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01230","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"COZMNWC4E7XE","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"COZMNWC4E7XEA2VP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"COZMNWC4","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:30a8765bd727e0ce1d9595f24bbe1d0a2d893553cd3915cb76461ef9d4ebb0c6","target":"graph","created_at":"2026-05-18T00:36:00Z","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":"We study the proximal gradient descent (PGD) method for $\\ell^{0}$ sparse approximation problem as well as its accelerated optimization with randomized algorithms in this paper. We first offer theoretical analysis of PGD showing the bounded gap between the sub-optimal solution by PGD and the globally optimal solution for the $\\ell^{0}$ sparse approximation problem under conditions weaker than Restricted Isometry Property widely used in compressive sensing literature. Moreover, we propose randomized algorithms to accelerate the optimization by PGD using randomized low rank matrix approximation ","authors_text":"Jianchao Yang, Jiashi Feng, Nebojsa Jojic, Thomas S. Huang, Yingzhen Yang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T04:06:19Z","title":"On the Suboptimality of Proximal Gradient Descent for $\\ell^{0}$ Sparse Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01230","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:23d623f6dc3a7590c0de8065e99358cd4c6fdca0082378abf1282a2761eadb19","target":"record","created_at":"2026-05-18T00:36:00Z","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":"05c7f50dedf14fac9cc3db80e44845aafd1788b1c308461b1de74f69433567a8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T04:06:19Z","title_canon_sha256":"8541a3562431e788e5c6866698da615b2e645c211a3496c9915c07caffe27715"},"schema_version":"1.0","source":{"id":"1709.01230","kind":"arxiv","version":1}},"canonical_sha256":"13b2c6d85c27ee406aaf6f95f37999cd009a1ef36c765f1ab4ffe8b0c807048e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b2c6d85c27ee406aaf6f95f37999cd009a1ef36c765f1ab4ffe8b0c807048e","first_computed_at":"2026-05-18T00:36:00.616717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.616717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rBuQG/lWaVPqjcKV74EGZuZShh2kLM/BreoAg1usRTaxIkZuEx2/gmKlpagOgNGVvAn1IX+ufpd8gNhZd7fAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.617129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23d623f6dc3a7590c0de8065e99358cd4c6fdca0082378abf1282a2761eadb19","sha256:30a8765bd727e0ce1d9595f24bbe1d0a2d893553cd3915cb76461ef9d4ebb0c6"],"state_sha256":"4c38c44cba748a3401482bdc5a352cb9cb88b01613334af1aaf79e7f2eff55cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrcNng3BdiRIv1Pa3y/35PXT7fVfSG+Z1S/jz8aV0RAG+tw5glKfS/i0M/2GC3Xj9AqmQmqbisR0wVV94CX7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:42:14.743594Z","bundle_sha256":"c4cc975138c8196c815bf79a69b15122833e0ec2470d6262f4c1efd2cdb280a7"}}