-
Notifications
You must be signed in to change notification settings - Fork 3.8k
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.
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
improve subfeature_bynode #3384
Conversation
@@ -702,9 +702,6 @@ void SerialTreeLearner::ComputeBestSplitForFeature( | |||
FeatureHistogram* histogram_array_, int feature_index, int real_fidx, | |||
bool is_feature_used, int num_data, const LeafSplits* leaf_splits, | |||
SplitInfo* best_split) { | |||
if (!is_feature_used) { | |||
return; | |||
} | |||
SplitInfo new_split; | |||
double parent_output; | |||
if (leaf_splits->leaf_index() == 0) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@btrotta it seems the parent output is calculated repeatedly here for root node. I think this cost could be reduced.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Ok, I'll take a look
This pull request has been automatically locked since there has not been any recent activity since it was closed. To start a new related discussion, open a new issue at https://github.com/microsoft/LightGBM/issues including a reference to this. |
this is useful to filter the histogram that cannot split.