{"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/no-fuss-distance-metric-learning-using","title":"No Fuss Distance Metric Learning using Proxies","arxiv_id":"1703.07464","date":"2017-03-21","proceeding":"ICCV 2017 10","authors":["Yair Movshovitz-Attias","Alexander Toshev","Thomas K. Leung","Sergey Ioffe","Saurabh Singh"],"abstract":"We address the problem of distance metric learning (DML), defined as learning\na distance consistent with a notion of semantic similarity. Traditionally, for\nthis problem supervision is expressed in the form of sets of points that follow\nan ordinal relationship -- an anchor point $x$ is similar to a set of positive\npoints $Y$, and dissimilar to a set of negative points $Z$, and a loss defined\nover these distances is minimized. While the specifics of the optimization\ndiffer, in this work we collectively call this type of supervision Triplets and\nall methods that follow this pattern Triplet-Based methods. These methods are\nchallenging to optimize. A main issue is the need for finding informative\ntriplets, which is usually achieved by a variety of tricks such as increasing\nthe batch size, hard or semi-hard triplet mining, etc. Even with these tricks,\nthe convergence rate of such methods is slow. In this paper we propose to\noptimize the triplet loss on a different space of triplets, consisting of an\nanchor data point and similar and dissimilar proxy points which are learned as\nwell. These proxies approximate the original data points, so that a triplet\nloss over the proxies is a tight upper bound of the original loss. This\nproxy-based loss is empirically better behaved. As a result, the proxy-loss\nimproves on state-of-art results for three standard zero-shot learning\ndatasets, by up to 15% points, while converging three times as fast as other\ntriplet-based losses.","url_abs":"http://arxiv.org/abs/1703.07464v3","url_pdf":"http://arxiv.org/pdf/1703.07464v3.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":"no-fuss-distance-metric-learning-using","repo_url":"https://github.com/QuocThangNguyen/deep-metric-learning-tsinghua-dogs","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"no-fuss-distance-metric-learning-using","repo_url":"https://github.com/dichotomies/proxy-nca","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"semantic-similarity","task_name":"Semantic Similarity"},{"task_slug":"semantic-textual-similarity","task_name":"Semantic Textual Similarity"},{"task_slug":null,"task_name":"Triplet"},{"task_slug":"zero-shot-learning","task_name":"Zero-Shot Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.07464","atlas_url":"https://app.syntology.ai/?focus=1703.07464","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":"1703.07464"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.07464\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.07464"},"call":"get_concepts_for_paper(arxiv_id=\"1703.07464\")"}],"by_repo":[{"repo":"QuocThangNguyen/deep-metric-learning-tsinghua-dogs","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1503.03832","1909.05235"],"harvested_for_calls":[{"arxiv_id":"1503.03832","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1503.03832"},"call":"get_harvested_code_for_paper(arxiv_id=\"1503.03832\")"},{"arxiv_id":"1909.05235","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.05235"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.05235\")"}]},{"repo":"dichotomies/proxy-nca","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1502.03167"],"harvested_for_calls":[{"arxiv_id":"1502.03167","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.03167"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.03167\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"4ec7ac532f8eb0bbba9f9576a0619553fcfa1fc91730dc2504bcb776a8bb7caa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}