divergent-beamsearch 0.1.7__tar.gz → 0.1.8__tar.gz

{divergent_beamsearch-0.1.7 → divergent_beamsearch-0.1.8}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: divergent-beamsearch
-Version: 0.1.7
+Version: 0.1.8
 Summary: A variant of the beam search algorithm that focuses on finding answers that maximize the probability of generating an answer before diverging into another subject.
 License-File: LICENCE
 Requires-Python: >=3.11

{divergent_beamsearch-0.1.7 → divergent_beamsearch-0.1.8}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "divergent-beamsearch"
-version = "0.1.7"
+version = "0.1.8"
 description = "A variant of the beam search algorithm that focuses on finding answers that maximize the probability of generating an answer before diverging into another subject."
 readme = "README.md"
 requires-python = ">=3.11"

{divergent_beamsearch-0.1.7 → divergent_beamsearch-0.1.8}/src/divergent_beamsearch/algorithm.py

@@ -82,6 +82,14 @@ def index_reduce_lists(x : torch.Tensor, indices : list[list[int]], reduce_func=
         values.append(reduce_func(x[i, index], dim=-1))
     return torch.tensor(values, dtype=x.dtype, device=x.device, requires_grad=x.requires_grad)
 
+def pad_to_same_size(tensors : list[torch.Tensor], padding_value : int) -> torch.Tensor:
+    max_size = max(x.shape[-1] for x in tensors)
+    padded_tensors = []
+    for tensor in tensors:
+        pad = torch.full((tensor.shape[0], max_size - tensor.shape[1]), padding_value, dtype=torch.long)
+        padded_tensors.append(torch.cat([tensor, pad], dim=-1))
+    return torch.cat(padded_tensors, dim=0)
+
 @torch.no_grad()
 def divergent_beamsearch(input_ids : torch.Tensor, model : GPT2LMHeadModel, beam_size : int, max_length : int, parser : Parser, pad_token_id : int, batch_size=32, num_solutions = None, end_symb=DEFAULT_END_SYMB) -> tuple[torch.Tensor, torch.Tensor]:
     assert input_ids.shape[0] == 1, "Batch size must be 1"
@@ -130,8 +138,11 @@ def divergent_beamsearch(input_ids : torch.Tensor, model : GPT2LMHeadModel, beam
         scores_finished_current = scores_finished_current + log1mexp(logprob_other_ans)
         scores_finished = torch.cat([scores_finished, scores_finished_current])
         if len(solutions_finished_current):
-            pad = torch.full((len(scores_finished_current), solutions_finished_current.shape[1] - solutions_finished.shape[1]), pad_token_id, dtype=torch.long)
-            solutions_finished = torch.cat([solutions_finished.view(-1, solutions_finished_current.shape[1]+pad.shape[1]), torch.cat([solutions_finished_current, pad], dim=1)], dim=0)
+            if len(solutions_finished):
+                solutions_finished = pad_to_same_size([solutions_finished, solutions_finished_current], 
+                                                                    padding_value=pad_token_id)
+            else:
+                solutions_finished = solutions_finished_current
         if solutions_finished.numel():
             # Keep num_solutions best solutions in finished
             order = scores_finished.argsort(descending=True)

{divergent_beamsearch-0.1.7 → divergent_beamsearch-0.1.8}/tests/test_beamsearch.py

@@ -44,11 +44,11 @@ def test_divergent_beamsearch(model_and_tokenizer, device, end_symb):
     model.to(device)
     prompt = "The capital of France is"
     input_ids = tokenizer.encode(prompt, return_tensors="pt").to(device)
-    beam_size = 5
+    beam_size = 10
     max_length = 10
     pad_token_id = tokenizer.eos_token_id
 
-    possible_answers = [' Paris', ' Madrid', ' Paris Hilton']
+    possible_answers = [' Paris', ' Madrid', ' Paris Hilton', ' Bri bra brouuu Mario Brooos']
     tokenized_answers = tokenizer(possible_answers).input_ids
 
     if end_symb == 'tokenizer':
@@ -62,6 +62,9 @@ def test_divergent_beamsearch(model_and_tokenizer, device, end_symb):
         logprob_paris_hilton = logprob_paris + logprob_hilton
         logprob_madrid = model(input_ids).logits.cpu().log_softmax(dim=-1)[0, -1, tokenized_answers[1][0]]
         logprob_paris_diverge = logprob_paris + log1mexp(logprob_hilton)
+        input_garbage = torch.tensor(input_ids.tolist()[0] + tokenized_answers[-1]).unsqueeze(0).to(device)
+        logsoftmax_garbage = model(input_garbage).logits.log_softmax(-1)
+        logprob_garbage = torch.gather(logsoftmax_garbage[:, 4:-1, :], 2, input_garbage[:, 5:, None]).squeeze(-1).sum(-1)
 
     scores, solutions = divergent_beamsearch(
         input_ids=input_ids,
@@ -70,7 +73,7 @@ def test_divergent_beamsearch(model_and_tokenizer, device, end_symb):
         max_length=max_length,
         parser=multi_choices_parser,
         pad_token_id=pad_token_id,
-        num_solutions=10,
+        num_solutions=beam_size,
         end_symb=end_symb
     )
     true_solutions = torch.nn.utils.rnn.pad_sequence([torch.tensor(ans) for ans in tokenized_answers], batch_first=True, padding_value=pad_token_id)
@@ -78,6 +81,7 @@ def test_divergent_beamsearch(model_and_tokenizer, device, end_symb):
     assert torch.isclose(scores[0], logprob_paris_diverge), "Beam search did not return the expected score"
     assert torch.isclose(scores[1], logprob_madrid), "Beam search did not return the expected score"
     assert torch.isclose(scores[2], logprob_paris_hilton), "Beam search did not return the expected score"
+    assert torch.isclose(scores[3], logprob_garbage), "Beam search did not return the expected score"
 
 
 @pytest.mark.parametrize("device", ['cpu', 'cuda'])