{"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/scalable-metric-learning-via-weighted","title":"Scalable Metric Learning via Weighted Approximate Rank Component Analysis","arxiv_id":"1603.00370","date":"2016-03-01","proceeding":null,"authors":["Cijo Jose","Francois Fleuret"],"abstract":"We are interested in the large-scale learning of Mahalanobis distances, with\na particular focus on person re-identification.\n  We propose a metric learning formulation called Weighted Approximate Rank\nComponent Analysis (WARCA). WARCA optimizes the precision at top ranks by\ncombining the WARP loss with a regularizer that favors orthonormal linear\nmappings, and avoids rank-deficient embeddings. Using this new regularizer\nallows us to adapt the large-scale WSABIE procedure and to leverage the Adam\nstochastic optimization algorithm, which results in an algorithm that scales\ngracefully to very large data-sets. Also, we derive a kernelized version which\nallows to take advantage of state-of-the-art features for re-identification\nwhen data-set size permits kernel computation.\n  Benchmarks on recent and standard re-identification data-sets show that our\nmethod beats existing state-of-the-art techniques both in term of accuracy and\nspeed. We also provide experimental analysis to shade lights on the properties\nof the regularizer we use, and how it improves performance.","url_abs":"http://arxiv.org/abs/1603.00370v2","url_pdf":"http://arxiv.org/pdf/1603.00370v2.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":[],"tasks":[{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"person-re-identification","task_name":"Person Re-Identification"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/person-re-identification-on-market-1501","task":"Person Re-Identification","dataset":"Market-1501","model":"WARCA","rank_in_archive_order":122,"of":135,"metrics":{"Rank-1":"45.16"},"uses_additional_data":false}],"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"44d10f0d5a41c87b9cf8803ba8900a9acd485a24687c16051b68534cff9369ee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}