update vis
This commit is contained in:
@@ -174,7 +174,7 @@ def main(xargs, nas_bench):
|
||||
|
||||
id2config = results.get_id2config_mapping()
|
||||
incumbent = results.get_incumbent_id()
|
||||
logger.log('Best found configuration: {:}'.format(id2config[incumbent]['config']))
|
||||
logger.log('Best found configuration: {:} within {:.3f} s'.format(id2config[incumbent]['config'], real_cost_time))
|
||||
best_arch = config2structure( id2config[incumbent]['config'] )
|
||||
|
||||
info = nas_bench.query_by_arch( best_arch )
|
||||
|
@@ -56,6 +56,7 @@ def main(xargs, nas_bench):
|
||||
search_space = get_search_spaces('cell', xargs.search_space_name)
|
||||
random_arch = random_architecture_func(xargs.max_nodes, search_space)
|
||||
#x =random_arch() ; y = mutate_arch(x)
|
||||
x_start_time = time.time()
|
||||
logger.log('{:} use nas_bench : {:}'.format(time_string(), nas_bench))
|
||||
best_arch, best_acc, total_time_cost, history = None, -1, 0, []
|
||||
#for idx in range(xargs.random_num):
|
||||
@@ -68,7 +69,7 @@ def main(xargs, nas_bench):
|
||||
if best_arch is None or best_acc < accuracy:
|
||||
best_acc, best_arch = accuracy, arch
|
||||
logger.log('[{:03d}] : {:} : accuracy = {:.2f}%'.format(len(history), arch, accuracy))
|
||||
logger.log('{:} best arch is {:}, accuracy = {:.2f}%, visit {:} archs with {:.1f} s.'.format(time_string(), best_arch, best_acc, len(history), total_time_cost))
|
||||
logger.log('{:} best arch is {:}, accuracy = {:.2f}%, visit {:} archs with {:.1f} s (real-cost = {:.3f} s).'.format(time_string(), best_arch, best_acc, len(history), total_time_cost, time.time()-x_start_time))
|
||||
|
||||
info = nas_bench.query_by_arch( best_arch )
|
||||
if info is None: logger.log('Did not find this architecture : {:}.'.format(best_arch))
|
||||
|
@@ -201,10 +201,11 @@ def main(xargs, nas_bench):
|
||||
random_arch = random_architecture_func(xargs.max_nodes, search_space)
|
||||
mutate_arch = mutate_arch_func(search_space)
|
||||
#x =random_arch() ; y = mutate_arch(x)
|
||||
x_start_time = time.time()
|
||||
logger.log('{:} use nas_bench : {:}'.format(time_string(), nas_bench))
|
||||
logger.log('-'*30 + ' start searching with the time budget of {:} s'.format(xargs.time_budget))
|
||||
history, total_cost = regularized_evolution(xargs.ea_cycles, xargs.ea_population, xargs.ea_sample_size, xargs.time_budget, random_arch, mutate_arch, nas_bench if args.ea_fast_by_api else None, extra_info)
|
||||
logger.log('{:} regularized_evolution finish with history of {:} arch with {:.1f} s.'.format(time_string(), len(history), total_cost))
|
||||
logger.log('{:} regularized_evolution finish with history of {:} arch with {:.1f} s (real-cost={:.2f} s).'.format(time_string(), len(history), total_cost, time.time()-x_start_time))
|
||||
best_arch = max(history, key=lambda i: i.accuracy)
|
||||
best_arch = best_arch.arch
|
||||
logger.log('{:} best arch is {:}'.format(time_string(), best_arch))
|
||||
|
@@ -139,6 +139,7 @@ def main(xargs, nas_bench):
|
||||
|
||||
# REINFORCE
|
||||
# attempts = 0
|
||||
x_start_time = time.time()
|
||||
logger.log('Will start searching with time budget of {:} s.'.format(xargs.time_budget))
|
||||
total_steps, total_costs = 0, 0
|
||||
#for istep in range(xargs.RL_steps):
|
||||
@@ -166,7 +167,7 @@ def main(xargs, nas_bench):
|
||||
#logger.log('')
|
||||
|
||||
best_arch = policy.genotype()
|
||||
logger.log('REINFORCE finish with {:} steps and {:.1f} s.'.format(total_steps, total_costs))
|
||||
logger.log('REINFORCE finish with {:} steps and {:.1f} s (real cost={:.3f}).'.format(total_steps, total_costs, time.time()-x_start_time))
|
||||
info = nas_bench.query_by_arch( best_arch )
|
||||
if info is None: logger.log('Did not find this architecture : {:}.'.format(best_arch))
|
||||
else : logger.log('{:}'.format(info))
|
||||
|
Reference in New Issue
Block a user