Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix program stop when split data count equals zero #5087

Closed
wants to merge 6 commits into from
Closed

Fix program stop when split data count equals zero #5087

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
a915259
Fix program stop when split data count equals zero
GinkoBalboa Mar 21, 2022
4b925e1
Added random seed seq that produces error (w/o patch)
GinkoBalboa Mar 21, 2022
de9f508
Removed test for gpu
GinkoBalboa Mar 21, 2022
080f02b
Correct linting python errors
GinkoBalboa Mar 21, 2022
e5d7b5b
Fix some c++ linting errors
GinkoBalboa Mar 21, 2022
8737b85
Correct condition for num_machines
GinkoBalboa Mar 22, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 6 additions & 3 deletions src/treelearner/serial_tree_learner.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -683,7 +683,8 @@ void SerialTreeLearner::SplitInner(Tree* tree, int best_leaf, int* left_leaf,

// init the leaves that used on next iteration
if (best_split_info.left_count < best_split_info.right_count) {
CHECK_GT(best_split_info.left_count, 0);
if (best_split_info.left_count == 0)
Log::Warning("Best split left count is 0 for leaf %d", *left_leaf);
smaller_leaf_splits_->Init(*left_leaf, data_partition_.get(),
best_split_info.left_sum_gradient,
best_split_info.left_sum_hessian,
Expand All @@ -693,7 +694,8 @@ void SerialTreeLearner::SplitInner(Tree* tree, int best_leaf, int* left_leaf,
best_split_info.right_sum_hessian,
best_split_info.right_output);
} else {
CHECK_GT(best_split_info.right_count, 0);
if(best_split_info.right_count == 0)
Log::Warning("Best split right count is 0 for leaf %d", *right_leaf);
smaller_leaf_splits_->Init(*right_leaf, data_partition_.get(),
best_split_info.right_sum_gradient,
best_split_info.right_sum_hessian,
Expand Down Expand Up @@ -735,7 +737,8 @@ void SerialTreeLearner::RenewTreeOutput(Tree* tree, const ObjectiveFunction* obj
const double new_output = obj->RenewTreeOutput(output, residual_getter, index_mapper, bag_mapper, cnt_leaf_data);
tree->SetLeafOutput(i, new_output);
} else {
CHECK_GT(num_machines, 1);
if (num_machines > 1)
Log::Warning("num_machines greater than 1 for leaf %d, num_machines is %d", i, num_machines);
tree->SetLeafOutput(i, 0.0);
n_nozeroworker_perleaf[i] = 0;
}
Expand Down
Loading