{"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":"/dataset/in-shop","name":"In-Shop","full_name":"In-shop Clothes Retrieval Benchmark","description_markdown":"In-shop Clothes Retrieval Benchmark evaluates the performance of in-shop Clothes Retrieval. This is a large subset of DeepFashion, containing large pose and scale variations. It also has large diversities, large quantities, and rich annotations, including:\r\n\r\n- 7,982 number of clothing items;\r\n- 52,712 number of in-shop clothes images, and ~200,000 cross-pose/scale pairs;\r\n\r\nEach image is annotated by bounding box, clothing type and pose type.","description_withheld":null,"homepage":"https://mmlab.ie.cuhk.edu.hk/projects/DeepFashion/InShopRetrieval.html","introduced_date":"2016-06-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/deepfashion-powering-robust-clothes","title":"DeepFashion: Powering Robust Clothes Recognition and Retrieval With Rich Annotations","first_author":"Ziwei Liu","url":null},"license":null,"modalities":[{"name":"Images","url":"/datasets/modality/images"}],"tasks":[{"name":"Image Retrieval","url":"/task/image-retrieval","datasets_with_task":"/datasets/task/image-retrieval"},{"name":"Metric Learning","url":"/task/metric-learning","datasets_with_task":"/datasets/task/metric-learning"}],"languages":[],"variants":["In-Shop"],"data_loaders":[],"num_papers_in_archive":154,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/metric-learning-on-in-shop-1","task":"Metric Learning","dataset_variant":"In-Shop","rows":15,"metrics":["R@1"],"first_row_in_archive_order":{"model":"Unicom+ViT-L@336px","paper":"/paper/unicom-universal-and-compact-representation","metrics":{"R@1":"96.7"},"code_links":[{"title":"OML-Team/open-metric-learning","url":"https://github.com/OML-Team/open-metric-learning"},{"title":"deepglint/unicom","url":"https://github.com/deepglint/unicom"},{"title":"RocketFlash/easy_metric_learning","url":"https://github.com/RocketFlash/easy_metric_learning/tree/master/tools"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/image-retrieval-on-in-shop","task":"Image Retrieval","dataset_variant":"In-Shop","rows":7,"metrics":["R@1"],"first_row_in_archive_order":{"model":"CGD (SG/GS)","paper":"/paper/combination-of-multiple-global-descriptors","metrics":{"R@1":"91.9"},"code_links":[{"title":"naver/cgd","url":"https://github.com/naver/cgd"},{"title":"leftthomas/CGD","url":"https://github.com/leftthomas/CGD"},{"title":"clovaai/embedding-expansion","url":"https://github.com/clovaai/embedding-expansion"},{"title":"flyingsheepbin/pet-biometrics","url":"https://github.com/flyingsheepbin/pet-biometrics"},{"title":"puneesh00/loop","url":"https://github.com/puneesh00/loop"},{"title":"PuchatekwSzortach/combination_of_multiple_global_descriptors_for_image_retrieval","url":"https://github.com/PuchatekwSzortach/combination_of_multiple_global_descriptors_for_image_retrieval"},{"title":"Samjoel3101/Self-Supervised-Learning-fastai2","url":"https://github.com/Samjoel3101/Self-Supervised-Learning-fastai2"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":18,"of":18,"counts":{"papers_with_a_benchmark_row":18,"with_a_code_link":13,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":18,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/learning-semantic-proxies-from-visual-prompts","slug":"learning-semantic-proxies-from-visual-prompts","title":"Learning Semantic Proxies from Visual Prompts for Parameter-Efficient Fine-Tuning in Deep Metric Learning","date":"2024-02-04","arxiv_id":"2402.02340","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":3,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["noahsark/parameterefficient-dml"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-semantic-proxies-from-visual-prompts#ran","syntology_url":"https://syntology.ai/paper/2402.02340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02340"}}}},{"paper":"/paper/center-contrastive-loss-for-metric-learning","slug":"center-contrastive-loss-for-metric-learning","title":"Center Contrastive Loss for Metric Learning","date":"2023-08-01","arxiv_id":"2308.00458","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/stir-siamese-transformer-for-image-retrieval","slug":"stir-siamese-transformer-for-image-retrieval","title":"STIR: Siamese Transformer for Image Retrieval Postprocessing","date":"2023-04-26","arxiv_id":"2304.13393","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/unicom-universal-and-compact-representation","slug":"unicom-universal-and-compact-representation","title":"Unicom: Universal and Compact Representation Learning for Image Retrieval","date":"2023-04-12","arxiv_id":"2304.05884","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":6,"official":{"repos":["deepglint/unicom"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unicom-universal-and-compact-representation#ran","syntology_url":"https://syntology.ai/paper/2304.05884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05884"}}}},{"paper":"/paper/fashion-image-retrieval-with-multi-granular-1","slug":"fashion-image-retrieval-with-multi-granular-1","title":"Fashion Image Retrieval with Multi-Granular Alignment","date":"2023-02-16","arxiv_id":"2302.08902","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hyperbolic-vision-transformers-combining","slug":"hyperbolic-vision-transformers-combining","title":"Hyperbolic Vision Transformers: Combining Improvements in Metric Learning","date":"2022-03-21","arxiv_id":"2203.10833","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["htdt/hyp_metric"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperbolic-vision-transformers-combining#ran","syntology_url":"https://syntology.ai/paper/2203.10833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10833"}}}},{"paper":"/paper/dissecting-the-impact-of-different-loss","slug":"dissecting-the-impact-of-different-loss","title":"Dissecting the impact of different loss functions with gradient surgery","date":"2022-01-27","arxiv_id":"2201.11307","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/it-takes-two-to-tango-mixup-for-deep-metric","slug":"it-takes-two-to-tango-mixup-for-deep-metric","title":"It Takes Two to Tango: Mixup for Deep Metric Learning","date":"2021-06-09","arxiv_id":"2106.04990","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["billpsomas/Metrix_ICLR22"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/it-takes-two-to-tango-mixup-for-deep-metric#ran","syntology_url":"https://syntology.ai/paper/2106.04990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04990"}}}},{"paper":"/paper/hard-negative-examples-are-hard-but-useful","slug":"hard-negative-examples-are-hard-but-useful","title":"Hard negative examples are hard, but useful","date":"2020-07-24","arxiv_id":"2007.12749","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/calibrated-neighborhood-aware-confidence","slug":"calibrated-neighborhood-aware-confidence","title":"Calibrated neighborhood aware confidence measure for deep metric learning","date":"2020-06-08","arxiv_id":"2006.04935","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/proxynca-revisiting-and-revitalizing-proxy","slug":"proxynca-revisiting-and-revitalizing-proxy","title":"ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysis","date":"2020-04-02","arxiv_id":"2004.01113","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proxynca-revisiting-and-revitalizing-proxy#ran","syntology_url":"https://syntology.ai/paper/2004.01113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01113"}}}},{"paper":"/paper/metric-learning-cross-entropy-vs-pairwise","slug":"metric-learning-cross-entropy-vs-pairwise","title":"A unifying mutual information view of metric learning: cross-entropy vs. pairwise losses","date":"2020-03-19","arxiv_id":"2003.08983","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jeromerony/dml_cross_entropy"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/metric-learning-cross-entropy-vs-pairwise#ran","syntology_url":"https://syntology.ai/paper/2003.08983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08983"}}}},{"paper":"/paper/cross-batch-memory-for-embedding-learning","slug":"cross-batch-memory-for-embedding-learning","title":"Cross-Batch Memory for Embedding Learning","date":"2019-12-14","arxiv_id":"1912.06798","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/multi-similarity-loss-with-general-pair","slug":"multi-similarity-loss-with-general-pair","title":"Multi-Similarity Loss with General Pair Weighting for Deep Metric Learning","date":"2019-04-14","arxiv_id":"1904.06627","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["MalongTech/research-ms-loss"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-similarity-loss-with-general-pair#ran","syntology_url":"https://syntology.ai/paper/1904.06627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06627"}}}},{"paper":"/paper/improved-embeddings-with-easy-positive","slug":"improved-embeddings-with-easy-positive","title":"Improved Embeddings with Easy Positive Triplet Mining","date":"2019-04-08","arxiv_id":"1904.04370","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["littleredxh/EasyPositiveHardNegative"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improved-embeddings-with-easy-positive#ran","syntology_url":"https://syntology.ai/paper/1904.04370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.04370"}}}},{"paper":"/paper/combination-of-multiple-global-descriptors","slug":"combination-of-multiple-global-descriptors","title":"Combination of Multiple Global Descriptors for Image Retrieval","date":"2019-03-26","arxiv_id":"1903.10663","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["naver/cgd"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/combination-of-multiple-global-descriptors#ran","syntology_url":"https://syntology.ai/paper/1903.10663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.10663"}}}},{"paper":"/paper/making-classification-competitive-for-deep","slug":"making-classification-competitive-for-deep","title":"Classification is a Strong Baseline for Deep Metric Learning","date":"2018-11-30","arxiv_id":"1811.12649","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["azgo14/classification_metric_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/making-classification-competitive-for-deep#ran","syntology_url":"https://syntology.ai/paper/1811.12649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12649"}}}},{"paper":"/paper/attention-based-ensemble-for-deep-metric","slug":"attention-based-ensemble-for-deep-metric","title":"Attention-based Ensemble for Deep Metric Learning","date":"2018-04-02","arxiv_id":"1804.00382","rows_on_this_dataset":1,"code_links":0,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/learning-semantic-proxies-from-visual-prompts","slug":"learning-semantic-proxies-from-visual-prompts","title":"Learning Semantic Proxies from Visual Prompts for Parameter-Efficient Fine-Tuning in Deep Metric Learning","date":"2024-02-04","arxiv_id":"2402.02340","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":3,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["noahsark/parameterefficient-dml"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-semantic-proxies-from-visual-prompts#ran","syntology_url":"https://syntology.ai/paper/2402.02340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02340"}}}},{"paper":"/paper/center-contrastive-loss-for-metric-learning","slug":"center-contrastive-loss-for-metric-learning","title":"Center Contrastive Loss for Metric Learning","date":"2023-08-01","arxiv_id":"2308.00458","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/stir-siamese-transformer-for-image-retrieval","slug":"stir-siamese-transformer-for-image-retrieval","title":"STIR: Siamese Transformer for Image Retrieval Postprocessing","date":"2023-04-26","arxiv_id":"2304.13393","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/unicom-universal-and-compact-representation","slug":"unicom-universal-and-compact-representation","title":"Unicom: Universal and Compact Representation Learning for Image Retrieval","date":"2023-04-12","arxiv_id":"2304.05884","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":6,"official":{"repos":["deepglint/unicom"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unicom-universal-and-compact-representation#ran","syntology_url":"https://syntology.ai/paper/2304.05884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05884"}}}},{"paper":"/paper/fashion-image-retrieval-with-multi-granular-1","slug":"fashion-image-retrieval-with-multi-granular-1","title":"Fashion Image Retrieval with Multi-Granular Alignment","date":"2023-02-16","arxiv_id":"2302.08902","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hyperbolic-vision-transformers-combining","slug":"hyperbolic-vision-transformers-combining","title":"Hyperbolic Vision Transformers: Combining Improvements in Metric Learning","date":"2022-03-21","arxiv_id":"2203.10833","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["htdt/hyp_metric"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperbolic-vision-transformers-combining#ran","syntology_url":"https://syntology.ai/paper/2203.10833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10833"}}}},{"paper":"/paper/dissecting-the-impact-of-different-loss","slug":"dissecting-the-impact-of-different-loss","title":"Dissecting the impact of different loss functions with gradient surgery","date":"2022-01-27","arxiv_id":"2201.11307","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/it-takes-two-to-tango-mixup-for-deep-metric","slug":"it-takes-two-to-tango-mixup-for-deep-metric","title":"It Takes Two to Tango: Mixup for Deep Metric Learning","date":"2021-06-09","arxiv_id":"2106.04990","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["billpsomas/Metrix_ICLR22"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/it-takes-two-to-tango-mixup-for-deep-metric#ran","syntology_url":"https://syntology.ai/paper/2106.04990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04990"}}}},{"paper":"/paper/hard-negative-examples-are-hard-but-useful","slug":"hard-negative-examples-are-hard-but-useful","title":"Hard negative examples are hard, but useful","date":"2020-07-24","arxiv_id":"2007.12749","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/calibrated-neighborhood-aware-confidence","slug":"calibrated-neighborhood-aware-confidence","title":"Calibrated neighborhood aware confidence measure for deep metric learning","date":"2020-06-08","arxiv_id":"2006.04935","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/proxynca-revisiting-and-revitalizing-proxy","slug":"proxynca-revisiting-and-revitalizing-proxy","title":"ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysis","date":"2020-04-02","arxiv_id":"2004.01113","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proxynca-revisiting-and-revitalizing-proxy#ran","syntology_url":"https://syntology.ai/paper/2004.01113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01113"}}}},{"paper":"/paper/metric-learning-cross-entropy-vs-pairwise","slug":"metric-learning-cross-entropy-vs-pairwise","title":"A unifying mutual information view of metric learning: cross-entropy vs. pairwise losses","date":"2020-03-19","arxiv_id":"2003.08983","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jeromerony/dml_cross_entropy"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/metric-learning-cross-entropy-vs-pairwise#ran","syntology_url":"https://syntology.ai/paper/2003.08983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08983"}}}},{"paper":"/paper/cross-batch-memory-for-embedding-learning","slug":"cross-batch-memory-for-embedding-learning","title":"Cross-Batch Memory for Embedding Learning","date":"2019-12-14","arxiv_id":"1912.06798","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/multi-similarity-loss-with-general-pair","slug":"multi-similarity-loss-with-general-pair","title":"Multi-Similarity Loss with General Pair Weighting for Deep Metric Learning","date":"2019-04-14","arxiv_id":"1904.06627","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["MalongTech/research-ms-loss"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-similarity-loss-with-general-pair#ran","syntology_url":"https://syntology.ai/paper/1904.06627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06627"}}}},{"paper":"/paper/improved-embeddings-with-easy-positive","slug":"improved-embeddings-with-easy-positive","title":"Improved Embeddings with Easy Positive Triplet Mining","date":"2019-04-08","arxiv_id":"1904.04370","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["littleredxh/EasyPositiveHardNegative"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improved-embeddings-with-easy-positive#ran","syntology_url":"https://syntology.ai/paper/1904.04370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.04370"}}}},{"paper":"/paper/combination-of-multiple-global-descriptors","slug":"combination-of-multiple-global-descriptors","title":"Combination of Multiple Global Descriptors for Image Retrieval","date":"2019-03-26","arxiv_id":"1903.10663","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["naver/cgd"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/combination-of-multiple-global-descriptors#ran","syntology_url":"https://syntology.ai/paper/1903.10663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.10663"}}}},{"paper":"/paper/making-classification-competitive-for-deep","slug":"making-classification-competitive-for-deep","title":"Classification is a Strong Baseline for Deep Metric Learning","date":"2018-11-30","arxiv_id":"1811.12649","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["azgo14/classification_metric_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/making-classification-competitive-for-deep#ran","syntology_url":"https://syntology.ai/paper/1811.12649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12649"}}}},{"paper":"/paper/attention-based-ensemble-for-deep-metric","slug":"attention-based-ensemble-for-deep-metric","title":"Attention-based Ensemble for Deep Metric Learning","date":"2018-04-02","arxiv_id":"1804.00382","rows_on_this_dataset":1,"code_links":0,"syntology":null}],"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/dataset/in-shop/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/in-shop/papers/ran/1","json":"/dataset/in-shop/papers/ran/1.json","rows":8}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":10,"samples_harvested":37,"samples_ran":19,"samples_constructed":3,"samples_ran_checked":12,"samples_ran_instrument_failed":7,"samples_unverified":18,"pointer_only_for_licence":7,"papers_with_no_sample_that_ran":2,"papers_with_a_sample_that_ran":8,"papers_with_a_run_with_no_instrument_failure":7,"papers_where_every_run_was_an_instrument_failure":1,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"99ab7ddba1110cc083b6b8a9f517920c545875d28a9b060d13c445e6038083ae","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}