Searched refs:best_gain (Results 1 – 3 of 3) sorted by relevance
253 float best_gain = std::numeric_limits<float>::lowest(); in ComputeNormalDecisionTree() local277 if (left_stats.gain + right_stats.gain > best_gain) { in ComputeNormalDecisionTree()278 best_gain = left_stats.gain + right_stats.gain; in ComputeNormalDecisionTree()298 best_gain - root_stats.gain - state->tree_complexity_regularization(); in ComputeNormalDecisionTree()328 float best_gain = std::numeric_limits<float>::lowest(); in ComputeObliviousDecisionTree() local381 if (gain_of_split > best_gain) { in ComputeObliviousDecisionTree()382 best_gain = gain_of_split; in ComputeObliviousDecisionTree()391 best_gain -= state->ComputeNodeStats(current_layer_stats[root_idx]).gain; in ComputeObliviousDecisionTree()393 best_gain -= num_elements * state->tree_complexity_regularization(); in ComputeObliviousDecisionTree()401 (*gains)(0) = best_gain; in ComputeObliviousDecisionTree()[all …]
114 float best_gain = std::numeric_limits<float>::lowest(); in Compute() local139 if (GainIsLarger(gain_for_left + gain_for_right, best_gain)) { in Compute()140 best_gain = gain_for_left + gain_for_right; in Compute()148 output_gains.push_back(best_gain - parent_gain); in Compute()
462 best_gain = 0486 best_gain = combined_gain - separate_gain