The Dilemma of TriHard Loss and an Element-Weighted TriHard Loss for Person Re-Identification

2020-12-01 · NeurIPS 2020 12 · Yihao Lv, Youzhi Gu, Liu Xinggao

Triplet loss with batch hard mining (TriHard loss) is an important variation of triplet loss inspired by the idea that hard triplets improve the performance of metric leaning networks. However, there is a dilemma in the training process. The hard negative samples contain various quite similar characteristics compared with anchors and positive samples in a batch. Features of these characteristics should be clustered between anchors and positive samples while are also utilized to repel between anchors and hard negative samples. It is harmful for learning mutual features within classes. Several methods to alleviate the dilemma are designed and tested. In the meanwhile, an element-weighted TriHard loss is emphatically proposed to enlarge the distance between partial elements of feature vectors selectively which represent the different characteristics between anchors and hard negative samples. Extensive evaluations are conducted on Market1501 and MSMT17 datasets and the results achieve state-of-the-art on public baselines.

📄 PDF Abstract BibTeX

Code (1)

LvWilliam/EWTH_Loss 공식 구현 pytorch

Tasks

Person Re-IdentificationTriplet

Methods 이 논문이 사용한 방법론

Triplet Loss The goal of Triplet loss, in the context of Siamese Networks, is to maximize the joint probability among all score-pairs i.e. the product of all probabilities. By using its…

MMFL-Net: Multi-scale and Multi-granularity Feature Learning for Cross-domain Fashion Retrieval

2022-10-27 · Chen Bao, Xudong Zhang, Jiazhou Chen, Yongwei Miao

Instance-level image retrieval in fashion is a challenging issue owing to its increasing importance in real-scenario visual fashion search. Cross-domain fashion retrieval aims to match the unconstrained customer images a…

Attribute Image Retrieval Retrieval

Weighted Clustering

2011-09-08 · Margareta Ackerman, Shai Ben-David, Simina Brânzei, David Loker

One of the most prominent challenges in clustering is "the user's dilemma," which is the problem of selecting an appropriate clustering algorithm for a specific task. A formal approach for addressing this problem relies …

Clustering

Inducing Cooperative behaviour in Sequential-Social dilemmas through Multi-Agent Reinforcement Learning using Status-Quo Loss

2020-01-15 · Pinkesh Badjatiya, Mausoom Sarkar, Abhishek Sinha, Siddharth Singh 외

In social dilemma situations, individual rationality leads to sub-optimal group outcomes. Several human engagements can be modeled as a sequential (multi-step) social dilemmas. However, in contrast to humans, Deep Reinfo…

Clustering Deep Reinforcement Learning Multi-agent Reinforcement Learning Reinforcement Learning

A Further Analysis of The Role of Heterogeneity in Coevolutionary Spatial Games

2017-11-09 · Marcos Cardinot, Josephine Griffith, Colm O'Riordan

Heterogeneity has been studied as one of the most common explanations of the puzzle of cooperation in social dilemmas. A large number of papers have been published discussing the effects of increasing heterogeneity in st…

Multi-agent Reinforcement Learning in Sequential Social Dilemmas

2017-02-10 · Joel Z. Leibo, Vinicius Zambaldi, Marc Lanctot, Janusz Marecki 외

Matrix games like Prisoner's Dilemma have guided research on social dilemmas for decades. However, they necessarily treat the choice to cooperate or defect as an atomic action. In real-world social dilemmas these choices…

Multi-agent Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)