{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KLLC5U2VT3IBCZFWMXTZRQLOTM","short_pith_number":"pith:KLLC5U2V","schema_version":"1.0","canonical_sha256":"52d62ed3559ed01164b665e798c16e9b182f110b74c88a9dcfdd209b6e1e413f","source":{"kind":"arxiv","id":"1503.02828","version":2},"attestation_state":"computed","paper":{"title":"Scalable Nuclear-norm Minimization by Subspace Pursuit Proximal Riemannian Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Dong Xu, Junbin Gao, Mingkui Tan, Qinfeng Shi, Shijie Xiao","submitted_at":"2015-03-10T09:42:17Z","abstract_excerpt":"Nuclear-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the unknown rank of variables or large-rank singular value decompositions (SVDs). To address this, we propose a proximal Riemannian gradient (PRG) scheme which can efficiently solve trace-norm regularized problems defined on real-algebraic variety $\\mMLr$ of real matrices of rank at most $r$. Based on PRG, we further present a simple and novel subspace pursuit (SP) paradigm for gene"},"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":"1503.02828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-10T09:42:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"13db1d40970028635614ef4f6323fdddf0d6f2f88a10d286cb11563b9eef9365","abstract_canon_sha256":"875465eaf7eebe2614dc498ceaeadf5701112fc215d92c4043bf38eb3ffc1868"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:51.190795Z","signature_b64":"fmhgfC5cjkXJ9CDICsFT301y2Dc3x3rymOffrqwJq6bb+UUmFfpq29LXCtFmlRRAar+x/nLqNoTFvqmmG5A8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d62ed3559ed01164b665e798c16e9b182f110b74c88a9dcfdd209b6e1e413f","last_reissued_at":"2026-05-18T02:21:51.190130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:51.190130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Nuclear-norm Minimization by Subspace Pursuit Proximal Riemannian Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Dong Xu, Junbin Gao, Mingkui Tan, Qinfeng Shi, Shijie Xiao","submitted_at":"2015-03-10T09:42:17Z","abstract_excerpt":"Nuclear-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the unknown rank of variables or large-rank singular value decompositions (SVDs). To address this, we propose a proximal Riemannian gradient (PRG) scheme which can efficiently solve trace-norm regularized problems defined on real-algebraic variety $\\mMLr$ of real matrices of rank at most $r$. Based on PRG, we further present a simple and novel subspace pursuit (SP) paradigm for gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02828","kind":"arxiv","version":2},"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":"1503.02828","created_at":"2026-05-18T02:21:51.190236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02828v2","created_at":"2026-05-18T02:21:51.190236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02828","created_at":"2026-05-18T02:21:51.190236+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLLC5U2VT3IB","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLLC5U2VT3IBCZFW","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLLC5U2V","created_at":"2026-05-18T12:29:29.992203+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/KLLC5U2VT3IBCZFWMXTZRQLOTM","json":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM.json","graph_json":"https://pith.science/api/pith-number/KLLC5U2VT3IBCZFWMXTZRQLOTM/graph.json","events_json":"https://pith.science/api/pith-number/KLLC5U2VT3IBCZFWMXTZRQLOTM/events.json","paper":"https://pith.science/paper/KLLC5U2V"},"agent_actions":{"view_html":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM","download_json":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM.json","view_paper":"https://pith.science/paper/KLLC5U2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02828&json=true","fetch_graph":"https://pith.science/api/pith-number/KLLC5U2VT3IBCZFWMXTZRQLOTM/graph.json","fetch_events":"https://pith.science/api/pith-number/KLLC5U2VT3IBCZFWMXTZRQLOTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/action/storage_attestation","attest_author":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/action/author_attestation","sign_citation":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/action/citation_signature","submit_replication":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/action/replication_record"}},"created_at":"2026-05-18T02:21:51.190236+00:00","updated_at":"2026-05-18T02:21:51.190236+00:00"}