{"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":"/task/metric-learning/papers/5","list_of":"/task/metric-learning","task":"Metric Learning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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'","n_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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":5,"pages_in_order":17,"rows_per_page":100,"rows":[401,500],"of":1648,"counts":{"archive_papers_tagged":1648,"with_a_code_link":613,"where_syntology_ran_a_sample":133,"not_listed_spam_title":0,"listed":1648,"listed_where_code_ran":133,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":116,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":116,"listed_every_run_a_failure_of_syntologys_instrument":17,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/metric-learning","prev":"/task/metric-learning/papers/4","next":"/task/metric-learning/papers/6","papers":[{"url":"/paper/learning-deep-local-features-with-multiple","slug":"learning-deep-local-features-with-multiple","title":"Learning Deep Local Features With Multiple Dynamic Attentions for Large-Scale Image Retrieval","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/single-image-3d-shape-retrieval-via-cross","slug":"single-image-3d-shape-retrieval-via-cross","title":"Single Image 3D Shape Retrieval via Cross-Modal Instance and Category Contrastive Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/skeleton-dml-deep-metric-learning-for","slug":"skeleton-dml-deep-metric-learning-for","title":"Skeleton-DML: Deep Metric Learning for Skeleton-Based One-Shot Action Recognition","date":"2020-12-26","arxiv_id":"2012.13823","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-one-shot-human-parsing","slug":"progressive-one-shot-human-parsing","title":"Progressive One-shot Human Parsing","date":"2020-12-22","arxiv_id":"2012.11810","repositories_listed":1,"syntology":null},{"url":"/paper/odd-one-out-representation-learning","slug":"odd-one-out-representation-learning","title":"Odd-One-Out Representation Learning","date":"2020-12-14","arxiv_id":"2012.07966","repositories_listed":1,"syntology":null},{"url":"/paper/intrinsic-persistent-homology-via-density","slug":"intrinsic-persistent-homology-via-density","title":"Intrinsic persistent homology via density-based metric learning","date":"2020-12-11","arxiv_id":"2012.07621","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/intrinsic-persistent-homology-via-density#ran","syntology_url":"https://syntology.ai/paper/2012.07621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07621"}},"official":{"repos":["ximenafernandez/intrinsicPH"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/layoutgmn-neural-graph-matching-for","slug":"layoutgmn-neural-graph-matching-for","title":"LayoutGMN: Neural Graph Matching for Structural Layout Similarity","date":"2020-12-11","arxiv_id":"2012.06547","repositories_listed":1,"syntology":null},{"url":"/paper/vlpd-net-a-registration-aided-domain","slug":"vlpd-net-a-registration-aided-domain","title":"A Registration-aided Domain Adaptation Network for 3D Point Cloud Based Place Recognition","date":"2020-12-09","arxiv_id":"2012.05018","repositories_listed":1,"syntology":null},{"url":"/paper/id-reveal-identity-aware-deepfake-video","slug":"id-reveal-identity-aware-deepfake-video","title":"ID-Reveal: Identity-aware DeepFake Video Detection","date":"2020-12-04","arxiv_id":"2012.02512","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/id-reveal-identity-aware-deepfake-video#ran","syntology_url":"https://syntology.ai/paper/2012.02512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.02512"}},"official":{"repos":["grip-unina/id-reveal"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generalization-bound-of-gradient-descent-for","slug":"generalization-bound-of-gradient-descent-for","title":"Generalization Bound of Gradient Descent for Non-Convex Metric Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/soe-net-a-self-attention-and-orientation","slug":"soe-net-a-self-attention-and-orientation","title":"SOE-Net: A Self-Attention and Orientation Encoding Network for Point Cloud based Place Recognition","date":"2020-11-24","arxiv_id":"2011.12430","repositories_listed":1,"syntology":null},{"url":"/paper/towards-improved-and-interpretable-deep","slug":"towards-improved-and-interpretable-deep","title":"Towards Improved and Interpretable Deep Metric Learning via Attentive Grouping","date":"2020-11-17","arxiv_id":"2011.08877","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-similarity-space-tailored-for","slug":"a-new-similarity-space-tailored-for","title":"A New Similarity Space Tailored for Supervised Deep Metric Learning","date":"2020-11-16","arxiv_id":"2011.08325","repositories_listed":1,"syntology":null},{"url":"/paper/mask-proxy-loss-for-text-independent-speaker","slug":"mask-proxy-loss-for-text-independent-speaker","title":"Masked Proxy Loss For Text-Independent Speaker Verification","date":"2020-11-09","arxiv_id":"2011.04491","repositories_listed":1,"syntology":null},{"url":"/paper/minkloc3d-point-cloud-based-large-scale-place","slug":"minkloc3d-point-cloud-based-large-scale-place","title":"MinkLoc3D: Point Cloud Based Large-Scale Place Recognition","date":"2020-11-09","arxiv_id":"2011.04530","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/minkloc3d-point-cloud-based-large-scale-place#ran","syntology_url":"https://syntology.ai/paper/2011.04530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.04530"}},"official":{"repos":["jac99/MinkLoc3D"],"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"]}}},{"url":"/paper/adversarial-self-supervised-scene-flow","slug":"adversarial-self-supervised-scene-flow","title":"Adversarial Self-Supervised Scene Flow Estimation","date":"2020-11-01","arxiv_id":"2011.00551","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-metric-learning-for-tag-based","slug":"multimodal-metric-learning-for-tag-based","title":"Multimodal Metric Learning for Tag-based Music Retrieval","date":"2020-10-30","arxiv_id":"2010.16030","repositories_listed":1,"syntology":null},{"url":"/paper/fewer-is-more-a-deep-graph-metric-learning","slug":"fewer-is-more-a-deep-graph-metric-learning","title":"Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxies","date":"2020-10-26","arxiv_id":"2010.13636","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/fewer-is-more-a-deep-graph-metric-learning#ran","syntology_url":"https://syntology.ai/paper/2010.13636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13636"}},"official":{"repos":["YuehuaZhu/ProxyGML"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unclicked-user-behaviors-enhanced","slug":"unclicked-user-behaviors-enhanced","title":"XDM: Improving Sequential Deep Matching with Unclicked User Behaviors for Recommender System","date":"2020-10-24","arxiv_id":"2010.12837","repositories_listed":1,"syntology":null},{"url":"/paper/restoring-negative-information-in-few-shot","slug":"restoring-negative-information-in-few-shot","title":"Restoring Negative Information in Few-Shot Object Detection","date":"2020-10-22","arxiv_id":"2010.11714","repositories_listed":1,"syntology":null},{"url":"/paper/self-alignment-pre-training-for-biomedical","slug":"self-alignment-pre-training-for-biomedical","title":"Self-Alignment Pretraining for Biomedical Entity Representations","date":"2020-10-22","arxiv_id":"2010.11784","repositories_listed":1,"syntology":null},{"url":"/paper/graphite-graph-induced-feature-extraction-for","slug":"graphite-graph-induced-feature-extraction-for","title":"Graphite: GRAPH-Induced feaTure Extraction for Point Cloud Registration","date":"2020-10-18","arxiv_id":"2010.09079","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-distillation-of-syntactic","slug":"unsupervised-distillation-of-syntactic","title":"Unsupervised Distillation of Syntactic Information from Contextualized Word Representations","date":"2020-10-11","arxiv_id":"2010.05265","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-learning-with-hard-negative-1","slug":"contrastive-learning-with-hard-negative-1","title":"Contrastive Learning with Hard Negative Samples","date":"2020-10-09","arxiv_id":"2010.04592","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/contrastive-learning-with-hard-negative-1#ran","syntology_url":"https://syntology.ai/paper/2010.04592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04592"}},"official":{"repos":["joshr17/HCL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-fully-offline-meta-reinforcement","slug":"efficient-fully-offline-meta-reinforcement","title":"FOCAL: Efficient Fully-Offline Meta-Reinforcement Learning via Distance Metric Learning and Behavior Regularization","date":"2020-10-02","arxiv_id":"2010.01112","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-fully-offline-meta-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2010.01112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01112"}},"official":{"repos":["FOCAL-ICLR/FOCAL-ICLR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-new-dataset-of-dog-breed-images-and-a","slug":"a-new-dataset-of-dog-breed-images-and-a","title":"A new dataset of dog breed images and a benchmark for fine-grained classification","date":"2020-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/acceleration-of-large-margin-metric-learning","slug":"acceleration-of-large-margin-metric-learning","title":"Acceleration of Large Margin Metric Learning for Nearest Neighbor Classification Using Triplet Mining and Stratified Sampling","date":"2020-09-29","arxiv_id":"2009.14244","repositories_listed":1,"syntology":null},{"url":"/paper/learning-self-expression-metrics-for-scalable","slug":"learning-self-expression-metrics-for-scalable","title":"Learning Self-Expression Metrics for Scalable and Inductive Subspace Clustering","date":"2020-09-27","arxiv_id":"2009.12875","repositories_listed":1,"syntology":null},{"url":"/paper/s2sd-simultaneous-similarity-based-self","slug":"s2sd-simultaneous-similarity-based-self","title":"S2SD: Simultaneous Similarity-based Self-Distillation for Deep Metric Learning","date":"2020-09-17","arxiv_id":"2009.08348","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/s2sd-simultaneous-similarity-based-self#ran","syntology_url":"https://syntology.ai/paper/2009.08348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08348"}},"official":{"repos":["MLforHealth/S2SD"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-invariant-similarity-activation-map","slug":"domain-invariant-similarity-activation-map","title":"Domain-invariant Similarity Activation Map Contrastive Learning for Retrieval-based Long-term Visual Localization","date":"2020-09-16","arxiv_id":"2009.07719","repositories_listed":1,"syntology":null},{"url":"/paper/cosine-meets-softmax-a-tough-to-beat-baseline","slug":"cosine-meets-softmax-a-tough-to-beat-baseline","title":"Cosine meets Softmax: A tough-to-beat baseline for visual grounding","date":"2020-09-13","arxiv_id":"2009.06066","repositories_listed":1,"syntology":null},{"url":"/paper/attributes-guided-and-pure-visual-attention","slug":"attributes-guided-and-pure-visual-attention","title":"Attributes-Guided and Pure-Visual Attention Alignment for Few-Shot Recognition","date":"2020-09-10","arxiv_id":"2009.04724","repositories_listed":1,"syntology":null},{"url":"/paper/deep-metric-learning-meets-deep-clustering-an","slug":"deep-metric-learning-meets-deep-clustering-an","title":"Deep Metric Learning Meets Deep Clustering: An Novel Unsupervised Approach for Feature Embedding","date":"2020-09-09","arxiv_id":"2009.04091","repositories_listed":1,"syntology":null},{"url":"/paper/proxy-network-for-few-shot-learning","slug":"proxy-network-for-few-shot-learning","title":"Proxy Network for Few Shot Learning","date":"2020-09-09","arxiv_id":"2009.04292","repositories_listed":1,"syntology":null},{"url":"/paper/region-comparison-network-for-interpretable","slug":"region-comparison-network-for-interpretable","title":"Region Comparison Network for Interpretable Few-shot Image Classification","date":"2020-09-08","arxiv_id":"2009.03558","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-vec-trick-for-fast-learning-of","slug":"generalized-vec-trick-for-fast-learning-of","title":"Generalized vec trick for fast learning of pairwise kernel models","date":"2020-09-02","arxiv_id":"2009.01054","repositories_listed":1,"syntology":null},{"url":"/paper/1st-place-solution-to-google-landmark","slug":"1st-place-solution-to-google-landmark","title":"1st Place Solution to Google Landmark Retrieval 2020","date":"2020-08-24","arxiv_id":"2009.05132","repositories_listed":1,"syntology":null},{"url":"/paper/3rd-place-solution-to-google-landmark","slug":"3rd-place-solution-to-google-landmark","title":"3rd Place Solution to \"Google Landmark Retrieval 2020\"","date":"2020-08-24","arxiv_id":"2008.10480","repositories_listed":1,"syntology":null},{"url":"/paper/emotion-based-end-to-end-matching-between","slug":"emotion-based-end-to-end-matching-between","title":"Emotion-Based End-to-End Matching Between Image and Music in Valence-Arousal Space","date":"2020-08-22","arxiv_id":"2009.05103","repositories_listed":1,"syntology":null},{"url":"/paper/pytorch-metric-learning","slug":"pytorch-metric-learning","title":"PyTorch Metric Learning","date":"2020-08-20","arxiv_id":"2008.09164","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-self-supervised-3d-data","slug":"uncertainty-aware-self-supervised-3d-data","title":"Uncertainty-aware Self-supervised 3D Data Association","date":"2020-08-18","arxiv_id":"2008.08173","repositories_listed":1,"syntology":null},{"url":"/paper/prime-aware-adaptive-distillation","slug":"prime-aware-adaptive-distillation","title":"Prime-Aware Adaptive Distillation","date":"2020-08-04","arxiv_id":"2008.01458","repositories_listed":1,"syntology":null},{"url":"/paper/pienet-personalized-image-enhancement-network","slug":"pienet-personalized-image-enhancement-network","title":"PieNet: Personalized Image Enhancement Network","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-rgb-d-feature-embeddings-for-unseen","slug":"learning-rgb-d-feature-embeddings-for-unseen","title":"Learning RGB-D Feature Embeddings for Unseen Object Instance Segmentation","date":"2020-07-30","arxiv_id":"2007.15157","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-keyword-spotting-with-prototypical-1","slug":"few-shot-keyword-spotting-with-prototypical-1","title":"Few-Shot Keyword Spotting With Prototypical Networks","date":"2020-07-25","arxiv_id":"2007.14463","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/time-frequency-scattering-accurately-models","slug":"time-frequency-scattering-accurately-models","title":"Time-Frequency Scattering Accurately Models Auditory Similarities Between Instrumental Playing Techniques","date":"2020-07-21","arxiv_id":"2007.10926","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multi-metric-learning-for-text","slug":"deep-multi-metric-learning-for-text","title":"Deep multi-metric learning for text-independent speaker verification","date":"2020-07-17","arxiv_id":"2007.10479","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-background-aware-loss-for-weakly","slug":"adversarial-background-aware-loss-for-weakly","title":"Adversarial Background-Aware Loss for Weakly-supervised Temporal Activity Localization","date":"2020-07-13","arxiv_id":"2007.06643","repositories_listed":1,"syntology":null},{"url":"/paper/ecml-an-ensemble-cascade-metric-learning","slug":"ecml-an-ensemble-cascade-metric-learning","title":"ECML: An Ensemble Cascade Metric Learning Mechanism towards Face Verification","date":"2020-07-11","arxiv_id":"2007.05720","repositories_listed":1,"syntology":null},{"url":"/paper/batch-incremental-triplet-sampling-for","slug":"batch-incremental-triplet-sampling-for","title":"Batch-Incremental Triplet Sampling for Training Triplet Networks Using Bayesian Updating Theorem","date":"2020-07-10","arxiv_id":"2007.05610","repositories_listed":1,"syntology":null},{"url":"/paper/spatial-semantic-embedding-network-fast-3d","slug":"spatial-semantic-embedding-network-fast-3d","title":"Spatial Semantic Embedding Network: Fast 3D Instance Segmentation with Deep Metric Learning","date":"2020-07-07","arxiv_id":"2007.03169","repositories_listed":1,"syntology":null},{"url":"/paper/offline-versus-online-triplet-mining-based-on","slug":"offline-versus-online-triplet-mining-based-on","title":"Offline versus Online Triplet Mining based on Extreme Distances of Histopathology Patches","date":"2020-07-04","arxiv_id":"2007.02200","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-by-subspace-diffusion","slug":"disentangling-by-subspace-diffusion","title":"Disentangling by Subspace Diffusion","date":"2020-06-23","arxiv_id":"2006.12982","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/disentangling-by-subspace-diffusion#ran","syntology_url":"https://syntology.ai/paper/2006.12982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12982"}},"official":{"repos":["deepmind/deepmind-research"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-factorization-machines-with","slug":"enhancing-factorization-machines-with","title":"Enhancing Factorization Machines with Generalized Metric Learning","date":"2020-06-20","arxiv_id":"2006.11600","repositories_listed":1,"syntology":null},{"url":"/paper/bypassing-gradients-re-projection-with","slug":"bypassing-gradients-re-projection-with","title":"Semi-Discriminative Representation Loss for Online Continual Learning","date":"2020-06-19","arxiv_id":"2006.11234","repositories_listed":1,"syntology":null},{"url":"/paper/compositional-learning-of-image-text-query","slug":"compositional-learning-of-image-text-query","title":"Compositional Learning of Image-Text Query for Image Retrieval","date":"2020-06-19","arxiv_id":"2006.11149","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-learning-of-image-text-query#ran","syntology_url":"https://syntology.ai/paper/2006.11149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11149"}},"official":{"repos":["ecom-research/ComposeAE"],"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"]}}},{"url":"/paper/quantile-quantile-embedding-for-distribution","slug":"quantile-quantile-embedding-for-distribution","title":"Quantile-Quantile Embedding for Distribution Transformation and Manifold Embedding with Ability to Choose the Embedding Distribution","date":"2020-06-19","arxiv_id":"2006.11385","repositories_listed":1,"syntology":null},{"url":"/paper/signed-graph-metric-learning-via-gershgorin","slug":"signed-graph-metric-learning-via-gershgorin","title":"Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment","date":"2020-06-15","arxiv_id":"2006.08816","repositories_listed":1,"syntology":null},{"url":"/paper/towards-certified-robustness-of-metric","slug":"towards-certified-robustness-of-metric","title":"Towards Certified Robustness of Distance Metric Learning","date":"2020-06-10","arxiv_id":"2006.05945","repositories_listed":1,"syntology":null},{"url":"/paper/fast-er-reconstruction-of-shredded-text","slug":"fast-er-reconstruction-of-shredded-text","title":"Fast(er) Reconstruction of Shredded Text Documents via Self-Supervised Deep Asymmetric Metric Learning","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/moving-in-the-right-direction-a","slug":"moving-in-the-right-direction-a","title":"Moving in the Right Direction: A Regularization for Deep Metric Learning","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/epillid-dataset-a-low-shot-fine-grained","slug":"epillid-dataset-a-low-shot-fine-grained","title":"ePillID Dataset: A Low-Shot Fine-Grained Benchmark for Pill Identification","date":"2020-05-28","arxiv_id":"2005.14288","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-open-set-recognition-using-meta","slug":"few-shot-open-set-recognition-using-meta","title":"Few-Shot Open-Set Recognition using Meta-Learning","date":"2020-05-27","arxiv_id":"2005.13713","repositories_listed":1,"syntology":null},{"url":"/paper/anomaly-detection-in-video-games","slug":"anomaly-detection-in-video-games","title":"A Metric Learning Approach to Anomaly Detection in Video Games","date":"2020-05-20","arxiv_id":"2005.10211","repositories_listed":1,"syntology":null},{"url":"/paper/batch-decorrelation-for-active-metric","slug":"batch-decorrelation-for-active-metric","title":"Batch Decorrelation for Active Metric Learning","date":"2020-05-20","arxiv_id":"2005.10008","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-anomaly-detection-via-deep","slug":"unsupervised-anomaly-detection-via-deep","title":"Unsupervised Anomaly Detection via Deep Metric Learning with End-to-End Optimization","date":"2020-05-12","arxiv_id":"2005.05865","repositories_listed":1,"syntology":null},{"url":"/paper/supervision-and-source-domain-impact-on","slug":"supervision-and-source-domain-impact-on","title":"Supervision and Source Domain Impact on Representation Learning: A Histopathology Case Study","date":"2020-05-10","arxiv_id":"2005.08629","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-object-detection-without-fine-tuning","slug":"one-shot-object-detection-without-fine-tuning","title":"One-Shot Object Detection without Fine-Tuning","date":"2020-05-08","arxiv_id":"2005.03819","repositories_listed":1,"syntology":null},{"url":"/paper/project-and-forget-solving-large-scale-metric-1","slug":"project-and-forget-solving-large-scale-metric-1","title":"Project and Forget: Solving Large-Scale Metric Constrained Problems","date":"2020-05-08","arxiv_id":"2005.03853","repositories_listed":1,"syntology":null},{"url":"/paper/signal-level-deep-metric-learning-for","slug":"signal-level-deep-metric-learning-for","title":"SL-DML: Signal Level Deep Metric Learning for Multimodal One-Shot Action Recognition","date":"2020-04-23","arxiv_id":"2004.11085","repositories_listed":1,"syntology":null},{"url":"/paper/variance-reduction-for-distributed-stochastic-1","slug":"variance-reduction-for-distributed-stochastic-1","title":"Federated Stochastic Gradient Langevin Dynamics","date":"2020-04-23","arxiv_id":"2004.11231","repositories_listed":1,"syntology":null},{"url":"/paper/continual-learning-of-object-instances","slug":"continual-learning-of-object-instances","title":"Continual Learning of Object Instances","date":"2020-04-22","arxiv_id":"2004.10862","repositories_listed":1,"syntology":null},{"url":"/paper/triplet-loss-for-knowledge-distillation","slug":"triplet-loss-for-knowledge-distillation","title":"Triplet Loss for Knowledge Distillation","date":"2020-04-17","arxiv_id":"2004.08116","repositories_listed":1,"syntology":null},{"url":"/paper/asl-recognition-with-metric-learning-based-1","slug":"asl-recognition-with-metric-learning-based-1","title":"ASL Recognition with Metric-Learning based Lightweight Network","date":"2020-04-10","arxiv_id":"2004.05054","repositories_listed":1,"syntology":null},{"url":"/paper/fisher-discriminant-triplet-and-contrastive","slug":"fisher-discriminant-triplet-and-contrastive","title":"Fisher Discriminant Triplet and Contrastive Losses for Training Siamese Networks","date":"2020-04-05","arxiv_id":"2004.04674","repositories_listed":1,"syntology":null},{"url":"/paper/deformation-aware-3d-model-embedding-and","slug":"deformation-aware-3d-model-embedding-and","title":"Deformation-Aware 3D Model Embedding and Retrieval","date":"2020-04-02","arxiv_id":"2004.01228","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","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"}},"official":null}},{"url":"/paper/a-comparison-of-metric-learning-loss","slug":"a-comparison-of-metric-learning-loss","title":"A Comparison of Metric Learning Loss Functions for End-To-End Speaker Verification","date":"2020-03-31","arxiv_id":"2003.14021","repositories_listed":1,"syntology":null},{"url":"/paper/negative-margin-matters-understanding-margin","slug":"negative-margin-matters-understanding-margin","title":"Negative Margin Matters: Understanding Margin in Few-shot Classification","date":"2020-03-26","arxiv_id":"2003.12060","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-object-motion-and-affinity-model","slug":"a-unified-object-motion-and-affinity-model","title":"A Unified Object Motion and Affinity Model for Online Multi-Object Tracking","date":"2020-03-25","arxiv_id":"2003.11291","repositories_listed":1,"syntology":null},{"url":"/paper/pads-policy-adapted-sampling-for-visual","slug":"pads-policy-adapted-sampling-for-visual","title":"PADS: Policy-Adapted Sampling for Visual Similarity Learning","date":"2020-03-24","arxiv_id":"2003.11113","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pads-policy-adapted-sampling-for-visual#ran","syntology_url":"https://syntology.ai/paper/2003.11113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11113"}},"official":{"repos":["Confusezius/CVPR2020_PADS"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/faster-reconstruction-of-shredded-text","slug":"faster-reconstruction-of-shredded-text","title":"Fast(er) Reconstruction of Shredded Text Documents via Self-Supervised Deep Asymmetric Metric Learning","date":"2020-03-23","arxiv_id":"2003.10063","repositories_listed":1,"syntology":null},{"url":"/paper/temporally-coherent-embeddings-for-self","slug":"temporally-coherent-embeddings-for-self","title":"Temporally Coherent Embeddings for Self-Supervised Video Representation Learning","date":"2020-03-21","arxiv_id":"2004.02753","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/temporally-coherent-embeddings-for-self#ran","syntology_url":"https://syntology.ai/paper/2004.02753","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02753"}},"official":{"repos":["csiro-robotics/TCE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/detecting-deepfakes-with-metric-learning","slug":"detecting-deepfakes-with-metric-learning","title":"Detecting Deepfakes with Metric Learning","date":"2020-03-19","arxiv_id":"2003.08645","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/building-computationally-efficient-and-well","slug":"building-computationally-efficient-and-well","title":"Building Computationally Efficient and Well-Generalizing Person Re-Identification Models with Metric Learning","date":"2020-03-17","arxiv_id":"2003.07618","repositories_listed":1,"syntology":null},{"url":"/paper/metric-learning-for-ordered-labeled-trees","slug":"metric-learning-for-ordered-labeled-trees","title":"Metric Learning for Ordered Labeled Trees with pq-grams","date":"2020-03-09","arxiv_id":"2003.03960","repositories_listed":1,"syntology":null},{"url":"/paper/an-end-to-end-approach-for-the-verification","slug":"an-end-to-end-approach-for-the-verification","title":"An end-to-end approach for the verification problem: learning the right distance","date":"2020-02-21","arxiv_id":"2002.09469","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-end-to-end-approach-for-the-verification#ran","syntology_url":"https://syntology.ai/paper/2002.09469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09469"}},"official":{"repos":["joaomonteirof/e2e_verification"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-distance-metric-learning-with","slug":"graph-neural-distance-metric-learning-with","title":"Graph Neural Distance Metric Learning with Graph-Bert","date":"2020-02-09","arxiv_id":"2002.03427","repositories_listed":1,"syntology":null},{"url":"/paper/symmetrical-synthesis-for-deep-metric","slug":"symmetrical-synthesis-for-deep-metric","title":"Symmetrical Synthesis for Deep Metric Learning","date":"2020-01-31","arxiv_id":"2001.11658","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-temporal-action-1","slug":"weakly-supervised-temporal-action-1","title":"Weakly Supervised Temporal Action Localization Using Deep Metric Learning","date":"2020-01-21","arxiv_id":"2001.07793","repositories_listed":1,"syntology":null},{"url":"/paper/distance-metric-learning-with-joint","slug":"distance-metric-learning-with-joint","title":"Distance Metric Learning with Joint Representation Diversification","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-effective-framework-for-pairwise-1","slug":"a-simple-and-effective-framework-for-pairwise-1","title":"A Simple and Effective Framework for Pairwise Deep Metric Learning","date":"2019-12-24","arxiv_id":"1912.11194","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/a-simple-and-effective-framework-for-pairwise-1#ran","syntology_url":"https://syntology.ai/paper/1912.11194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11194"}},"official":{"repos":["qiqi-helloworld/A-Simple-and-Effective-Framework-for-Pairewise-Distance-Metric-Learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/deep-iterative-and-adaptive-learning-for","slug":"deep-iterative-and-adaptive-learning-for","title":"Deep Iterative and Adaptive Learning for Graph Neural Networks","date":"2019-12-17","arxiv_id":"1912.07832","repositories_listed":1,"syntology":null},{"url":"/paper/curvilinear-distance-metric-learning","slug":"curvilinear-distance-metric-learning","title":"Curvilinear Distance Metric Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unbiased-evaluation-of-deep-metric-learning","slug":"unbiased-evaluation-of-deep-metric-learning","title":"Unbiased Evaluation of Deep Metric Learning Algorithms","date":"2019-11-28","arxiv_id":"1911.12528","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-open-set-deep-logo-detection","slug":"large-scale-open-set-deep-logo-detection","title":"Large Scale Open-Set Deep Logo Detection","date":"2019-11-18","arxiv_id":"1911.07440","repositories_listed":1,"syntology":null},{"url":"/paper/ground-metric-learning-on-graphs","slug":"ground-metric-learning-on-graphs","title":"Ground Metric Learning on Graphs","date":"2019-11-08","arxiv_id":"1911.03117","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ground-metric-learning-on-graphs#ran","syntology_url":"https://syntology.ai/paper/1911.03117","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03117"}},"official":{"repos":["matthieuheitz/2020-JMIV-ground-metric-learning-graphs"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/metric-learning-for-dynamic-text-1","slug":"metric-learning-for-dynamic-text-1","title":"Metric Learning for Dynamic Text Classification","date":"2019-11-04","arxiv_id":"1911.01026","repositories_listed":1,"syntology":null}],"record_sha256":"dddd12a67539e207c7f8d5502cb906eb35cf1377a2865c67243280a50dfbf398","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}