{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/fast-low-rank-matrix-learning-with-nonconvex","title":"Fast Low-Rank Matrix Learning with Nonconvex Regularization","arxiv_id":"1512.00984","date":"2015-12-03","proceeding":null,"authors":["Quanming Yao","James T. Kwok","Wenliang Zhong"],"abstract":"Low-rank modeling has a lot of important applications in machine learning,\ncomputer vision and social network analysis. While the matrix rank is often\napproximated by the convex nuclear norm, the use of nonconvex low-rank\nregularizers has demonstrated better recovery performance. However, the\nresultant optimization problem is much more challenging. A very recent\nstate-of-the-art is based on the proximal gradient algorithm. However, it\nrequires an expensive full SVD in each proximal step. In this paper, we show\nthat for many commonly-used nonconvex low-rank regularizers, a cutoff can be\nderived to automatically threshold the singular values obtained from the\nproximal operator. This allows the use of power method to approximate the SVD\nefficiently. Besides, the proximal operator can be reduced to that of a much\nsmaller matrix projected onto this leading subspace. Convergence, with a rate\nof O(1/T) where T is the number of iterations, can be guaranteed. Extensive\nexperiments are performed on matrix completion and robust principal component\nanalysis. The proposed method achieves significant speedup over the\nstate-of-the-art. Moreover, the matrix solution obtained is more accurate and\nhas a lower rank than that of the traditional nuclear norm regularizer.","url_abs":"http://arxiv.org/abs/1512.00984v1","url_pdf":"http://arxiv.org/pdf/1512.00984v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"fast-low-rank-matrix-learning-with-nonconvex","repo_url":"https://github.com/quanmingyao/FaNCL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"matrix-completion","task_name":"Matrix Completion"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"quanmingyao/FaNCL","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"da373f5cf7f1458d4111c4770adce6f9dd92f8e102c17dd8d25811116cdedf77","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}