Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2603.26389 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914426695712768 |
|---|---|
| author | Tomchak, Roberto Sprengel Minozzo Marques, Oge Pedroso, Lucas Garcia Oliveira, Luiz Eduardo de Almeida, Paulo Lisboa |
| author_facet | Tomchak, Roberto Sprengel Minozzo Marques, Oge Pedroso, Lucas Garcia Oliveira, Luiz Eduardo de Almeida, Paulo Lisboa |
| contents | The Triplet Margin Ranking Loss is one of the most widely used loss functions in Siamese Networks for solving Distance Metric Learning (DML) problems. This loss function depends on a margin parameter μ, which defines the minimum distance that should separate positive and negative pairs during training. In this work, we show that, during training, the effective margin of many triplets often exceeds the predefined value of μ, provided that a sufficient number of triplets violating this margin is observed. This behavior indicates that fixing the margin throughout training may limit the learning process. Based on this observation, we propose a margin scheduler that adjusts the value of μ according to the proportion of easy triplets observed at each epoch, with the goal of maintaining training difficulty over time. We show that the proposed strategy leads to improved performance when compared to both a constant margin and a monotonically increasing margin scheme. Experimental results on four different datasets show consistent gains in verification performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_26389 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Maintaining Difficulty: A Margin Scheduler for Triplet Loss in Siamese Networks Training Tomchak, Roberto Sprengel Minozzo Marques, Oge Pedroso, Lucas Garcia Oliveira, Luiz Eduardo de Almeida, Paulo Lisboa Machine Learning The Triplet Margin Ranking Loss is one of the most widely used loss functions in Siamese Networks for solving Distance Metric Learning (DML) problems. This loss function depends on a margin parameter μ, which defines the minimum distance that should separate positive and negative pairs during training. In this work, we show that, during training, the effective margin of many triplets often exceeds the predefined value of μ, provided that a sufficient number of triplets violating this margin is observed. This behavior indicates that fixing the margin throughout training may limit the learning process. Based on this observation, we propose a margin scheduler that adjusts the value of μ according to the proportion of easy triplets observed at each epoch, with the goal of maintaining training difficulty over time. We show that the proposed strategy leads to improved performance when compared to both a constant margin and a monotonically increasing margin scheme. Experimental results on four different datasets show consistent gains in verification performance. |
| title | Maintaining Difficulty: A Margin Scheduler for Triplet Loss in Siamese Networks Training |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2603.26389 |