You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
/// To create this trainer, use [FastTree](xref:Microsoft.ML.TreeExtensions.FastTree(Microsoft.ML.RankingCatalog.RankingTrainers,System.String,System.String,System.String,System.String,System.Int32,System.Int32,System.Int32,System.Double))
47
+
/// or [FastTree(Options)](xref:Microsoft.ML.TreeExtensions.FastTree(Microsoft.ML.RankingCatalog.RankingTrainers,Microsoft.ML.Trainers.FastTree.FastTreeRankingTrainer.Options)).
/// | Required NuGet in addition to Microsoft.ML | Microsoft.ML.FastTree |
58
+
///
59
+
/// ### Training Algorithm Details
60
+
/// FastTree is an efficient implementation of the [MART](https://arxiv.org/abs/1505.01866) gradient boosting algorithm.
61
+
/// Gradient boosting is a machine learning technique for regression problems.
62
+
/// It builds each regression tree in a step-wise fashion, using a predefined loss function to measure the error for each step and corrects for it in the next.
63
+
/// So this prediction model is actually an ensemble of weaker prediction models.In regression problems, boosting builds a series of such trees in a step-wise fashion and then selects the optimal tree using an arbitrary differentiable loss function.
64
+
///
65
+
/// MART learns an ensemble of regression trees, which is a decision tree with scalar values in its leaves.
66
+
/// A decision(or regression) tree is a binary tree-like flow chart, where at each interior node one decides which of the two child nodes to continue to based on one of the feature values from the input.
67
+
/// At each leaf node, a value is returned.In the interior nodes, the decision is based on the test 'x <= v' where x is the value of the feature in the input sample and v is one of the possible values of this feature.
68
+
/// The functions that can be produced by a regression tree are all the piece-wise constant functions.
69
+
///
70
+
/// The ensemble of trees is produced by computing, in each step, a regression tree that approximates the gradient of the loss function, and adding it to the previous tree with coefficients that minimize the loss of the new tree.
71
+
/// The output of the ensemble produced by MART on a given instance is the sum of the tree outputs.
72
+
/// In case of a binary classification problem, the output is converted to a probability by using some form of calibration.
73
+
/// In case of a regression problem, the output is the predicted value of the function.
74
+
/// In case of a ranking problem, the instances are ordered by the output value of the ensemble.
75
+
///
76
+
/// For more information see:
77
+
/// [Wikipedia: Gradient boosting (Gradient tree boosting)](https://en.wikipedia.org/wiki/Gradient_boosting#Gradient_tree_boosting).
78
+
/// [Greedy function approximation: A gradient boosting machine.](https://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.aos/1013203451)
Copy file name to clipboardExpand all lines: src/Microsoft.ML.FastTree/TreeTrainersCatalog.cs
+4-4
Original file line number
Diff line number
Diff line change
@@ -122,11 +122,11 @@ public static FastTreeBinaryTrainer FastTree(this BinaryClassificationCatalog.Bi
122
122
}
123
123
124
124
/// <summary>
125
-
/// Ranks a series of inputs based on their relevance, training a decision tree ranking model with the <see cref="FastTreeRankingTrainer"/>.
125
+
/// Creates a <see cref="FastTreeRankingTrainer"/>, which ranks a series of inputs based on their relevance and training a decision tree ranking model.
/// <param name="labelColumnName">The name of the label column.</param>
129
-
/// <param name="featureColumnName">The name of the feature column.</param>
128
+
/// <param name="labelColumnName">The name of the label column. The column data must be <see cref="System.Single"/>.</param>
129
+
/// <param name="featureColumnName">The name of the feature column. The column data must be a known-sized vector of <see cref="System.Single"/></param>
130
130
/// <param name="rowGroupColumnName">The name of the group column.</param>
131
131
/// <param name="exampleWeightColumnName">The name of the example weight column (optional).</param>
132
132
/// <param name="numberOfTrees">Total number of decision trees to create in the ensemble.</param>
@@ -156,7 +156,7 @@ public static FastTreeRankingTrainer FastTree(this RankingCatalog.RankingTrainer
156
156
}
157
157
158
158
/// <summary>
159
-
/// Ranks a series of inputs based on their relevance, training a decision tree ranking model with the <see cref="FastTreeRankingTrainer"/> and advanced options.
159
+
/// Creates a <see cref="FastTreeRankingTrainer"/>, which ranks a series of inputs based on their relevance and training a decision tree ranking model with advanced options.
0 commit comments