{"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/deep-collective-matrix-factorization-for","title":"Deep Collective Matrix Factorization for Augmented Multi-View Learning","arxiv_id":"1811.11427","date":"2018-11-28","proceeding":null,"authors":["Ragunathan Mariappan","Vaibhav Rajan"],"abstract":"Learning by integrating multiple heterogeneous data sources is a common\nrequirement in many tasks. Collective Matrix Factorization (CMF) is a technique\nto learn shared latent representations from arbitrary collections of matrices.\nIt can be used to simultaneously complete one or more matrices, for predicting\nthe unknown entries. Classical CMF methods assume linearity in the interaction\nof latent factors which can be restrictive and fails to capture complex\nnon-linear interactions. In this paper, we develop the first deep-learning\nbased method, called dCMF, for unsupervised learning of multiple shared\nrepresentations, that can model such non-linear interactions, from an arbitrary\ncollection of matrices. We address optimization challenges that arise due to\ndependencies between shared representations through Multi-Task Bayesian\nOptimization and design an acquisition function adapted for collective learning\nof hyperparameters. Our experiments show that dCMF significantly outperforms\nprevious CMF algorithms in integrating heterogeneous data for predictive\nmodeling. Further, on two tasks - recommendation and prediction of gene-disease\nassociation - dCMF outperforms state-of-the-art matrix completion algorithms\nthat can utilize auxiliary sources of information.","url_abs":"http://arxiv.org/abs/1811.11427v2","url_pdf":"http://arxiv.org/pdf/1811.11427v2.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":"deep-collective-matrix-factorization-for","repo_url":"https://bitbucket.org/cdal/dcmf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"multi-view-learning","task_name":"MULTI-VIEW LEARNING"},{"task_slug":"matrix-completion","task_name":"Matrix Completion"}],"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":"bitbucket.org/cdal/dcmf","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":"028508d76bdb2be90ebfb2bcd95a834dee8ca99f5b8be54a1e9acdfdf0d57f74","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}