arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.14003cs.CV
收藏

再论嵌入记忆的深度对比学习

Rethinking Deep Contrastive Learning with Embedding Memory

Malong Technologies(旷龙科技)

Haozhi Zhang, Xun Wang, Weilin Huang, Matthew R. Scott

摘要:

成对损失函数已被广泛研究,并被证明可持续提高深度度量学习(DML)的性能。然而,它们主要是基于简单的玩具示例的直觉设计的,并且在复杂的现实世界情况下很难通过实验来识别真正有效的设计。在本文中,我们提供了一个新的方法,系统地研究各种成对损失函数的加权策略,并重新考虑与嵌入记忆对加权。我们通过分解成对函数深入研究了加权机制,并使用直接权重分配分别研究了正权重和负权重。这使我们能够通过权重曲线深入系统地研究各种权重函数,并确定一些有意义的,全面的和有见地的事实,这是我们对基于内存的DML的关键观察:挖掘硬否定并丢弃信息量较少和冗余的简单否定是至关重要的,但对正对的加权没有帮助。这导致有效但令人惊讶地简单的规则来设计加权方案,使其显著不同于现有的基于小批量的方法,现有的基于小批量的方法设计各种复杂的损失函数来仔细地加权对。最后,我们进行了广泛的实验上的三个大规模的视觉检索基准,并证明了基于内存的DML的优越性,最近的小批量为基础的方法,通过使用一个简单的对比损失与动量更新的内存。

英文摘要:

Pair-wise loss functions have been extensively studied and shown to continuously improve the performance of deep metric learning (DML). However, they are primarily designed with intuition based on simple toy examples, and experimentally identifying the truly effective design is difficult in complicated, real-world cases. In this paper, we provide a new methodology for systematically studying weighting strategies of various pair-wise loss functions, and rethink pair weighting with an embedding memory. We delve into the weighting mechanisms by decomposing the pair-wise functions, and study positive and negative weights separately using direct weight assignment. This allows us to study various weighting functions deeply and systematically via weight curves, and identify a number of meaningful, comprehensive and insightful facts, which come up with our key observation on memory-based DML: it is critical to mine hard negatives and discard easy negatives which are less informative and redundant, but weighting on positive pairs is not helpful. This results in an efficient but surprisingly simple rule to design the weighting scheme, making it significantly different from existing mini-batch based methods which design various sophisticated loss functions to weight pairs carefully. Finally, we conduct extensive experiments on three large-scale visual retrieval benchmarks, and demonstrate the superiority of memory-based DML over recent mini-batch based approaches, by using a simple contrastive loss with momentum-updated memory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑