Revisiting Metric Space Similarity Methods for High Performance Deep Embedding Learning

Citations

SCOPUS

0

초록

With the growing popularity of large language models (LLMs) and the few-shot learners, deep neural network based metric space learning has attracted considerable attention. Metric space learning aims at learning feature embeddings through training embedding models, followed by computing the metric space similarity of feature vectors in the learned embedding space for different types of downstream learning tasks, such as multi-modal embedding learning for cross-modal retrieval. However, existing methods on cosine-based metric space similarity suffer from several limitations. First, when applying the cosine similarity to high dimensional vectors, the shapes of the two vectors must be identical, Second, the metric space similarity on the concatenate layer may suffer from misalignment of the vector elements because the concatenate layer may not reflect the positions of the elements in the two vectors, leading to deteriorated performance with respect to the learning success rates. This paper will review the limitations of the metric space similarity methods, such as cosine similarity or concatenate layer, and provide our insight on some solution approaches we have developed to address these limitations. © 2023 IEEE.

키워드

Deep Neural NetworksMetric Space LearningMetric Space Similarity
제목
Revisiting Metric Space Similarity Methods for High Performance Deep Embedding Learning
저자
Yi, ChungheonChoi, WonikLiu, Ling
DOI
10.1109/CogMI58952.2023.00031
발행일
2023
유형
Conference paper
저널명
Proceedings - 2023 IEEE 5th International Conference on Cognitive Machine Intelligence, CogMI 2023
페이지
159 ~ 164