{"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/faster-matrix-completion-using-randomized-svd","title":"Faster Matrix Completion Using Randomized SVD","arxiv_id":"1810.06860","date":"2018-10-16","proceeding":null,"authors":["Xu Feng","Wenjian Yu","Yaohang Li"],"abstract":"Matrix completion is a widely used technique for image inpainting and\npersonalized recommender system, etc. In this work, we focus on accelerating\nthe matrix completion using faster randomized singular value decomposition\n(rSVD). Firstly, two fast randomized algorithms (rSVD-PI and rSVD- BKI) are\nproposed for handling sparse matrix. They make use of an eigSVD procedure and\nseveral accelerating skills. Then, with the rSVD-BKI algorithm and a new\nsubspace recycling technique, we accelerate the singular value thresholding\n(SVT) method in [1] to realize faster matrix completion. Experiments show that\nthe proposed rSVD algorithms can be 6X faster than the basic rSVD algorithm [2]\nwhile keeping same accuracy. For image inpainting and movie-rating estimation\nproblems, the proposed accelerated SVT algorithm consumes 15X and 8X less CPU\ntime than the methods using svds and lansvd respectively, without loss of\naccuracy.","url_abs":"http://arxiv.org/abs/1810.06860v1","url_pdf":"http://arxiv.org/pdf/1810.06860v1.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":"faster-matrix-completion-using-randomized-svd","repo_url":"https://github.com/XuFengthucs/fSVT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":null,"task_name":"CPU"},{"task_slug":"image-inpainting","task_name":"Image Inpainting"},{"task_slug":"matrix-completion","task_name":"Matrix Completion"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"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":"XuFengthucs/fSVT","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":"64c0255d1c4fd80ceb9ff6d890ba32316b22041d69aa0c8c718bc6251ea71f2c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}