I am running an HP grid search with
Tune trying to optimize
F(a, b, c).
The thing is that
F is an aggregation of N runs of another function
G(a, b, c, K) for
K in some list
L. So I need first to compute all the values of
I tried to run the for loop in parallel using p_tqdm but ran into multiprocessing and pool issues… So for now, I worked around by not doing parallelization.
Would you advise a particular solution for parallelization of “sub-functions” when using
Thank you ! Tune and Ray are really amazing!