mlsanityData to 14 Oct 2026

Anchor-aware Deep Metric Learning for Audio-visual Retrieval

arXiv 2404.13789 ↗First posted 21 Apr 2024cs.SD cs.AI cs.IRcited by 4

Not on the map. Why?

Abstract (arXiv)

Metric learning minimizes the gap between similar (positive) pairs of data points and increases the separation of dissimilar (negative) pairs, aiming at capturing the underlying data structure and enhancing the performance of tasks like audio-visual cross-modal retrieval (AV-CMR). Recent works employ sampling methods to select impactful data points from the embedding space during training. However, the model training fails to fully explore the space due to the scarcity of training data points, resulting in an incomplete representation of the overall positive and negative distributions. In this paper, we propose an innovative Anchor-aware Deep Metric Learning (AADML) method to address this challenge by uncovering the underlying correlations among existing data points, which enhances the quality of the shared embedding space. Specifically, our method establishes a correlation graph-based manifold structure by considering the dependencies between each sample as the anchor and its semantically similar samples. Through dynamic weighting of the correlations within this underlying manifold structure using an attention-driven mechanism, Anchor Awareness (AA) scores are obtained for each anchor. These AA scores serve as data proxies to compute relative distances in metric learning approaches. Extensive experiments conducted on two audio-visual benchmark datasets demonstrate the effectiveness of our proposed AADML method, significantly surpassing state-of-the-art models. Furthermore, we investigate the integration of AA proxies with various metric learning methods, further highlighting the efficacy of our approach.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 22 of its 46 references that are in the map. First posted on arXiv 21 Apr 2024.

Builds on

22 of 46 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2020Supervised Contrastive Learningcited by 2,829
  4. 2017In Defense of the Triplet Loss for Person Re-Identificationcited by 786
  5. 2014Deep metric learning using Triplet networkcited by 422
  6. 2017Dual-Path Convolutional Image-Text Embeddings with Instance Losscited by 145
  7. 2021Improving Video-Text Retrieval by Multi-Stream Corpus Alignment and Dual Softmax Losscited by 116
  8. 2022Hyperbolic Vision Transformers: Combining Improvements in Metric Learningcited by 111
  9. 2017Visual to Sound: Generating Natural Sound for Videos in the Wildcited by 98
  10. 2021CrossCLR: Cross-modal Contrastive Learning For Multi-modal Video Representationscited by 72
  11. 2019Hardness-Aware Deep Metric Learningcited by 55
  12. 2018HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systemscited by 47
10 more
  1. 2020Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learningcited by 27
  2. 2022HIER: Metric Learning Beyond Class Labels via Hierarchical Regularizationcited by 26
  3. 2021It Takes Two to Tango: Mixup for Deep Metric Learningcited by 23
  4. 2019Deep Triplet Neural Networks with Cluster-CCA for Audio-Visual Cross-modal Retrievalcited by 18
  5. 2019Audio-Visual Embedding for Cross-Modal MusicVideo Retrieval through Supervised Deep CCAcited by 16
  6. 2018Category-Based Deep CCA for Fine-Grained Venue Discovery from Multimodal Datacited by 9
  7. 2016CNN-based Patch Matching for Optical Flow with Thresholded Hinge Embedding Losscited by 7
  8. 2021Variational Autoencoder with CCA for Audio-Visual Cross-Modal Retrievalcited by 7
  9. 2023VideoAdviser: Video Knowledge Distillation for Multimodal Transfer Learningcited by 6
  10. 2023Two-Stage Triplet Loss Training with Curriculum Augmentation for Audio-Visual Retrievalcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 2.

4 papers.