Summary: 52 instances, 50 unique

Text	Count
)  # TODO verify	1
# TODO the upper bounds are really not well set for this experiment with cigar	1
# TODO: this is first order, in practice we would need to test all the different	1
# This is the real of population control. FIXME: should we pair with a bandit ?	1
"""  # TODO improve description of methods	2
# TODO: refactor?	1
def vdc(self, n: int, permut: tp.List[int]) -> float:  # TODO speed up?	1
self.llambda = max(num_workers, 40)  # FIXME: no good heuristic ?	1
for fp in self.folder.glob("**/*"):  # TODO filter out all hidden files (+ build files?)	1
# TODO: check actual covariance that should be used	1
print(f"After {optimizer.num_tell}, recommendation is {x}")  # TODO fetch value	1
# TODO this is nearly useless now that the layer system has been added. Remove?	1
# for k, subcase in enumerate(subcases):  # TODO linearize this (precompute all subcases)? requires memory	1
# r = A[len(A) - 1][0, 0]  # TODO: unused	1
# TODO: We should spend first 10-20 iterations	1
# TODO May be safer to use a default variance which depends on y for scale invariance?	1
# TODO find a way to avoid exec	1
# hack since scale is not defined before the first hack (TODO: refactor)	1
ChainCMAPowell.no_parallelization = True  # TODO make this automatic	1
# )  # TODO activate when ready	1
# propagate other useful information # TODO a bit hacky	1
self._rank_method: tp.Any = None  # TODO better typing (eventually)	1
# FIXME: an adaptive opponent, e.g. bandit, would be better.	1
)  # TODO not sure why this is needed	1
# TODO remove the next line when all compatibility is done	1
# TODO: We should chose a to be inversely proportional to	1
)  # bypass the parametrization one (because of the "hashing" case)  # TODO: remove	1
# TODO make the following command more robust (probably fails in multiple cases)	1
# TODO: this can be made more efficient (fewer copy) if need be.	1
# TODO descriptors for the evaluation function?	1
# TODO: not sure why it would work with lists tough, investigate the ignored typing	1
# TODO: add the proxy info in the parametrization.	2
# TODO: this may not scale well with dimension	1
# TODO: because of the return whenever constraints are satisfied, the first case never arises	1
# # TODO investigate why this synchronization is needed	1
# TODO remove if not planned to be used	1
# TODO deprecate this method	1
def descriptors(self) -> utils.DeprecatedDescriptors:  # TODO remove	1
# TODO: refactor, this is not more used for parametrization, so using the	1
self.hydro_prod_per_time_step: tp.List[tp.Any] = []  # TODO @oteytaud initial values?	1
), "Iterable does not work if budget is not specified"  # TODO make it work	1
# TODO add crossover params in args + criterion	1
self.output: tp.Optional[tp.Any] = None  # TODO add a "done" attribute ?	1
"""  # TODO this is currenlty very messy, may need some improvement	1
):  # TODO: custom extensions are handled as python	1
class RavelCrossover(Crossover):  # TODO: can be made for all parameters instead of just arrays	1
tests = [data.copy() for _ in range(2)]  # TODO make it simpler and more efficient?	1
data: np.ndarray = np.zeros((50, 2))  # TODO: why?	1
# TODO: is a sigma necessary here as well? given the covariance is estimated	1
# TODO the following is probably not good at all:	1