gbdt_prediction.cpp 3.02 KB
Newer Older
1
2
3
4
#include "gbdt.h"

#include <LightGBM/utils/openmp_wrapper.h>
#include <LightGBM/objective_function.h>
cbecker's avatar
cbecker committed
5
#include <LightGBM/prediction_early_stop.h>
6
7
8

namespace LightGBM {

9
10
void GBDT::PredictRaw(const double* features, double* output, const PredictionEarlyStopInstance* early_stop) const {
  int early_stop_round_counter = 0;
11
12
  // set zero
  std::memset(output, 0, sizeof(double) * num_tree_per_iteration_);
cbecker's avatar
cbecker committed
13
14
  for (int i = 0; i < num_iteration_for_pred_; ++i) {
    // predict all the trees for one iteration
15
    for (int k = 0; k < num_tree_per_iteration_; ++k) {
cbecker's avatar
cbecker committed
16
      output[k] += models_[i * num_tree_per_iteration_ + k]->Predict(features);
17
    }
cbecker's avatar
cbecker committed
18
    // check early stopping
19
20
21
    ++early_stop_round_counter;
    if (early_stop->round_period == early_stop_round_counter) {
      if (early_stop->callback_function(output, num_tree_per_iteration_)) {
cbecker's avatar
cbecker committed
22
        return;
23
      }
24
      early_stop_round_counter = 0;
25
26
    }
  }
cbecker's avatar
cbecker committed
27
28
}

29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
void GBDT::PredictRawByMap(const std::unordered_map<int, double>& features, double* output, const PredictionEarlyStopInstance* early_stop) const {
  int early_stop_round_counter = 0;
  // set zero
  std::memset(output, 0, sizeof(double) * num_tree_per_iteration_);
  for (int i = 0; i < num_iteration_for_pred_; ++i) {
    // predict all the trees for one iteration
    for (int k = 0; k < num_tree_per_iteration_; ++k) {
      output[k] += models_[i * num_tree_per_iteration_ + k]->PredictByMap(features);
    }
    // check early stopping
    ++early_stop_round_counter;
    if (early_stop->round_period == early_stop_round_counter) {
      if (early_stop->callback_function(output, num_tree_per_iteration_)) {
        return;
      }
      early_stop_round_counter = 0;
    }
  }
}

49
50
void GBDT::Predict(const double* features, double* output, const PredictionEarlyStopInstance* early_stop) const {
  PredictRaw(features, output, early_stop);
Guolin Ke's avatar
Guolin Ke committed
51
52
53
54
  if (average_output_) {
    for (int k = 0; k < num_tree_per_iteration_; ++k) {
      output[k] /= num_iteration_for_pred_;
    }
Guolin Ke's avatar
Guolin Ke committed
55
56
  }
  if (objective_function_ != nullptr) {
57
58
59
60
    objective_function_->ConvertOutput(output, output);
  }
}

61
62
63
64
65
66
void GBDT::PredictByMap(const std::unordered_map<int, double>& features, double* output, const PredictionEarlyStopInstance* early_stop) const {
  PredictRawByMap(features, output, early_stop);
  if (average_output_) {
    for (int k = 0; k < num_tree_per_iteration_; ++k) {
      output[k] /= num_iteration_for_pred_;
    }
Guolin Ke's avatar
Guolin Ke committed
67
68
  }
  if (objective_function_ != nullptr) {
69
70
71
72
    objective_function_->ConvertOutput(output, output);
  }
}

73
74
75
76
77
78
79
void GBDT::PredictLeafIndex(const double* features, double* output) const {
  int total_tree = num_iteration_for_pred_ * num_tree_per_iteration_;
  for (int i = 0; i < total_tree; ++i) {
    output[i] = models_[i]->PredictLeafIndex(features);
  }
}

80
81
82
83
84
85
86
void GBDT::PredictLeafIndexByMap(const std::unordered_map<int, double>& features, double* output) const {
  int total_tree = num_iteration_for_pred_ * num_tree_per_iteration_;
  for (int i = 0; i < total_tree; ++i) {
    output[i] = models_[i]->PredictLeafIndexByMap(features);
  }
}

cbecker's avatar
cbecker committed
87
}  // namespace LightGBM