{"url":"/sota/image-retrieval-on-sop","task":{"name":"Image Retrieval","url":"/task/image-retrieval","note":null},"dataset":{"name":"SOP","url":"/dataset/stanford-online-products"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"**Image Retrieval** is a fundamental and long-standing computer vision task that involves finding images similar to a given query from a large database. It is often considered a form of fine-grained, instance-level classification. The task is integral to image recognition alongside [classification](/task/image-classification) and [cross-modal retrieval](/task/cross-modal-retrieva). By leveraging visual similarity and other criteria, image retrieval enables users to efficiently discover relevant images, making it a crucial tool in applications such as search and recommendation.\r\n\r\n<span class=\"description-source\">[Extending CLIP for Category-to-image Retrieval in E-commerce](https://arxiv.org/abs/2112.11294)</span>\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [DELF](https://github.com/tensorflow/models/tree/master/research/delf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["R@1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"R@1":null}},"counts":{"rows":14,"rows_with_code":13,"rows_with_paper_page":14,"rows_dated":14,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"Unicom+ViT-L@336px","metrics":{"R@1":"91.2"},"uses_additional_data":true,"paper_date":"2023-04-12","paper":"/paper/unicom-universal-and-compact-representation","paper_url":"https://arxiv.org/abs/2304.05884v1","paper_title":"Unicom: Universal and Compact Representation Learning for Image Retrieval","code":"https://github.com/OML-Team/open-metric-learning","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":3,"n_samples":6,"n_pointer_only_licence":6}},{"rank_in_archive_order":2,"model":"ROADMAP (DeiT-B)","metrics":{"R@1":"86.0"},"uses_additional_data":false,"paper_date":"2021-10-01","paper":"/paper/robust-and-decomposable-average-precision-for","paper_url":"https://arxiv.org/abs/2110.01445v3","paper_title":"Robust and Decomposable Average Precision for Image Retrieval","code":"https://github.com/elias-ramzi/roadmap","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"CGD (SG/GS)","metrics":{"R@1":"84.2"},"uses_additional_data":false,"paper_date":"2019-03-26","paper":"/paper/combination-of-multiple-global-descriptors","paper_url":"https://arxiv.org/abs/1903.10663v4","paper_title":"Combination of Multiple Global Descriptors for Image Retrieval","code":"https://github.com/naver/cgd","n_code_links":7,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"ROADMAP (ResNet-50)","metrics":{"R@1":"83.1"},"uses_additional_data":false,"paper_date":"2021-10-01","paper":"/paper/robust-and-decomposable-average-precision-for","paper_url":"https://arxiv.org/abs/2110.01445v3","paper_title":"Robust and Decomposable Average Precision for Image Retrieval","code":"https://github.com/elias-ramzi/roadmap","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"ProxyNCA++","metrics":{"R@1":"81.4"},"uses_additional_data":false,"paper_date":"2020-04-02","paper":"/paper/proxynca-revisiting-and-revitalizing-proxy","paper_url":"https://arxiv.org/abs/2004.01113v2","paper_title":"ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysis","code":"https://github.com/euwern/proxynca_pp","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"PNP Loss","metrics":{"R@1":"81.1"},"uses_additional_data":false,"paper_date":"2021-02-09","paper":"/paper/rethinking-ranking-based-loss-functions-only","paper_url":"https://arxiv.org/abs/2102.04640v4","paper_title":"Rethinking the Optimization of Average Precision: Only Penalizing Negative Instances before Positive Ones is Enough","code":"https://github.com/interestingzhuo/pnploss","n_code_links":2,"syntology":null},{"rank_in_archive_order":7,"model":"Cross-Batch Memory","metrics":{"R@1":"80.6"},"uses_additional_data":false,"paper_date":"2019-12-14","paper":"/paper/cross-batch-memory-for-embedding-learning","paper_url":"https://arxiv.org/abs/1912.06798v3","paper_title":"Cross-Batch Memory for Embedding Learning","code":"https://github.com/PaddlePaddle/PaddleClas/blob/develop/docs/zh_CN/training/metric_learning/xbm.md","n_code_links":5,"syntology":null},{"rank_in_archive_order":8,"model":"Smooth-AP","metrics":{"R@1":"80.1"},"uses_additional_data":false,"paper_date":"2020-07-23","paper":"/paper/smooth-ap-smoothing-the-path-towards-large","paper_url":"https://arxiv.org/abs/2007.12163v2","paper_title":"Smooth-AP: Smoothing the Path Towards Large-Scale Image Retrieval","code":"https://github.com/Andrew-Brown1/Smooth_AP","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"NormSoftmax2048 (ResNet-50)","metrics":{"R@1":"79.5"},"uses_additional_data":false,"paper_date":"2018-11-30","paper":"/paper/making-classification-competitive-for-deep","paper_url":"https://arxiv.org/abs/1811.12649v2","paper_title":"Classification is a Strong Baseline for Deep Metric Learning","code":"https://github.com/microsoft/computervision-recipes/blob/master/scenarios/similarity/02_state_of_the_art.ipynb","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"EPSHN512","metrics":{"R@1":"78.3"},"uses_additional_data":false,"paper_date":"2019-04-08","paper":"/paper/improved-embeddings-with-easy-positive","paper_url":"https://arxiv.org/abs/1904.04370v2","paper_title":"Improved Embeddings with Easy Positive Triplet Mining","code":"https://github.com/littleredxh/DREML","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":11,"model":"MS512","metrics":{"R@1":"78.2"},"uses_additional_data":false,"paper_date":"2019-04-14","paper":"/paper/multi-similarity-loss-with-general-pair","paper_url":"https://arxiv.org/abs/1904.06627v3","paper_title":"Multi-Similarity Loss with General Pair Weighting for Deep Metric Learning","code":"https://github.com/bnu-wangxun/Deep_Metric","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"ABE-8","metrics":{"R@1":"76.3"},"uses_additional_data":false,"paper_date":"2018-04-02","paper":"/paper/attention-based-ensemble-for-deep-metric","paper_url":"http://arxiv.org/abs/1804.00382v2","paper_title":"Attention-based Ensemble for Deep Metric Learning","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":13,"model":"A-BIER","metrics":{"R@1":"74.2"},"uses_additional_data":false,"paper_date":"2018-01-15","paper":"/paper/deep-metric-learning-with-bier-boosting","paper_url":"http://arxiv.org/abs/1801.04815v1","paper_title":"Deep Metric Learning with BIER: Boosting Independent Embeddings Robustly","code":"https://github.com/mop/bier","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"HDC","metrics":{"R@1":"69.5"},"uses_additional_data":false,"paper_date":"2016-11-17","paper":"/paper/hard-aware-deeply-cascaded-embedding","paper_url":"http://arxiv.org/abs/1611.05720v2","paper_title":"Hard-Aware Deeply Cascaded Embedding","code":"https://github.com/PkuRainBow/Hard-Aware-Deeply-Cascaded-Embedding_release","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":9,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":10,"n_unverified":20,"n_samples":30,"n_pointer_only_licence":7,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":14,"n_unverified":21,"n_samples":35,"n_pointer_only_licence":7,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}