{"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/bayesian-cp-factorization-of-incomplete","title":"Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination","arxiv_id":"1401.6497","date":"2014-01-25","proceeding":null,"authors":["Qibin Zhao","Liqing Zhang","Andrzej Cichocki"],"abstract":"CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful\ntechnique for tensor completion through explicitly capturing the multilinear\nlatent factors. The existing CP algorithms require the tensor rank to be\nmanually specified, however, the determination of tensor rank remains a\nchallenging problem especially for CP rank. In addition, existing approaches do\nnot take into account uncertainty information of latent factors, as well as\nmissing entries. To address these issues, we formulate CP factorization using a\nhierarchical probabilistic model and employ a fully Bayesian treatment by\nincorporating a sparsity-inducing prior over multiple latent factors and the\nappropriate hyperpriors over all hyperparameters, resulting in automatic rank\ndetermination. To learn the model, we develop an efficient deterministic\nBayesian inference algorithm, which scales linearly with data size. Our method\nis characterized as a tuning parameter-free approach, which can effectively\ninfer underlying multilinear factors with a low-rank constraint, while also\nproviding predictive distributions over missing entries. Extensive simulations\non synthetic data illustrate the intrinsic capability of our method to recover\nthe ground-truth of CP rank and prevent the overfitting problem, even when a\nlarge amount of entries are missing. Moreover, the results from real-world\napplications, including image inpainting and facial image synthesis,\ndemonstrate that our method outperforms state-of-the-art approaches for both\ntensor factorization and tensor completion in terms of predictive performance.","url_abs":"http://arxiv.org/abs/1401.6497v2","url_pdf":"http://arxiv.org/pdf/1401.6497v2.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":"bayesian-cp-factorization-of-incomplete","repo_url":"https://github.com/zhaoxile/reproducible-tensor-completion-state-of-the-art","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"image-inpainting","task_name":"Image Inpainting"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1401.6497","atlas_url":"https://app.syntology.ai/?focus=1401.6497","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":"1401.6497"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1401.6497\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1401.6497"},"call":"get_concepts_for_paper(arxiv_id=\"1401.6497\")"}],"by_repo":[{"repo":"zhaoxile/reproducible-tensor-completion-state-of-the-art","kind":"listed","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":"fe11871bb27746e286946092acda50489dcfcd1f64e2448f1ad5e56bb40e9790","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}