2 writes to Partitioning
Microsoft.ML.FastTree (2)
FastTree.cs (1)
664
OptimizationAlgorithm.TreeLearner.
Partitioning
=
Training\TreeLearners\TreeLearner.cs (1)
21
Partitioning
= new DocumentPartitioning(TrainData.NumDocs, numLeaves);
13 references to Partitioning
Microsoft.ML.FastTree (13)
Training\OptimizationAlgorithms\AcceleratedGradientDescent.cs (1)
45
trainingScores.AddScores(tree, TreeLearner.
Partitioning
, 1.0);
Training\OptimizationAlgorithms\GradientDescent.cs (2)
116
AdjustTreeOutputsOverride.AdjustTreeOutputs(ch, tree, TreeLearner.
Partitioning
, TrainingScores);
118
(ObjectiveFunction as IStepSearch).AdjustTreeOutputs(ch, tree, TreeLearner.
Partitioning
, TrainingScores);
Training\OptimizationAlgorithms\OptimizationAlgorithm.cs (2)
78
t.AddScores(tree, TreeLearner.
Partitioning
, 1.0);
110
var regularizer = new RecursiveRegressionTree(tree, TreeLearner.
Partitioning
, 0);
Training\TreeLearners\FastForestLeastSquaresTreeLearner.cs (1)
38
tree.SetLabelsDistribution(
Partitioning
.GetDistribution(
Training\TreeLearners\LeastSquaresRegressionTreeLearner.cs (7)
262
FindBestSplitOfSiblings(lteChild, gtChild,
Partitioning
, targets);
314
Partitioning
.Split(bestLeaf, (TrainData.Flocks[bestSplitInfo.Flock] as OneHotFeatureFlock)?.Bins, CategoricalThresholds, gtChild);
317
Partitioning
.Split(bestLeaf, TrainData.GetIndexer(bestSplitInfo.Feature), bestSplitInfo.Threshold, gtChild);
320
Contracts.Assert(bestSplitInfo.GTCount < 0 ||
Partitioning
.NumDocsInLeaf(gtChild) == bestSplitInfo.GTCount
332
Partitioning
.Initialize();
355
if (
Partitioning
.NumDocs == TrainData.NumDocs)
361
SmallerChildSplitCandidates.Initialize(0,
Partitioning
, targets, GetTargetWeights(), FilterZeros);