{"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/orthogonal-rank-one-matrix-pursuit-for-low","title":"Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion","arxiv_id":"1404.1377","date":"2014-04-04","proceeding":null,"authors":["Zheng Wang","Ming-Jun Lai","Zhaosong Lu","Wei Fan","Hasan Davulcu","Jieping Ye"],"abstract":"In this paper, we propose an efficient and scalable low rank matrix\ncompletion algorithm. The key idea is to extend orthogonal matching pursuit\nmethod from the vector case to the matrix case. We further propose an economic\nversion of our algorithm by introducing a novel weight updating rule to reduce\nthe time and storage complexity. Both versions are computationally inexpensive\nfor each matrix pursuit iteration, and find satisfactory results in a few\niterations. Another advantage of our proposed algorithm is that it has only one\ntunable parameter, which is the rank. It is easy to understand and to use by\nthe user. This becomes especially important in large-scale learning problems.\nIn addition, we rigorously show that both versions achieve a linear convergence\nrate, which is significantly better than the previous known results. We also\nempirically compare the proposed algorithms with several state-of-the-art\nmatrix completion algorithms on many real-world datasets, including the\nlarge-scale recommendation dataset Netflix as well as the MovieLens datasets.\nNumerical results show that our proposed algorithm is more efficient than\ncompeting algorithms while achieving similar or better prediction performance.","url_abs":"http://arxiv.org/abs/1404.1377v2","url_pdf":"http://arxiv.org/pdf/1404.1377v2.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":"orthogonal-rank-one-matrix-pursuit-for-low","repo_url":"https://github.com/jasonsun0310/MatrixCompletion.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"low-rank-matrix-completion","task_name":"Low-Rank Matrix Completion"},{"task_slug":"matrix-completion","task_name":"Matrix Completion"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1404.1377","atlas_url":"https://app.syntology.ai/?focus=1404.1377","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1404.1377"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1404.1377\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1404.1377"},"call":"get_concepts_for_paper(arxiv_id=\"1404.1377\")"}],"by_repo":[{"repo":"jasonsun0310/MatrixCompletion.jl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["0906.2027"],"harvested_for_calls":[{"arxiv_id":"0906.2027","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"0906.2027"},"call":"get_harvested_code_for_paper(arxiv_id=\"0906.2027\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"e303dbb32c60cc1e8ecc26f92bba07d9c2504a18db76f1eff372be39c0783dcf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}