{"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/predicting-pairwise-relations-with-neural","title":"Predicting Pairwise Relations with Neural Similarity Encoders","arxiv_id":"1702.01824","date":"2017-02-06","proceeding":null,"authors":["Franziska Horn","Klaus-Robert Müller"],"abstract":"Matrix factorization is at the heart of many machine learning algorithms, for\nexample, dimensionality reduction (e.g. kernel PCA) or recommender systems\nrelying on collaborative filtering. Understanding a singular value\ndecomposition (SVD) of a matrix as a neural network optimization problem\nenables us to decompose large matrices efficiently while dealing naturally with\nmissing values in the given matrix. But most importantly, it allows us to learn\nthe connection between data points' feature vectors and the matrix containing\ninformation about their pairwise relations. In this paper we introduce a novel\nneural network architecture termed Similarity Encoder (SimEc), which is\ndesigned to simultaneously factorize a given target matrix while also learning\nthe mapping to project the data points' feature vectors into a similarity\npreserving embedding space. This makes it possible to, for example, easily\ncompute out-of-sample solutions for new data points. Additionally, we\ndemonstrate that SimEc can preserve non-metric similarities and even predict\nmultiple pairwise relations between data points at once.","url_abs":"http://arxiv.org/abs/1702.01824v2","url_pdf":"http://arxiv.org/pdf/1702.01824v2.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":"predicting-pairwise-relations-with-neural","repo_url":"https://github.com/cod3licious/simec","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"missing-values","task_name":"Missing Values"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"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":"cod3licious/simec","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":"01a6ca06e0faac89bb33069b8f76b3c121458ca1e7c3192ece2fdc0452ab3d77","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}