{"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/supervised-multiway-factorization","title":"Supervised multiway factorization","arxiv_id":"1609.03228","date":"2016-09-11","proceeding":null,"authors":["Eric F. Lock","Gen Li"],"abstract":"We describe a probabilistic PARAFAC/CANDECOMP (CP) factorization for multiway\n(i.e., tensor) data that incorporates auxiliary covariates, SupCP. SupCP\ngeneralizes the supervised singular value decomposition (SupSVD) for\nvector-valued observations, to allow for observations that have the form of a\nmatrix or higher-order array. Such data are increasingly encountered in\nbiomedical research and other fields. We describe a likelihood-based latent\nvariable representation of the CP factorization, in which the latent variables\nare informed by additional covariates. We give conditions for identifiability,\nand develop an EM algorithm for simultaneous estimation of all model\nparameters. SupCP can be used for dimension reduction, capturing latent\nstructures that are more accurate and interpretable due to covariate\nsupervision. Moreover, SupCP specifies a full probability distribution for a\nmultiway data observation with given covariate values, which can be used for\npredictive modeling. We conduct comprehensive simulations to evaluate the SupCP\nalgorithm. We apply it to a facial image database with facial descriptors\n(e.g., smiling / not smiling) as covariates, and to a study of amino acid\nfluorescence. Software is available at https://github.com/lockEF/SupCP .","url_abs":"http://arxiv.org/abs/1609.03228v2","url_pdf":"http://arxiv.org/pdf/1609.03228v2.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":"supervised-multiway-factorization","repo_url":"https://github.com/lockEF/SupCP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"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":"lockEF/SupCP","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":"e807445d179ec9ac5b2252f588dfc2484bab03895feef2faeffa541b6d7c38b5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}