Lines Matching refs:epoch
388 for (int epoch = 0; epoch < nPasses; ++epoch) { in graph_teach() local
389 global_i = epoch; in graph_teach()
392 next_j = (epoch + 1) % in.size(); in graph_teach()
394 if (epoch < speculation_start) { in graph_teach()
395 (send_to[epoch % SPECULATION_CNT])->try_put(in[j]); in graph_teach()
397 else if (epoch == speculation_start) { in graph_teach()
398 (send_to[epoch % SPECULATION_CNT])->try_put(in[j]); in graph_teach()
399 if (epoch < nPasses - 1) { in graph_teach()
400 (send_to[(epoch + 1) % SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
403 else if (epoch < nPasses - 1) { in graph_teach()
404 (send_to[(epoch + 1) % SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
406 min_sr = graph_BMU(epoch % SPECULATION_CNT); //calls wait_for_all() in graph_teach()
408 double radius = max_radius * exp(-(double)epoch * radius_decay_rate); in graph_teach()
409 double learning_rate = max_learning_rate * exp(-(double)epoch * learning_decay_rate); in graph_teach()
410 if (epoch >= speculation_start && epoch < (nPasses - 1)) { in graph_teach()
413 std::get<XV>(min_sr), std::get<YV>(min_sr), radius, (epoch + 1) % SPECULATION_CNT); in graph_teach()
417 in[j], epoch, std::get<1>(min_sr), std::get<2>(min_sr), radius, learning_rate); in graph_teach()
422 wait_for_all_graphs((epoch + 1) % SPECULATION_CNT); // wait for the array of subgraphs in graph_teach()
426 (epoch + 1) % SPECULATION_CNT, in graph_teach()