{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NISBNLXZ426VETGFHSDZO5KVPB","short_pith_number":"pith:NISBNLXZ","schema_version":"1.0","canonical_sha256":"6a2416aef9e6bd524cc53c879775557840fabc6d673d81c2d88ecfbd1a47075e","source":{"kind":"arxiv","id":"1708.00146","version":3},"attestation_state":"computed","paper":{"title":"Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"James T.Kwok, Quanming Yao, Taifeng Wang, Tie-Yan Liu","submitted_at":"2017-08-01T03:21:55Z","abstract_excerpt":"Low-rank modeling has many important applications in computer vision and machine learning. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better empirical performance. However, the resulting optimization problem is much more challenging. Recent state-of-the-art requires an expensive full SVD in each iteration. In this paper, we show that for many commonly-used nonconvex low-rank regularizers, a cutoff can be derived to automatically threshold the singular values obtained from the proximal operator. This allows"},"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":"1708.00146","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-01T03:21:55Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"9e449f94622a1f929a7b6779c83f7b2f0fd144e28953070bb1689842fc17fac6","abstract_canon_sha256":"1f16de8411a5d6fe9d4b3eae694963497d5dbeef904abd9c07fa897c741ac69e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:04.087833Z","signature_b64":"u/rZxbwHBeXh+N9eVhM8seObWEK2W8OMPb/Nr2z4jyz5TnYZw44JK6JL5MGXsYJQMT1cx5CB4+fhZeoxcczcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a2416aef9e6bd524cc53c879775557840fabc6d673d81c2d88ecfbd1a47075e","last_reissued_at":"2026-05-18T00:10:04.087117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:04.087117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"James T.Kwok, Quanming Yao, Taifeng Wang, Tie-Yan Liu","submitted_at":"2017-08-01T03:21:55Z","abstract_excerpt":"Low-rank modeling has many important applications in computer vision and machine learning. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better empirical performance. However, the resulting optimization problem is much more challenging. Recent state-of-the-art requires an expensive full SVD in each iteration. In this paper, we show that for many commonly-used nonconvex low-rank regularizers, a cutoff can be derived to automatically threshold the singular values obtained from the proximal operator. This allows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00146","kind":"arxiv","version":3},"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":"1708.00146","created_at":"2026-05-18T00:10:04.087236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00146v3","created_at":"2026-05-18T00:10:04.087236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00146","created_at":"2026-05-18T00:10:04.087236+00:00"},{"alias_kind":"pith_short_12","alias_value":"NISBNLXZ426V","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NISBNLXZ426VETGF","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NISBNLXZ","created_at":"2026-05-18T12:31:31.346846+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/NISBNLXZ426VETGFHSDZO5KVPB","json":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB.json","graph_json":"https://pith.science/api/pith-number/NISBNLXZ426VETGFHSDZO5KVPB/graph.json","events_json":"https://pith.science/api/pith-number/NISBNLXZ426VETGFHSDZO5KVPB/events.json","paper":"https://pith.science/paper/NISBNLXZ"},"agent_actions":{"view_html":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB","download_json":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB.json","view_paper":"https://pith.science/paper/NISBNLXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00146&json=true","fetch_graph":"https://pith.science/api/pith-number/NISBNLXZ426VETGFHSDZO5KVPB/graph.json","fetch_events":"https://pith.science/api/pith-number/NISBNLXZ426VETGFHSDZO5KVPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB/action/storage_attestation","attest_author":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB/action/author_attestation","sign_citation":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB/action/citation_signature","submit_replication":"https://pith.science/pith/NISBNLXZ426VETGFHSDZO5KVPB/action/replication_record"}},"created_at":"2026-05-18T00:10:04.087236+00:00","updated_at":"2026-05-18T00:10:04.087236+00:00"}