{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NET5SU5INFKCLJXV34W7TIAQSQ","short_pith_number":"pith:NET5SU5I","schema_version":"1.0","canonical_sha256":"6927d953a8695425a6f5df2df9a0109403114d70bff4c5e5a99b2678d008cf5f","source":{"kind":"arxiv","id":"1512.00984","version":1},"attestation_state":"computed","paper":{"title":"Fast Low-Rank Matrix Learning with Nonconvex Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"James T. Kwok, Quanming Yao, Wenliang Zhong","submitted_at":"2015-12-03T08:32:17Z","abstract_excerpt":"Low-rank modeling has a lot of important applications in machine learning, computer vision and social network analysis. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better recovery performance. However, the resultant optimization problem is much more challenging. A very recent state-of-the-art is based on the proximal gradient algorithm. However, it requires an expensive full SVD in each proximal step. In this paper, we show that for many commonly-used nonconvex low-rank regularizers, a cutoff can be derived"},"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":"1512.00984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-12-03T08:32:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8307243da24bdc5aacd6960afb17cbaf77a0483bdaff8dfa6d25f174c5752d0b","abstract_canon_sha256":"3e80cdb4603aca6fc2183f937cf2515db435178fcef7a2db29ef2fa9a2774214"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:02.574089Z","signature_b64":"EheWrxxlmwAnSN3KnWLIxILR4OZGwM8coSbKteWO2VRwDyjZwzunoYRC3paYxkBVCcKz61yF1oOd0PyQBH5SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6927d953a8695425a6f5df2df9a0109403114d70bff4c5e5a99b2678d008cf5f","last_reissued_at":"2026-05-18T01:16:02.573415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:02.573415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Low-Rank Matrix Learning with Nonconvex Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"James T. Kwok, Quanming Yao, Wenliang Zhong","submitted_at":"2015-12-03T08:32:17Z","abstract_excerpt":"Low-rank modeling has a lot of important applications in machine learning, computer vision and social network analysis. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better recovery performance. However, the resultant optimization problem is much more challenging. A very recent state-of-the-art is based on the proximal gradient algorithm. However, it requires an expensive full SVD in each proximal step. In this paper, we show that for many commonly-used nonconvex low-rank regularizers, a cutoff can be derived"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00984","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":"1512.00984","created_at":"2026-05-18T01:16:02.573521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.00984v1","created_at":"2026-05-18T01:16:02.573521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00984","created_at":"2026-05-18T01:16:02.573521+00:00"},{"alias_kind":"pith_short_12","alias_value":"NET5SU5INFKC","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NET5SU5INFKCLJXV","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NET5SU5I","created_at":"2026-05-18T12:29:32.376354+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/NET5SU5INFKCLJXV34W7TIAQSQ","json":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ.json","graph_json":"https://pith.science/api/pith-number/NET5SU5INFKCLJXV34W7TIAQSQ/graph.json","events_json":"https://pith.science/api/pith-number/NET5SU5INFKCLJXV34W7TIAQSQ/events.json","paper":"https://pith.science/paper/NET5SU5I"},"agent_actions":{"view_html":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ","download_json":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ.json","view_paper":"https://pith.science/paper/NET5SU5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.00984&json=true","fetch_graph":"https://pith.science/api/pith-number/NET5SU5INFKCLJXV34W7TIAQSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NET5SU5INFKCLJXV34W7TIAQSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/action/storage_attestation","attest_author":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/action/author_attestation","sign_citation":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/action/citation_signature","submit_replication":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/action/replication_record"}},"created_at":"2026-05-18T01:16:02.573521+00:00","updated_at":"2026-05-18T01:16:02.573521+00:00"}