Total Complexity | 2 |
Total Lines | 18 |
Duplicated Lines | 0 % |
Changes | 0 |
1 | import numpy as np |
||
2 | |||
3 | |||
4 | def get_score(para): |
||
5 | return -(para["x1"] * para["x1"]) |
||
6 | |||
7 | |||
8 | search_space = { |
||
9 | "x1": np.arange(-100, 100, 1), |
||
10 | } |
||
11 | |||
12 | |||
13 | def _base_test( |
||
14 | opt_class, n_iter, get_score=get_score, search_space=search_space, opt_para={}, |
||
15 | ): |
||
16 | opt = opt_class(search_space, **opt_para) |
||
17 | opt.search(get_score, n_iter=n_iter) |
||
18 | |||
19 |