File tree 1 file changed +0
-4
lines changed
src/poli_baselines/solvers/bayesian_optimization/lambo2
1 file changed +0
-4
lines changed Original file line number Diff line number Diff line change @@ -278,8 +278,6 @@ def _train_model_with_history(
278
278
279
279
def get_candidate_points (self ):
280
280
if self .restrict_candidate_points_to is not None :
281
- # TODO: make sure the array is of self.cfg.num_samples size.
282
- # TODO: THey need to be in the "A A A A" format that lambo expects.
283
281
# Let's assume that the user passes a wildtype as
284
282
# np.array(["AAAAA"]) or np.array(["A", "A", "A", ...]).
285
283
assert len (self .restrict_candidate_points_to .shape ) == 1
@@ -316,8 +314,6 @@ def get_candidate_points_from_history(self) -> np.ndarray:
316
314
sorted_y0_idxs = np .argsort (y .flatten ())[::- 1 ]
317
315
candidate_points = x [sorted_y0_idxs [: min (len (x ), 2 * self .cfg .num_samples )]]
318
316
candidate_scores = y [sorted_y0_idxs [: min (len (x ), 2 * self .cfg .num_samples )]]
319
- # candidate_points = x[sorted_y0_idxs[: max(len(x) // 2, self.cfg.num_samples)]]
320
- # candidate_scores = y[sorted_y0_idxs[: max(len(x) // 2, self.cfg.num_samples)]]
321
317
322
318
indices = farthest_first_traversal (
323
319
library = candidate_points ,
You can’t perform that action at this time.
0 commit comments