mlsanityData to 14 Oct 2026

Globally Correlation-Aware Hard Negative Generation

arXiv 2411.13145 ↗First posted 20 Nov 2024cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

Hard negative generation aims to generate informative negative samples that help to determine the decision boundaries and thus facilitate advancing deep metric learning. Current works select pair/triplet samples, learn their correlations, and fuse them to generate hard negatives. However, these works merely consider the local correlations of selected samples, ignoring global sample correlations that would provide more significant information to generate more informative negatives. In this work, we propose a Globally Correlation-Aware Hard Negative Generation (GCA-HNG) framework, which first learns sample correlations from a global perspective and exploits these correlations to guide generating hardness-adaptive and diverse negatives. Specifically, this approach begins by constructing a structured graph to model sample correlations, where each node represents a specific sample and each edge represents the correlations between corresponding samples. Then, we introduce an iterative graph message propagation to propagate the messages of node and edge through the whole graph and thus learn the sample correlations globally. Finally, with the guidance of the learned global correlations, we propose a channel-adaptive manner to combine an anchor and multiple negatives for HNG. Compared to current methods, GCA-HNG allows perceiving sample correlations with numerous negatives from a global and comprehensive perspective and generates the negatives with better hardness and diversity. Extensive experiment results demonstrate that the proposed GCA-HNG is superior to related methods on four image retrieval benchmark datasets. Codes and trained models are available at urlhttps://github.com/PWenJay/GCA-HNG.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 44 of its 78 references that are in the map. First posted on arXiv 20 Nov 2024.

Builds on

44 of 78 references.

References · 44

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2017Graph Attention Networkscited by 8,923
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  4. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
  5. 2014Going Deeper with Convolutionscited by 4,241
  6. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
  7. 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 579
  8. 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
  9. 2019Multi-Label Image Recognition with Graph Convolutional Networkscited by 322
  10. 2020A Metric Learning Reality Checkcited by 321
  11. 2016Molecular Graph Convolutions: Moving Beyond Fingerprintscited by 238
  12. 2017No Fuss Distance Metric Learning using Proxiescited by 226
32 more
  1. 2020Proxy Anchor Loss for Deep Metric Learningcited by 195
  2. 2019SoftTriple Loss: Deep Metric Learning Without Triplet Samplingcited by 163
  3. 2017Deep Metric Learning with Angular Losscited by 107
  4. 2020ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysiscited by 107
  5. 2020Knowledge-Guided Multi-Label Few-Shot Learning for General Image Recognitioncited by 69
  6. 2019Improved Embeddings with Easy Positive Triplet Miningcited by 67
  7. 2019Multi-Label Classification with Label Graph Superimposingcited by 65
  8. 2019Hardness-Aware Deep Metric Learningcited by 55
  9. 2019Learning to Cluster Faces on an Affinity Graphcited by 50
  10. 2020Cross-Domain Facial Expression Recognition: A Unified Evaluation Benchmark and Adversarial Graph Learningcited by 46
  11. 2021Graph Sampling Based Deep Metric Learning for Generalizable Person Re-Identificationcited by 37
  12. 2020Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxiescited by 36
  13. 2023Disentangling Writer and Character Styles for Handwriting Generationcited by 35
  14. 2021Learning Intra-Batch Connections for Deep Metric Learningcited by 34
  15. 2022Non-isotropy Regularization for Proxy-based Deep Metric Learningcited by 33
  16. 2018Unsupervised Hard Example Mining from Videos for Improved Object Detectioncited by 30
  17. 2020Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learningcited by 27
  18. 2022HIER: Metric Learning Beyond Class Labels via Hierarchical Regularizationcited by 26
  19. 2021It Takes Two to Tango: Mixup for Deep Metric Learningcited by 23
  20. 2019The Group Loss for Deep Metric Learningcited by 20
  21. 2022Heterogeneous Semantic Transfer for Multi-label Recognition with Partial Labelscited by 19
  22. 2016Hard Negative Mining for Metric Learning Based Zero-Shot Classificationcited by 18
  23. 2021Hierarchical Proxy-based Loss for Deep Metric Learningcited by 18
  24. 2021Proxy Synthesis: Learning with Synthetic Classes for Deep Metric Learningcited by 17
  25. 2020Symmetrical Synthesis for Deep Metric Learningcited by 14
  26. 2024Dynamic Correlation Learning and Regularization for Multi-Label Confidence Calibrationcited by 13
  27. 2022Attributable Visual Similarity Learningcited by 12
  28. 2023Hierarchical Skeleton Meta-Prototype Contrastive Learning with Hard Skeleton Mining for Unsupervised Person Re-Identificationcited by 9
  29. 2019ACTNET: end-to-end learning of feature activations and multi-stream aggregation for effective instance image retrievalcited by 7
  30. 2022The Group Loss++: A deeper look into group loss for deep metric learningcited by 6
  31. 2022Denoising Multi-Similarity Formulation: A Self-paced Curriculum-Driven Approach for Robust Metric Learningcited by 3
  32. 2021Construct Informative Triplet with Two-stage Hard-sample Generationcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.