{"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/geometric-mean-metric-learning","title":"Geometric Mean Metric Learning","arxiv_id":"1607.05002","date":"2016-07-18","proceeding":null,"authors":["Pourya Habib Zadeh","Reshad Hosseini","Suvrit Sra"],"abstract":"We revisit the task of learning a Euclidean metric from data. We approach\nthis problem from first principles and formulate it as a surprisingly simple\noptimization problem. Indeed, our formulation even admits a closed form\nsolution. This solution possesses several very attractive properties: (i) an\ninnate geometric appeal through the Riemannian geometry of positive definite\nmatrices; (ii) ease of interpretability; and (iii) computational speed several\norders of magnitude faster than the widely used LMNN and ITML methods.\nFurthermore, on standard benchmark datasets, our closed-form solution\nconsistently attains higher classification accuracy.","url_abs":"http://arxiv.org/abs/1607.05002v1","url_pdf":"http://arxiv.org/pdf/1607.05002v1.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":"geometric-mean-metric-learning","repo_url":"https://github.com/PouriaZ/GMML","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"form","task_name":"Form"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"riemannian-optimization","task_name":"Riemannian optimization"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1607.05002","atlas_url":"https://app.syntology.ai/?focus=1607.05002","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":"1607.05002"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1607.05002\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1607.05002"},"call":"get_concepts_for_paper(arxiv_id=\"1607.05002\")"}],"by_repo":[{"repo":"PouriaZ/GMML","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":"cf482933af0298444a9b17619a36ae61005c652c0c2c941e0d0de487240e2475","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}