Home
last modified time | relevance | path

Searched refs:split_entry (Results 1 – 3 of 3) sorted by relevance

/external/tensorflow/tensorflow/core/kernels/boosted_trees/
Dtraining_ops.cc105 for (auto& split_entry : best_splits) { in Compute() local
106 const float gain = split_entry.second.gain; in Compute()
119 ensemble_resource->AddBucketizedSplitNode(current_tree, split_entry, in Compute()
311 for (auto& split_entry : best_splits) { in Compute() local
312 const float gain = split_entry.second.gain; in Compute()
313 const string split_type = split_entry.second.split_type; in Compute()
333 ensemble_resource->AddCategoricalSplitNode(current_tree, split_entry, in Compute()
338 ensemble_resource->AddBucketizedSplitNode(current_tree, split_entry, in Compute()
Dresources.cc282 const std::pair<int32, boosted_trees::SplitCandidate>& split_entry, in AddBucketizedSplitNode() argument
284 const auto candidate = split_entry.second; in AddBucketizedSplitNode()
285 auto* node = AddLeafNodes(tree_id, split_entry, logits_dimension, in AddBucketizedSplitNode()
307 const std::pair<int32, boosted_trees::SplitCandidate>& split_entry, in AddCategoricalSplitNode() argument
309 const auto candidate = split_entry.second; in AddCategoricalSplitNode()
310 auto* node = AddLeafNodes(tree_id, split_entry, logits_dimension, in AddCategoricalSplitNode()
322 const std::pair<int32, boosted_trees::SplitCandidate>& split_entry, in AddLeafNodes() argument
325 const auto node_id = split_entry.first; in AddLeafNodes()
326 const auto candidate = split_entry.second; in AddLeafNodes()
Dresources.h115 const std::pair<int32, boosted_trees::SplitCandidate>& split_entry,
121 const std::pair<int32, boosted_trees::SplitCandidate>& split_entry,
181 const std::pair<int32, boosted_trees::SplitCandidate>& split_entry,