{"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/collaborative-metric-learning","title":"Collaborative Metric Learning","arxiv_id":null,"date":"2017-04-01","proceeding":"WWW 2017 4","authors":["Cheng-Kang Hsieh","Longqi Yang","Yin Cui","Tsung-Yi Lin","Serge Belongie","Deborah Estrin"],"abstract":"Metric learning algorithms produce distance metrics that capture the important relationships among data. In this work we study the connection between metric learning and collaborative filtering. We propose Collaborative Metric Learning (CML) which learns a joint metric space to encode not only users’ preferences but also the user-user and item-item similarity. The proposed algorithm outperforms state-of-the-art collaborative filtering algorithms on a wide range of recommendation tasks and uncovers the underlying spectrum of users’ fine-grained preferences. CML also achieves significant speedup for Top-K recommendation tasks using off-the-shelf, approximate nearest-neighbor search, with negligible accuracy reduction.","url_abs":"https://ylongqi.com/publication/www17b/","url_pdf":"https://ylongqi.com/paper/HsiehYCLBE17.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":"collaborative-metric-learning","repo_url":"https://github.com/changun/CollMetric","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"collaborative-metric-learning","repo_url":"https://github.com/statusrank/LibCML","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[{"method_slug":"cpe","method_name":"CPE"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/collaborative-filtering-on-million-song","task":"Recommendation Systems","dataset":"Million Song Dataset","model":"CML","rank_in_archive_order":7,"of":7,"metrics":{"Recall@100":"0.3022","Recall@50":"0.2460"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","task":"Recommendation Systems","dataset":"MovieLens 1M","model":"CML","rank_in_archive_order":21,"of":31,"metrics":{"HR@10":"0.7216","nDCG@10":"0.5413"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-20m","task":"Recommendation Systems","dataset":"MovieLens 20M","model":"CML","rank_in_archive_order":3,"of":18,"metrics":{"HR@10":"0.7764","Recall@100":"0.6022","Recall@50":"0.4665","nDCG@10":"0.5301"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-netflix","task":"Recommendation Systems","dataset":"Netflix","model":"CML","rank_in_archive_order":9,"of":10,"metrics":{"Recall@10":"0.4612","nDCG@10":"0.2948"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"changun/CollMetric","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"statusrank/LibCML","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":"e3d4f0aa3baefe4d30b0b7bcbc5873c77a61bc0d82794e55178ea0ef0abf4e7b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}