Ë
    l^(ht  ã                  ób   — d dl mZ d dlmZ d dlZd dlmZ d dlmZ ddlmZm	Z	  G d„ d	e«      Z
y)
é    )Úannotations)ÚIterableN)ÚTensor)ÚSentenceTransformeré   )ÚBatchHardTripletLossÚ$BatchHardTripletLossDistanceFunctionc                  ó`   ‡ — e Zd Zej                  f	 	 	 dˆ fd„Zdd„Zdd„Zedd„«       Z	ˆ xZ
S )	ÚBatchHardSoftMarginTripletLossc                ó@   •— t         ‰| �  |«       || _        || _        y)a¯  
        BatchHardSoftMarginTripletLoss takes a batch with (sentence, label) pairs and computes the loss for all possible, valid
        triplets, i.e., anchor and positive must have the same label, anchor and negative a different label. The labels
        must be integers, with same label indicating sentences from the same class. Your train dataset
        must contain at least 2 examples per label class. This soft-margin variant does not require setting a margin.

        Args:
            model: SentenceTransformer model
            distance_metric: Function that returns a distance between
                two embeddings. The class SiameseDistanceMetric contains
                pre-defined metrics that can be used.

        Definitions:
            :Easy triplets: Triplets which have a loss of 0 because
                ``distance(anchor, positive) + margin < distance(anchor, negative)``.
            :Hard triplets: Triplets where the negative is closer to the anchor than the positive, i.e.,
                ``distance(anchor, negative) < distance(anchor, positive)``.
            :Semi-hard triplets: Triplets where the negative is not closer to the anchor than the positive, but which
                still have a positive loss, i.e., ``distance(anchor, positive) < distance(anchor, negative) + margin``.

        References:
            * Source: https://github.com/NegatioN/OnlineMiningTripletLoss/blob/master/online_triplet_loss/losses.py
            * Paper: In Defense of the Triplet Loss for Person Re-Identification, https://arxiv.org/abs/1703.07737
            * Blog post: https://omoindrot.github.io/triplet-loss

        Requirements:
            1. Each sentence must be labeled with a class.
            2. Your dataset must contain at least 2 examples per labels class.
            3. Your dataset should contain hard positives and negatives.

        Inputs:
            +------------------+--------+
            | Texts            | Labels |
            +==================+========+
            | single sentences | class  |
            +------------------+--------+

        Recommendations:
            - Use ``BatchSamplers.GROUP_BY_LABEL`` (:class:`docs <sentence_transformers.training_args.BatchSamplers>`) to
              ensure that each batch contains 2+ examples per label class.

        Relations:
            * :class:`BatchHardTripletLoss` uses a user-specified margin, while this loss does not require setting a margin.

        Example:
            ::

                from sentence_transformers import SentenceTransformer, SentenceTransformerTrainer, losses
                from datasets import Dataset

                model = SentenceTransformer("microsoft/mpnet-base")
                # E.g. 0: sports, 1: economy, 2: politics
                train_dataset = Dataset.from_dict({
                    "sentence": [
                        "He played a great game.",
                        "The stock is up 20%",
                        "They won 2-1.",
                        "The last goal was amazing.",
                        "They all voted against the bill.",
                    ],
                    "label": [0, 1, 0, 0, 2],
                })
                loss = losses.BatchHardSoftMarginTripletLoss(model)

                trainer = SentenceTransformerTrainer(
                    model=model,
                    train_dataset=train_dataset,
                    loss=loss,
                )
                trainer.train()
        N)ÚsuperÚ__init__Úsentence_embedderÚdistance_metric)ÚselfÚmodelr   Ú	__class__s      €úy/var/www/skyplay_api_hub/venv/lib/python3.12/site-packages/sentence_transformers/losses/BatchHardSoftMarginTripletLoss.pyr   z'BatchHardSoftMarginTripletLoss.__init__   s#   ø€ ôT 	‰Ñ˜ÔØ!&ˆÔØ.ˆÕó    c                óT   — | j                  |d   «      d   }| j                  ||«      S )Nr   Úsentence_embedding)r   Ú#batch_hard_triplet_soft_margin_loss)r   Úsentence_featuresÚlabelsÚreps       r   Úforwardz&BatchHardSoftMarginTripletLoss.forward\   s1   € Ø×$Ñ$Ð%6°qÑ%9Ó:Ð;OÑPˆØ×7Ñ7¸ÀÓDÐDr   c                óÎ  — | j                  |«      }t        j                  |«      j                  «       }||z  }|j	                  dd¬«      \  }}t        j
                  |«      j                  «       }|j	                  dd¬«      \  }	}||	d|z
  z  z   }
|
j                  dd¬«      \  }}t        j                  t        j                  ||z
  «      «      }|j                  «       }|S )a6  Build the triplet loss over a batch of embeddings.
        For each anchor, we get the hardest positive and hardest negative to form a triplet.
        Args:
            labels: labels of the batch, of size (batch_size,)
            embeddings: tensor of shape (batch_size, embed_dim)
            squared: Boolean. If true, output is the pairwise squared euclidean distance matrix.
                     If false, output is the pairwise euclidean distance matrix.
        Returns:
            Label_Sentence_Triplet: scalar tensor containing the triplet loss
        r   T)Úkeepdimg      ð?)r   r   Ú get_anchor_positive_triplet_maskÚfloatÚmaxÚ get_anchor_negative_triplet_maskÚminÚtorchÚlog1pÚexpÚmean)r   r   Ú
embeddingsÚpairwise_distÚmask_anchor_positiveÚanchor_positive_distÚhardest_positive_distÚ_Úmask_anchor_negativeÚmax_anchor_negative_distÚanchor_negative_distÚhardest_negative_distÚtlÚtriplet_losss                 r   r   zBBatchHardSoftMarginTripletLoss.batch_hard_triplet_soft_margin_lossb   sú   € ð ×,Ñ,¨ZÓ8ˆô  4×TÑTÐU[Ó\×bÑbÓdÐð  4°mÑCÐð $8×#;Ñ#;¸AÀtÐ#;Ó#LÑ Ð˜qô  4×TÑTÐU[Ó\×bÑbÓdÐð '4×&7Ñ&7¸À4Ð&7Ó&HÑ#Ð  !Ø,Ð/GÈ3ÐQeÑKeÑ/fÑfÐð $8×#;Ñ#;¸AÀtÐ#;Ó#LÑ Ð˜qô
 �[‰[œŸ™Ð#8Ð;PÑ#PÓQÓRˆØ—w‘w“yˆàÐr   c                 ó   — y)Na  
@misc{hermans2017defense,
    title={In Defense of the Triplet Loss for Person Re-Identification},
    author={Alexander Hermans and Lucas Beyer and Bastian Leibe},
    year={2017},
    eprint={1703.07737},
    archivePrefix={arXiv},
    primaryClass={cs.CV}
}
© )r   s    r   Úcitationz'BatchHardSoftMarginTripletLoss.citation�   s   € ð	r   )r   r   ÚreturnÚNone)r   zIterable[dict[str, Tensor]]r   r   r7   r   )r   r   r(   r   r7   r   )r7   Ústr)Ú__name__Ú
__module__Ú__qualname__r	   Úeucledian_distancer   r   r   Úpropertyr6   Ú__classcell__)r   s   @r   r   r      sE   ø„ à:^×:qÑ:qðL/Ø(ðL/à	õL/ó\Eó)ðV ò
ó ô
r   r   )Ú
__future__r   Úcollections.abcr   r$   r   Ú)sentence_transformers.SentenceTransformerr   r   r	   r   r5   r   r   ú<module>rC      s&   ðÝ "å $ã Ý å Iç \ôKÐ%9õ Kr   