{"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/tensor-factorization-via-matrix-factorization","title":"Tensor Factorization via Matrix Factorization","arxiv_id":"1501.07320","date":"2015-01-29","proceeding":null,"authors":["Volodymyr Kuleshov","Arun Tejasvi Chaganty","Percy Liang"],"abstract":"Tensor factorization arises in many machine learning applications, such\nknowledge base modeling and parameter estimation in latent variable models.\nHowever, numerical methods for tensor factorization have not reached the level\nof maturity of matrix factorization methods. In this paper, we propose a new\nmethod for CP tensor factorization that uses random projections to reduce the\nproblem to simultaneous matrix diagonalization. Our method is conceptually\nsimple and also applies to non-orthogonal and asymmetric tensors of arbitrary\norder. We prove that a small number random projections essentially preserves\nthe spectral information in the tensor, allowing us to remove the dependence on\nthe eigengap that plagued earlier tensor-to-matrix reductions. Experimentally,\nour method outperforms existing tensor factorization methods on both simulated\ndata and two real datasets.","url_abs":"http://arxiv.org/abs/1501.07320v2","url_pdf":"http://arxiv.org/pdf/1501.07320v2.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":"tensor-factorization-via-matrix-factorization","repo_url":"https://worksheets.codalab.org/worksheets/0x56dc93bcd3a647b197ad6e4b9d56f336","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1501.07320","atlas_url":"https://app.syntology.ai/?focus=1501.07320","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":"1501.07320"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1501.07320\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1501.07320"},"call":"get_concepts_for_paper(arxiv_id=\"1501.07320\")"}],"by_repo":[{"repo":"worksheets.codalab.org/worksheets/0x56dc93bcd3a647b197ad6e4b9d56f336","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":"6674911c37eedee680e9e6de202d02104cd03adf24920d7d94984e0b44689813","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}