{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/mes-loss-mutually-equidistant-separation","title":"MES-Loss: Mutually equidistant separation metric learning loss function","arxiv_id":null,"date":"2023-08-01","proceeding":"Pattern Recognition Letters 2023 8","authors":["Yasser Boutaleb","Catherine Soladie","Nam-Duong Duong","Amine Kacete","Jérôme Royan","Renaud Seguier"],"abstract":"Deep metric learning has attracted much attention in recent years due to its extensive applications, such as clustering and image retrieval. Thanks to the success of deep learning (DL), many deep metric learning (DML) methods have been proposed. Neural networks (NNs) utilize DML loss functions to learn a mapping function that maps samples into a highly discriminative low-dimensional feature space, facilitating measuring similarities between pairs of samples in such a manifold. Most existing methods usually try to boost the discriminatory power of NN by enhancing intra-class compactness in the high-level feature space. However, they do not explicitly imply constraints to improve inter-class separation. We propose in this paper a new composite DML loss function that, in addition to the intra-class compactness, explicitly implies regulations to enforce the best inter-class separation by mutually equidistantly distributing the centers of the classes. The proposed DML loss function achieved state-of-the-art results for clustering and image-retrieval tasks on two real-world data sets.","url_abs":"https://www.sciencedirect.com/science/article/abs/pii/S0167865523001824","url_pdf":"https://www.sciencedirect.com/science/article/abs/pii/S0167865523001824","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":"clustering","task_name":"Clustering"},{"task_slug":"image-clustering","task_name":"Image Clustering"},{"task_slug":"image-retrieval","task_name":"Image Retrieval"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-clustering-on-cars196","task":"Image Clustering","dataset":"CARS196","model":"MES-Loss","rank_in_archive_order":1,"of":1,"metrics":{"NMI":"74.82"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-cub-200-2011","task":"Image Clustering","dataset":"CUB-200-2011","model":"MES-Loss","rank_in_archive_order":1,"of":1,"metrics":{"NMI":"73.35"},"uses_additional_data":false},{"leaderboard":"/sota/image-retrieval-on-cars196","task":"Image Retrieval","dataset":"CARS196","model":"MES-Loss","rank_in_archive_order":4,"of":8,"metrics":{"R@1":"87.89","R@8":"97.62"},"uses_additional_data":false},{"leaderboard":"/sota/image-retrieval-on-cub-200-2011","task":"Image Retrieval","dataset":"CUB-200-2011","model":"MES-Loss","rank_in_archive_order":5,"of":8,"metrics":{"R@1":"67.03","R@2":"75.67","R@4":"84.75","R@8":"91.50"},"uses_additional_data":false}],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}