Skip to content

GitLab

Commit 548cec82 authored by Jeff Daily's avatar Jeff Daily
Browse files

Merge branch 'master' into rocm3

parents 2f7bd8ef 5dbfcdc4
Hide whitespace changes
Inline Side-by-side
Showing with 1019 additions and 972 deletions
src/boosting/goss.hpp
View file @ 548cec82
...@@ -3,8 +3,8 @@ ...@@ -3,8 +3,8 @@
* Licensed under the MIT License. See LICENSE file in the project root for license information. * Licensed under the MIT License. See LICENSE file in the project root for license information.
*/ */
#ifndef LIGHTGBM_BOOSTING_GOSS_HPP_ #ifndef LIGHTGBM_SRC_BOOSTING_GOSS_HPP_
#define LIGHTGBM_BOOSTING_GOSS_HPP_ #define LIGHTGBM_SRC_BOOSTING_GOSS_HPP_
#include <LightGBM/utils/array_args.h> #include <LightGBM/utils/array_args.h>
#include <LightGBM/sample_strategy.h> #include <LightGBM/sample_strategy.h>
...@@ -169,4 +169,4 @@ class GOSSStrategy : public SampleStrategy { ...@@ -169,4 +169,4 @@ class GOSSStrategy : public SampleStrategy {
} // namespace LightGBM } // namespace LightGBM
#endif // LIGHTGBM_BOOSTING_GOSS_HPP_ #endif // LIGHTGBM_SRC_BOOSTING_GOSS_HPP_
src/boosting/prediction_early_stop.cpp
View file @ 548cec82
...@@ -6,9 +6,11 @@ ...@@ -6,9 +6,11 @@
#include <LightGBM/utils/log.h> #include <LightGBM/utils/log.h>
#include <limits>
#include <algorithm> #include <algorithm>
#include <cmath> #include <cmath>
#include <functional>
#include <limits>
#include <string>
#include <vector> #include <vector>
namespace LightGBM { namespace LightGBM {
......
src/boosting/rf.hpp
View file @ 548cec82
...@@ -2,8 +2,8 @@ ...@@ -2,8 +2,8 @@
* Copyright (c) 2017 Microsoft Corporation. All rights reserved. * Copyright (c) 2017 Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See LICENSE file in the project root for license information. * Licensed under the MIT License. See LICENSE file in the project root for license information.
*/ */
#ifndef LIGHTGBM_BOOSTING_RF_H_ #ifndef LIGHTGBM_SRC_BOOSTING_RF_HPP_
#define LIGHTGBM_BOOSTING_RF_H_ #define LIGHTGBM_SRC_BOOSTING_RF_HPP_
#include <LightGBM/boosting.h> #include <LightGBM/boosting.h>
#include <LightGBM/metric.h> #include <LightGBM/metric.h>
...@@ -233,4 +233,4 @@ class RF : public GBDT { ...@@ -233,4 +233,4 @@ class RF : public GBDT {
}; };
} // namespace LightGBM } // namespace LightGBM
#endif // LIGHTGBM_BOOSTING_RF_H_ #endif // LIGHTGBM_SRC_BOOSTING_RF_HPP_
src/boosting/sample_strategy.cpp
View file @ 548cec82
...@@ -4,6 +4,9 @@ ...@@ -4,6 +4,9 @@
*/ */
#include <LightGBM/sample_strategy.h> #include <LightGBM/sample_strategy.h>
#include <string>
#include "goss.hpp" #include "goss.hpp"
#include "bagging.hpp" #include "bagging.hpp"
......
src/boosting/score_updater.hpp
View file @ 548cec82
...@@ -2,8 +2,8 @@ ...@@ -2,8 +2,8 @@
* Copyright (c) 2016 Microsoft Corporation. All rights reserved. * Copyright (c) 2016 Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See LICENSE file in the project root for license information. * Licensed under the MIT License. See LICENSE file in the project root for license information.
*/ */
#ifndef LIGHTGBM_BOOSTING_SCORE_UPDATER_HPP_ #ifndef LIGHTGBM_SRC_BOOSTING_SCORE_UPDATER_HPP_
#define LIGHTGBM_BOOSTING_SCORE_UPDATER_HPP_ #define LIGHTGBM_SRC_BOOSTING_SCORE_UPDATER_HPP_
#include <LightGBM/dataset.h> #include <LightGBM/dataset.h>
#include <LightGBM/meta.h> #include <LightGBM/meta.h>
...@@ -125,4 +125,4 @@ class ScoreUpdater { ...@@ -125,4 +125,4 @@ class ScoreUpdater {
}; };
} // namespace LightGBM } // namespace LightGBM
#endif // LightGBM_BOOSTING_SCORE_UPDATER_HPP_ #endif // LIGHTGBM_SRC_BOOSTING_SCORE_UPDATER_HPP_
src/c_api.cpp
View file @ 548cec82
...@@ -20,13 +20,16 @@ ...@@ -20,13 +20,16 @@
#include <LightGBM/utils/random.h> #include <LightGBM/utils/random.h>
#include <LightGBM/utils/threading.h> #include <LightGBM/utils/threading.h>
#include <string> #include <algorithm>
#include <cstdio>
#include <cstdint> #include <cstdint>
#include <cstdio>
#include <functional> #include <functional>
#include <memory> #include <memory>
#include <mutex> #include <mutex>
#include <stdexcept> #include <stdexcept>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector> #include <vector>
#include "application/predictor.hpp" #include "application/predictor.hpp"
......
src/cuda/cuda_algorithms.cu
View file @ 548cec82
...@@ -9,6 +9,8 @@ ...@@ -9,6 +9,8 @@
#include <LightGBM/cuda/cuda_algorithms.hpp> #include <LightGBM/cuda/cuda_algorithms.hpp>
#include <LightGBM/cuda/cuda_rocm_interop.h> #include <LightGBM/cuda/cuda_rocm_interop.h>
#include <algorithm>
namespace LightGBM { namespace LightGBM {
template <typename T> template <typename T>
......
src/io/bin.cpp
View file @ 548cec82
...@@ -12,6 +12,8 @@ ...@@ -12,6 +12,8 @@
#include <cmath> #include <cmath>
#include <cstdint> #include <cstdint>
#include <cstring> #include <cstring>
#include <limits>
#include <vector>
#include "dense_bin.hpp" #include "dense_bin.hpp"
#include "multi_val_dense_bin.hpp" #include "multi_val_dense_bin.hpp"
...@@ -20,1055 +22,1055 @@ ...@@ -20,1055 +22,1055 @@
namespace LightGBM { namespace LightGBM {
BinMapper::BinMapper(): num_bin_(1), is_trivial_(true), bin_type_(BinType::NumericalBin) { BinMapper::BinMapper(): num_bin_(1), is_trivial_(true), bin_type_(BinType::NumericalBin) {
bin_upper_bound_.clear(); bin_upper_bound_.clear();
bin_upper_bound_.push_back(std::numeric_limits<double>::infinity()); bin_upper_bound_.push_back(std::numeric_limits<double>::infinity());
}
// deep copy function for BinMapper
BinMapper::BinMapper(const BinMapper& other) {
num_bin_ = other.num_bin_;
missing_type_ = other.missing_type_;
is_trivial_ = other.is_trivial_;
sparse_rate_ = other.sparse_rate_;
bin_type_ = other.bin_type_;
if (bin_type_ == BinType::NumericalBin) {
bin_upper_bound_ = other.bin_upper_bound_;
} else {
bin_2_categorical_ = other.bin_2_categorical_;
categorical_2_bin_ = other.categorical_2_bin_;
} }
min_val_ = other.min_val_;
// deep copy function for BinMapper max_val_ = other.max_val_;
BinMapper::BinMapper(const BinMapper& other) { default_bin_ = other.default_bin_;
num_bin_ = other.num_bin_; most_freq_bin_ = other.most_freq_bin_;
missing_type_ = other.missing_type_; }
is_trivial_ = other.is_trivial_;
sparse_rate_ = other.sparse_rate_; BinMapper::BinMapper(const void* memory) {
bin_type_ = other.bin_type_; CopyFrom(reinterpret_cast<const char*>(memory));
if (bin_type_ == BinType::NumericalBin) { }
bin_upper_bound_ = other.bin_upper_bound_;
} else { BinMapper::~BinMapper() {
bin_2_categorical_ = other.bin_2_categorical_; }
categorical_2_bin_ = other.categorical_2_bin_;
bool NeedFilter(const std::vector<int>& cnt_in_bin, int total_cnt, int filter_cnt, BinType bin_type) {
if (bin_type == BinType::NumericalBin) {
int sum_left = 0;
for (size_t i = 0; i < cnt_in_bin.size() - 1; ++i) {
sum_left += cnt_in_bin[i];
if (sum_left >= filter_cnt && total_cnt - sum_left >= filter_cnt) {
return false;
}
} }
min_val_ = other.min_val_; } else {
max_val_ = other.max_val_; if (cnt_in_bin.size() <= 2) {
default_bin_ = other.default_bin_;
most_freq_bin_ = other.most_freq_bin_;
}
BinMapper::BinMapper(const void* memory) {
CopyFrom(reinterpret_cast<const char*>(memory));
}
BinMapper::~BinMapper() {
}
bool NeedFilter(const std::vector<int>& cnt_in_bin, int total_cnt, int filter_cnt, BinType bin_type) {
if (bin_type == BinType::NumericalBin) {
int sum_left = 0;
for (size_t i = 0; i < cnt_in_bin.size() - 1; ++i) { for (size_t i = 0; i < cnt_in_bin.size() - 1; ++i) {
sum_left += cnt_in_bin[i]; int sum_left = cnt_in_bin[i];
if (sum_left >= filter_cnt && total_cnt - sum_left >= filter_cnt) { if (sum_left >= filter_cnt && total_cnt - sum_left >= filter_cnt) {
return false; return false;
} }
} }
} else { } else {
if (cnt_in_bin.size() <= 2) { return false;
for (size_t i = 0; i < cnt_in_bin.size() - 1; ++i) {
int sum_left = cnt_in_bin[i];
if (sum_left >= filter_cnt && total_cnt - sum_left >= filter_cnt) {
return false;
}
}
} else {
return false;
}
} }
return true;
} }
return true;
std::vector<double> GreedyFindBin(const double* distinct_values, const int* counts, }
int num_distinct_values, int max_bin,
size_t total_cnt, int min_data_in_bin) { std::vector<double> GreedyFindBin(const double* distinct_values, const int* counts,
std::vector<double> bin_upper_bound; int num_distinct_values, int max_bin,
CHECK_GT(max_bin, 0); size_t total_cnt, int min_data_in_bin) {
if (num_distinct_values <= max_bin) { std::vector<double> bin_upper_bound;
bin_upper_bound.clear(); CHECK_GT(max_bin, 0);
int cur_cnt_inbin = 0; if (num_distinct_values <= max_bin) {
for (int i = 0; i < num_distinct_values - 1; ++i) { bin_upper_bound.clear();
cur_cnt_inbin += counts[i]; int cur_cnt_inbin = 0;
if (cur_cnt_inbin >= min_data_in_bin) { for (int i = 0; i < num_distinct_values - 1; ++i) {
auto val = Common::GetDoubleUpperBound((distinct_values[i] + distinct_values[i + 1]) / 2.0); cur_cnt_inbin += counts[i];
if (bin_upper_bound.empty() || !Common::CheckDoubleEqualOrdered(bin_upper_bound.back(), val)) { if (cur_cnt_inbin >= min_data_in_bin) {
bin_upper_bound.push_back(val); auto val = Common::GetDoubleUpperBound((distinct_values[i] + distinct_values[i + 1]) / 2.0);
cur_cnt_inbin = 0;
}
}
}
cur_cnt_inbin += counts[num_distinct_values - 1];
bin_upper_bound.push_back(std::numeric_limits<double>::infinity());
} else {
if (min_data_in_bin > 0) {
max_bin = std::min(max_bin, static_cast<int>(total_cnt / min_data_in_bin));
max_bin = std::max(max_bin, 1);
}
double mean_bin_size = static_cast<double>(total_cnt) / max_bin;
// mean size for one bin
int rest_bin_cnt = max_bin;
int rest_sample_cnt = static_cast<int>(total_cnt);
std::vector<bool> is_big_count_value(num_distinct_values, false);
for (int i = 0; i < num_distinct_values; ++i) {
if (counts[i] >= mean_bin_size) {
is_big_count_value[i] = true;
--rest_bin_cnt;
rest_sample_cnt -= counts[i];
}
}
mean_bin_size = static_cast<double>(rest_sample_cnt) / rest_bin_cnt;
std::vector<double> upper_bounds(max_bin, std::numeric_limits<double>::infinity());
std::vector<double> lower_bounds(max_bin, std::numeric_limits<double>::infinity());
int bin_cnt = 0;
lower_bounds[bin_cnt] = distinct_values[0];
int cur_cnt_inbin = 0;
for (int i = 0; i < num_distinct_values - 1; ++i) {
if (!is_big_count_value[i]) {
rest_sample_cnt -= counts[i];
}
cur_cnt_inbin += counts[i];
// need a new bin
if (is_big_count_value[i] || cur_cnt_inbin >= mean_bin_size ||
(is_big_count_value[i + 1] && cur_cnt_inbin >= std::max(1.0, mean_bin_size * 0.5f))) {
upper_bounds[bin_cnt] = distinct_values[i];
++bin_cnt;
lower_bounds[bin_cnt] = distinct_values[i + 1];
if (bin_cnt >= max_bin - 1) {
break;
}
cur_cnt_inbin = 0;
if (!is_big_count_value[i]) {
--rest_bin_cnt;
mean_bin_size = rest_sample_cnt / static_cast<double>(rest_bin_cnt);
}
}
}
++bin_cnt;
// update bin upper bound
bin_upper_bound.clear();
for (int i = 0; i < bin_cnt - 1; ++i) {
auto val = Common::GetDoubleUpperBound((upper_bounds[i] + lower_bounds[i + 1]) / 2.0);
if (bin_upper_bound.empty() || !Common::CheckDoubleEqualOrdered(bin_upper_bound.back(), val)) { if (bin_upper_bound.empty() || !Common::CheckDoubleEqualOrdered(bin_upper_bound.back(), val)) {
bin_upper_bound.push_back(val); bin_upper_bound.push_back(val);
cur_cnt_inbin = 0;
} }
} }
// last bin upper bound
bin_upper_bound.push_back(std::numeric_limits<double>::infinity());
}
return bin_upper_bound;
}
std::vector<double> FindBinWithPredefinedBin(const double* distinct_values, const int* counts,
int num_distinct_values, int max_bin,
size_t total_sample_cnt, int min_data_in_bin,
const std::vector<double>& forced_upper_bounds) {
std::vector<double> bin_upper_bound;
// get number of positive and negative distinct values
int left_cnt = -1;
for (int i = 0; i < num_distinct_values; ++i) {
if (distinct_values[i] > -kZeroThreshold) {
left_cnt = i;
break;
}
}
if (left_cnt < 0) {
left_cnt = num_distinct_values;
}
int right_start = -1;
for (int i = left_cnt; i < num_distinct_values; ++i) {
if (distinct_values[i] > kZeroThreshold) {
right_start = i;
break;
}
}
// include zero bounds and infinity bound
if (max_bin == 2) {
if (left_cnt == 0) {
bin_upper_bound.push_back(kZeroThreshold);
} else {
bin_upper_bound.push_back(-kZeroThreshold);
}
} else if (max_bin >= 3) {
if (left_cnt > 0) {
bin_upper_bound.push_back(-kZeroThreshold);
}
if (right_start >= 0) {
bin_upper_bound.push_back(kZeroThreshold);
}
} }
cur_cnt_inbin += counts[num_distinct_values - 1];
bin_upper_bound.push_back(std::numeric_limits<double>::infinity()); bin_upper_bound.push_back(std::numeric_limits<double>::infinity());
} else {
// add forced bounds, excluding zeros since we have already added zero bounds if (min_data_in_bin > 0) {
int max_to_insert = max_bin - static_cast<int>(bin_upper_bound.size()); max_bin = std::min(max_bin, static_cast<int>(total_cnt / min_data_in_bin));
int num_inserted = 0; max_bin = std::max(max_bin, 1);
for (size_t i = 0; i < forced_upper_bounds.size(); ++i) {
if (num_inserted >= max_to_insert) {
break;
}
if (std::fabs(forced_upper_bounds[i]) > kZeroThreshold) {
bin_upper_bound.push_back(forced_upper_bounds[i]);
++num_inserted;
}
} }
std::stable_sort(bin_upper_bound.begin(), bin_upper_bound.end()); double mean_bin_size = static_cast<double>(total_cnt) / max_bin;
// find remaining bounds
int free_bins = max_bin - static_cast<int>(bin_upper_bound.size());
std::vector<double> bounds_to_add;
int value_ind = 0;
for (size_t i = 0; i < bin_upper_bound.size(); ++i) {
int cnt_in_bin = 0;
int distinct_cnt_in_bin = 0;
int bin_start = value_ind;
while ((value_ind < num_distinct_values) && (distinct_values[value_ind] < bin_upper_bound[i])) {
cnt_in_bin += counts[value_ind];
++distinct_cnt_in_bin;
++value_ind;
}
int bins_remaining = max_bin - static_cast<int>(bin_upper_bound.size()) - static_cast<int>(bounds_to_add.size());
int num_sub_bins = static_cast<int>(std::lround((static_cast<double>(cnt_in_bin) * free_bins / total_sample_cnt)));
num_sub_bins = std::min(num_sub_bins, bins_remaining) + 1;
if (i == bin_upper_bound.size() - 1) {
num_sub_bins = bins_remaining + 1;
}
std::vector<double> new_upper_bounds = GreedyFindBin(distinct_values + bin_start, counts + bin_start, distinct_cnt_in_bin,
num_sub_bins, cnt_in_bin, min_data_in_bin);
bounds_to_add.insert(bounds_to_add.end(), new_upper_bounds.begin(), new_upper_bounds.end() - 1); // last bound is infinity
}
bin_upper_bound.insert(bin_upper_bound.end(), bounds_to_add.begin(), bounds_to_add.end());
std::stable_sort(bin_upper_bound.begin(), bin_upper_bound.end());
CHECK_LE(bin_upper_bound.size(), static_cast<size_t>(max_bin));
return bin_upper_bound;
}
std::vector<double> FindBinWithZeroAsOneBin(const double* distinct_values, const int* counts, int num_distinct_values, // mean size for one bin
int max_bin, size_t total_sample_cnt, int min_data_in_bin) { int rest_bin_cnt = max_bin;
std::vector<double> bin_upper_bound; int rest_sample_cnt = static_cast<int>(total_cnt);
int left_cnt_data = 0; std::vector<bool> is_big_count_value(num_distinct_values, false);
int cnt_zero = 0;
int right_cnt_data = 0;
for (int i = 0; i < num_distinct_values; ++i) { for (int i = 0; i < num_distinct_values; ++i) {
if (distinct_values[i] <= -kZeroThreshold) { if (counts[i] >= mean_bin_size) {
left_cnt_data += counts[i]; is_big_count_value[i] = true;
} else if (distinct_values[i] > kZeroThreshold) { --rest_bin_cnt;
right_cnt_data += counts[i]; rest_sample_cnt -= counts[i];
} else {
cnt_zero += counts[i];
} }
} }
mean_bin_size = static_cast<double>(rest_sample_cnt) / rest_bin_cnt;
int left_cnt = -1; std::vector<double> upper_bounds(max_bin, std::numeric_limits<double>::infinity());
for (int i = 0; i < num_distinct_values; ++i) { std::vector<double> lower_bounds(max_bin, std::numeric_limits<double>::infinity());
if (distinct_values[i] > -kZeroThreshold) {
left_cnt = i; int bin_cnt = 0;
break; lower_bounds[bin_cnt] = distinct_values[0];
int cur_cnt_inbin = 0;
for (int i = 0; i < num_distinct_values - 1; ++i) {
if (!is_big_count_value[i]) {
rest_sample_cnt -= counts[i];
} }
} cur_cnt_inbin += counts[i];
// need a new bin
if (left_cnt < 0) { if (is_big_count_value[i] || cur_cnt_inbin >= mean_bin_size ||
left_cnt = num_distinct_values; (is_big_count_value[i + 1] && cur_cnt_inbin >= std::max(1.0, mean_bin_size * 0.5f))) {
} upper_bounds[bin_cnt] = distinct_values[i];
++bin_cnt;
if ((left_cnt > 0) && (max_bin > 1)) { lower_bounds[bin_cnt] = distinct_values[i + 1];
int left_max_bin = static_cast<int>(static_cast<double>(left_cnt_data) / (total_sample_cnt - cnt_zero) * (max_bin - 1)); if (bin_cnt >= max_bin - 1) {
left_max_bin = std::max(1, left_max_bin); break;
bin_upper_bound = GreedyFindBin(distinct_values, counts, left_cnt, left_max_bin, left_cnt_data, min_data_in_bin); }
if (bin_upper_bound.size() > 0) { cur_cnt_inbin = 0;
bin_upper_bound.back() = -kZeroThreshold; if (!is_big_count_value[i]) {
--rest_bin_cnt;
mean_bin_size = rest_sample_cnt / static_cast<double>(rest_bin_cnt);
}
} }
} }
++bin_cnt;
int right_start = -1; // update bin upper bound
for (int i = left_cnt; i < num_distinct_values; ++i) { bin_upper_bound.clear();
if (distinct_values[i] > kZeroThreshold) { for (int i = 0; i < bin_cnt - 1; ++i) {
right_start = i; auto val = Common::GetDoubleUpperBound((upper_bounds[i] + lower_bounds[i + 1]) / 2.0);
break; if (bin_upper_bound.empty() || !Common::CheckDoubleEqualOrdered(bin_upper_bound.back(), val)) {
bin_upper_bound.push_back(val);
} }
} }
// last bin upper bound
int right_max_bin = max_bin - 1 - static_cast<int>(bin_upper_bound.size()); bin_upper_bound.push_back(std::numeric_limits<double>::infinity());
if (right_start >= 0 && right_max_bin > 0) {
auto right_bounds = GreedyFindBin(distinct_values + right_start, counts + right_start,
num_distinct_values - right_start, right_max_bin, right_cnt_data, min_data_in_bin);
bin_upper_bound.push_back(kZeroThreshold);
bin_upper_bound.insert(bin_upper_bound.end(), right_bounds.begin(), right_bounds.end());
} else {
bin_upper_bound.push_back(std::numeric_limits<double>::infinity());
}
CHECK_LE(bin_upper_bound.size(), static_cast<size_t>(max_bin));
return bin_upper_bound;
} }
return bin_upper_bound;
}
std::vector<double> FindBinWithZeroAsOneBin(const double* distinct_values, const int* counts, int num_distinct_values, std::vector<double> FindBinWithPredefinedBin(const double* distinct_values, const int* counts,
int max_bin, size_t total_sample_cnt, int min_data_in_bin, int num_distinct_values, int max_bin,
size_t total_sample_cnt, int min_data_in_bin,
const std::vector<double>& forced_upper_bounds) { const std::vector<double>& forced_upper_bounds) {
if (forced_upper_bounds.empty()) { std::vector<double> bin_upper_bound;
return FindBinWithZeroAsOneBin(distinct_values, counts, num_distinct_values, max_bin, total_sample_cnt, min_data_in_bin);
} else { // get number of positive and negative distinct values
return FindBinWithPredefinedBin(distinct_values, counts, num_distinct_values, max_bin, total_sample_cnt, min_data_in_bin, int left_cnt = -1;
forced_upper_bounds); for (int i = 0; i < num_distinct_values; ++i) {
if (distinct_values[i] > -kZeroThreshold) {
left_cnt = i;
break;
} }
} }
if (left_cnt < 0) {
void BinMapper::FindBin(double* values, int num_sample_values, size_t total_sample_cnt, left_cnt = num_distinct_values;
int max_bin, int min_data_in_bin, int min_split_data, bool pre_filter, BinType bin_type, }
bool use_missing, bool zero_as_missing, int right_start = -1;
const std::vector<double>& forced_upper_bounds) { for (int i = left_cnt; i < num_distinct_values; ++i) {
int na_cnt = 0; if (distinct_values[i] > kZeroThreshold) {
int non_na_cnt = 0; right_start = i;
for (int i = 0; i < num_sample_values; ++i) { break;
if (!std::isnan(values[i])) {
values[non_na_cnt++] = values[i];
}
}
if (!use_missing) {
missing_type_ = MissingType::None;
} else if (zero_as_missing) {
missing_type_ = MissingType::Zero;
} else {
if (non_na_cnt == num_sample_values) {
missing_type_ = MissingType::None;
} else {
missing_type_ = MissingType::NaN;
na_cnt = num_sample_values - non_na_cnt;
}
} }
num_sample_values = non_na_cnt; }
bin_type_ = bin_type;
default_bin_ = 0;
int zero_cnt = static_cast<int>(total_sample_cnt - num_sample_values - na_cnt);
// find distinct_values first
std::vector<double> distinct_values;
std::vector<int> counts; // count of data points for each distinct feature value.
std::stable_sort(values, values + num_sample_values);
// push zero in the front // include zero bounds and infinity bound
if (num_sample_values == 0 || (values[0] > 0.0f && zero_cnt > 0)) { if (max_bin == 2) {
distinct_values.push_back(0.0f); if (left_cnt == 0) {
counts.push_back(zero_cnt); bin_upper_bound.push_back(kZeroThreshold);
} else {
bin_upper_bound.push_back(-kZeroThreshold);
} }
} else if (max_bin >= 3) {
if (num_sample_values > 0) { if (left_cnt > 0) {
distinct_values.push_back(values[0]); bin_upper_bound.push_back(-kZeroThreshold);
counts.push_back(1);
} }
if (right_start >= 0) {
for (int i = 1; i < num_sample_values; ++i) { bin_upper_bound.push_back(kZeroThreshold);
if (!Common::CheckDoubleEqualOrdered(values[i - 1], values[i])) {
if (values[i - 1] < 0.0f && values[i] > 0.0f) {
distinct_values.push_back(0.0f);
counts.push_back(zero_cnt);
}
distinct_values.push_back(values[i]);
counts.push_back(1);
} else {
// use the large value
distinct_values.back() = values[i];
++counts.back();
}
} }
}
// push zero in the back bin_upper_bound.push_back(std::numeric_limits<double>::infinity());
if (num_sample_values > 0 && values[num_sample_values - 1] < 0.0f && zero_cnt > 0) {
distinct_values.push_back(0.0f); // add forced bounds, excluding zeros since we have already added zero bounds
counts.push_back(zero_cnt); int max_to_insert = max_bin - static_cast<int>(bin_upper_bound.size());
int num_inserted = 0;
for (size_t i = 0; i < forced_upper_bounds.size(); ++i) {
if (num_inserted >= max_to_insert) {
break;
} }
min_val_ = distinct_values.front(); if (std::fabs(forced_upper_bounds[i]) > kZeroThreshold) {
max_val_ = distinct_values.back(); bin_upper_bound.push_back(forced_upper_bounds[i]);
std::vector<int> cnt_in_bin; // count of data points in each bin. ++num_inserted;
int num_distinct_values = static_cast<int>(distinct_values.size());
if (bin_type_ == BinType::NumericalBin) {
if (missing_type_ == MissingType::Zero) {
bin_upper_bound_ = FindBinWithZeroAsOneBin(distinct_values.data(), counts.data(), num_distinct_values, max_bin, total_sample_cnt,
min_data_in_bin, forced_upper_bounds);
if (bin_upper_bound_.size() == 2) {
missing_type_ = MissingType::None;
}
} else if (missing_type_ == MissingType::None) {
bin_upper_bound_ = FindBinWithZeroAsOneBin(distinct_values.data(), counts.data(), num_distinct_values, max_bin, total_sample_cnt,
min_data_in_bin, forced_upper_bounds);
} else {
bin_upper_bound_ = FindBinWithZeroAsOneBin(distinct_values.data(), counts.data(), num_distinct_values, max_bin - 1, total_sample_cnt - na_cnt,
min_data_in_bin, forced_upper_bounds);
bin_upper_bound_.push_back(NaN);
}
num_bin_ = static_cast<int>(bin_upper_bound_.size());
{
cnt_in_bin.resize(num_bin_, 0);
int i_bin = 0;
for (int i = 0; i < num_distinct_values; ++i) {
while (distinct_values[i] > bin_upper_bound_[i_bin] && i_bin < num_bin_ - 1) {
++i_bin;
}
cnt_in_bin[i_bin] += counts[i];
}
if (missing_type_ == MissingType::NaN) {
cnt_in_bin[num_bin_ - 1] = na_cnt;
}
}
CHECK_LE(num_bin_, max_bin);
} else {
// convert to int type first
std::vector<int> distinct_values_int;
std::vector<int> counts_int;
for (size_t i = 0; i < distinct_values.size(); ++i) {
int val = static_cast<int>(distinct_values[i]);
if (val < 0) {
na_cnt += counts[i];
Log::Warning("Met negative value in categorical features, will convert it to NaN");
} else {
if (distinct_values_int.empty() || val != distinct_values_int.back()) {
distinct_values_int.push_back(val);
counts_int.push_back(counts[i]);
} else {
counts_int.back() += counts[i];
}
}
}
int rest_cnt = static_cast<int>(total_sample_cnt - na_cnt);
if (rest_cnt > 0) {
const int SPARSE_RATIO = 100;
if (distinct_values_int.back() / SPARSE_RATIO > static_cast<int>(distinct_values_int.size())) {
Log::Warning("Met categorical feature which contains sparse values. "
"Consider renumbering to consecutive integers started from zero");
}
// sort by counts in descending order
Common::SortForPair<int, int>(&counts_int, &distinct_values_int, 0, true);
// will ignore the categorical of small counts
int cut_cnt = static_cast<int>(
Common::RoundInt((total_sample_cnt - na_cnt) * 0.99f));
size_t cur_cat_idx = 0; // index of current category.
categorical_2_bin_.clear();
bin_2_categorical_.clear();
int used_cnt = 0;
int distinct_cnt = static_cast<int>(distinct_values_int.size());
if (na_cnt > 0) {
++distinct_cnt;
}
max_bin = std::min(distinct_cnt, max_bin);
cnt_in_bin.clear();
// Push the dummy bin for NaN
bin_2_categorical_.push_back(-1);
categorical_2_bin_[-1] = 0;
cnt_in_bin.push_back(0);
num_bin_ = 1;
while (cur_cat_idx < distinct_values_int.size()
&& (used_cnt < cut_cnt || num_bin_ < max_bin)) {
if (counts_int[cur_cat_idx] < min_data_in_bin && cur_cat_idx > 1) {
break;
}
bin_2_categorical_.push_back(distinct_values_int[cur_cat_idx]);
categorical_2_bin_[distinct_values_int[cur_cat_idx]] = static_cast<unsigned int>(num_bin_);
used_cnt += counts_int[cur_cat_idx];
cnt_in_bin.push_back(counts_int[cur_cat_idx]);
++num_bin_;
++cur_cat_idx;
}
// Use MissingType::None to represent this bin contains all categoricals
if (cur_cat_idx == distinct_values_int.size() && na_cnt == 0) {
missing_type_ = MissingType::None;
} else {
missing_type_ = MissingType::NaN;
}
// fix count of NaN bin
cnt_in_bin[0] = static_cast<int>(total_sample_cnt - used_cnt);
}
} }
}
// check trivial(num_bin_ == 1) feature std::stable_sort(bin_upper_bound.begin(), bin_upper_bound.end());
if (num_bin_ <= 1) {
is_trivial_ = true; // find remaining bounds
} else { int free_bins = max_bin - static_cast<int>(bin_upper_bound.size());
is_trivial_ = false; std::vector<double> bounds_to_add;
int value_ind = 0;
for (size_t i = 0; i < bin_upper_bound.size(); ++i) {
int cnt_in_bin = 0;
int distinct_cnt_in_bin = 0;
int bin_start = value_ind;
while ((value_ind < num_distinct_values) && (distinct_values[value_ind] < bin_upper_bound[i])) {
cnt_in_bin += counts[value_ind];
++distinct_cnt_in_bin;
++value_ind;
} }
// check useless bin int bins_remaining = max_bin - static_cast<int>(bin_upper_bound.size()) - static_cast<int>(bounds_to_add.size());
if (!is_trivial_ && pre_filter && NeedFilter(cnt_in_bin, static_cast<int>(total_sample_cnt), min_split_data, bin_type_)) { int num_sub_bins = static_cast<int>(std::lround((static_cast<double>(cnt_in_bin) * free_bins / total_sample_cnt)));
is_trivial_ = true; num_sub_bins = std::min(num_sub_bins, bins_remaining) + 1;
if (i == bin_upper_bound.size() - 1) {
num_sub_bins = bins_remaining + 1;
} }
std::vector<double> new_upper_bounds = GreedyFindBin(distinct_values + bin_start, counts + bin_start, distinct_cnt_in_bin,
if (!is_trivial_) { num_sub_bins, cnt_in_bin, min_data_in_bin);
default_bin_ = ValueToBin(0); bounds_to_add.insert(bounds_to_add.end(), new_upper_bounds.begin(), new_upper_bounds.end() - 1); // last bound is infinity
most_freq_bin_ = }
static_cast<uint32_t>(ArrayArgs<int>::ArgMax(cnt_in_bin)); bin_upper_bound.insert(bin_upper_bound.end(), bounds_to_add.begin(), bounds_to_add.end());
const double max_sparse_rate = std::stable_sort(bin_upper_bound.begin(), bin_upper_bound.end());
static_cast<double>(cnt_in_bin[most_freq_bin_]) / total_sample_cnt; CHECK_LE(bin_upper_bound.size(), static_cast<size_t>(max_bin));
// When most_freq_bin_ != default_bin_, there are some additional data loading costs. return bin_upper_bound;
// so use most_freq_bin_ = default_bin_ when there is not so sparse }
if (most_freq_bin_ != default_bin_ && max_sparse_rate < kSparseThreshold) {
most_freq_bin_ = default_bin_; std::vector<double> FindBinWithZeroAsOneBin(const double* distinct_values, const int* counts, int num_distinct_values,
} int max_bin, size_t total_sample_cnt, int min_data_in_bin) {
sparse_rate_ = std::vector<double> bin_upper_bound;
static_cast<double>(cnt_in_bin[most_freq_bin_]) / total_sample_cnt; int left_cnt_data = 0;
int cnt_zero = 0;
int right_cnt_data = 0;
for (int i = 0; i < num_distinct_values; ++i) {
if (distinct_values[i] <= -kZeroThreshold) {
left_cnt_data += counts[i];
} else if (distinct_values[i] > kZeroThreshold) {
right_cnt_data += counts[i];
} else { } else {
sparse_rate_ = 1.0f; cnt_zero += counts[i];
} }
} }
void BinMapper::CopyTo(char * buffer) const { int left_cnt = -1;
std::memcpy(buffer, &num_bin_, sizeof(num_bin_)); for (int i = 0; i < num_distinct_values; ++i) {
buffer += VirtualFileWriter::AlignedSize(sizeof(num_bin_)); if (distinct_values[i] > -kZeroThreshold) {
std::memcpy(buffer, &missing_type_, sizeof(missing_type_)); left_cnt = i;
buffer += VirtualFileWriter::AlignedSize(sizeof(missing_type_)); break;
std::memcpy(buffer, &is_trivial_, sizeof(is_trivial_));
buffer += VirtualFileWriter::AlignedSize(sizeof(is_trivial_));
std::memcpy(buffer, &sparse_rate_, sizeof(sparse_rate_));
buffer += sizeof(sparse_rate_);
std::memcpy(buffer, &bin_type_, sizeof(bin_type_));
buffer += VirtualFileWriter::AlignedSize(sizeof(bin_type_));
std::memcpy(buffer, &min_val_, sizeof(min_val_));
buffer += sizeof(min_val_);
std::memcpy(buffer, &max_val_, sizeof(max_val_));
buffer += sizeof(max_val_);
std::memcpy(buffer, &default_bin_, sizeof(default_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(default_bin_));
std::memcpy(buffer, &most_freq_bin_, sizeof(most_freq_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(most_freq_bin_));
if (bin_type_ == BinType::NumericalBin) {
std::memcpy(buffer, bin_upper_bound_.data(), num_bin_ * sizeof(double));
} else {
std::memcpy(buffer, bin_2_categorical_.data(), num_bin_ * sizeof(int));
} }
} }
void BinMapper::CopyFrom(const char * buffer) { if (left_cnt < 0) {
std::memcpy(&num_bin_, buffer, sizeof(num_bin_)); left_cnt = num_distinct_values;
buffer += VirtualFileWriter::AlignedSize(sizeof(num_bin_)); }
std::memcpy(&missing_type_, buffer, sizeof(missing_type_));
buffer += VirtualFileWriter::AlignedSize(sizeof(missing_type_)); if ((left_cnt > 0) && (max_bin > 1)) {
std::memcpy(&is_trivial_, buffer, sizeof(is_trivial_)); int left_max_bin = static_cast<int>(static_cast<double>(left_cnt_data) / (total_sample_cnt - cnt_zero) * (max_bin - 1));
buffer += VirtualFileWriter::AlignedSize(sizeof(is_trivial_)); left_max_bin = std::max(1, left_max_bin);
std::memcpy(&sparse_rate_, buffer, sizeof(sparse_rate_)); bin_upper_bound = GreedyFindBin(distinct_values, counts, left_cnt, left_max_bin, left_cnt_data, min_data_in_bin);
buffer += sizeof(sparse_rate_); if (bin_upper_bound.size() > 0) {
std::memcpy(&bin_type_, buffer, sizeof(bin_type_)); bin_upper_bound.back() = -kZeroThreshold;
buffer += VirtualFileWriter::AlignedSize(sizeof(bin_type_));
std::memcpy(&min_val_, buffer, sizeof(min_val_));
buffer += sizeof(min_val_);
std::memcpy(&max_val_, buffer, sizeof(max_val_));
buffer += sizeof(max_val_);
std::memcpy(&default_bin_, buffer, sizeof(default_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(default_bin_));
std::memcpy(&most_freq_bin_, buffer, sizeof(most_freq_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(most_freq_bin_));
if (bin_type_ == BinType::NumericalBin) {
bin_upper_bound_ = std::vector<double>(num_bin_);
std::memcpy(bin_upper_bound_.data(), buffer, num_bin_ * sizeof(double));
} else {
bin_2_categorical_ = std::vector<int>(num_bin_);
std::memcpy(bin_2_categorical_.data(), buffer, num_bin_ * sizeof(int));
categorical_2_bin_.clear();
for (int i = 0; i < num_bin_; ++i) {
categorical_2_bin_[bin_2_categorical_[i]] = static_cast<unsigned int>(i);
}
} }
} }
void BinMapper::SaveBinaryToFile(BinaryWriter* writer) const { int right_start = -1;
writer->AlignedWrite(&num_bin_, sizeof(num_bin_)); for (int i = left_cnt; i < num_distinct_values; ++i) {
writer->AlignedWrite(&missing_type_, sizeof(missing_type_)); if (distinct_values[i] > kZeroThreshold) {
writer->AlignedWrite(&is_trivial_, sizeof(is_trivial_)); right_start = i;
writer->Write(&sparse_rate_, sizeof(sparse_rate_)); break;
writer->AlignedWrite(&bin_type_, sizeof(bin_type_));
writer->Write(&min_val_, sizeof(min_val_));
writer->Write(&max_val_, sizeof(max_val_));
writer->AlignedWrite(&default_bin_, sizeof(default_bin_));
writer->AlignedWrite(&most_freq_bin_, sizeof(most_freq_bin_));
if (bin_type_ == BinType::NumericalBin) {
writer->Write(bin_upper_bound_.data(), sizeof(double) * num_bin_);
} else {
writer->Write(bin_2_categorical_.data(), sizeof(int) * num_bin_);
} }
} }
size_t BinMapper::SizesInByte() const { int right_max_bin = max_bin - 1 - static_cast<int>(bin_upper_bound.size());
size_t ret = VirtualFileWriter::AlignedSize(sizeof(num_bin_)) + if (right_start >= 0 && right_max_bin > 0) {
VirtualFileWriter::AlignedSize(sizeof(missing_type_)) + auto right_bounds = GreedyFindBin(distinct_values + right_start, counts + right_start,
VirtualFileWriter::AlignedSize(sizeof(is_trivial_)) + num_distinct_values - right_start, right_max_bin, right_cnt_data, min_data_in_bin);
sizeof(sparse_rate_) + bin_upper_bound.push_back(kZeroThreshold);
VirtualFileWriter::AlignedSize(sizeof(bin_type_)) + bin_upper_bound.insert(bin_upper_bound.end(), right_bounds.begin(), right_bounds.end());
sizeof(min_val_) + sizeof(max_val_) + } else {
VirtualFileWriter::AlignedSize(sizeof(default_bin_)) + bin_upper_bound.push_back(std::numeric_limits<double>::infinity());
VirtualFileWriter::AlignedSize(sizeof(most_freq_bin_)); }
if (bin_type_ == BinType::NumericalBin) { CHECK_LE(bin_upper_bound.size(), static_cast<size_t>(max_bin));
ret += sizeof(double) * num_bin_; return bin_upper_bound;
}
std::vector<double> FindBinWithZeroAsOneBin(const double* distinct_values, const int* counts, int num_distinct_values,
int max_bin, size_t total_sample_cnt, int min_data_in_bin,
const std::vector<double>& forced_upper_bounds) {
if (forced_upper_bounds.empty()) {
return FindBinWithZeroAsOneBin(distinct_values, counts, num_distinct_values, max_bin, total_sample_cnt, min_data_in_bin);
} else {
return FindBinWithPredefinedBin(distinct_values, counts, num_distinct_values, max_bin, total_sample_cnt, min_data_in_bin,
forced_upper_bounds);
}
}
void BinMapper::FindBin(double* values, int num_sample_values, size_t total_sample_cnt,
int max_bin, int min_data_in_bin, int min_split_data, bool pre_filter, BinType bin_type,
bool use_missing, bool zero_as_missing,
const std::vector<double>& forced_upper_bounds) {
int na_cnt = 0;
int non_na_cnt = 0;
for (int i = 0; i < num_sample_values; ++i) {
if (!std::isnan(values[i])) {
values[non_na_cnt++] = values[i];
}
}
if (!use_missing) {
missing_type_ = MissingType::None;
} else if (zero_as_missing) {
missing_type_ = MissingType::Zero;
} else {
if (non_na_cnt == num_sample_values) {
missing_type_ = MissingType::None;
} else { } else {
ret += sizeof(int) * num_bin_; missing_type_ = MissingType::NaN;
na_cnt = num_sample_values - non_na_cnt;
} }
return ret;
} }
num_sample_values = non_na_cnt;
template class DenseBin<uint8_t, true>; bin_type_ = bin_type;
template class DenseBin<uint8_t, false>; default_bin_ = 0;
template class DenseBin<uint16_t, false>; int zero_cnt = static_cast<int>(total_sample_cnt - num_sample_values - na_cnt);
template class DenseBin<uint32_t, false>; // find distinct_values first
std::vector<double> distinct_values;
template class SparseBin<uint8_t>; std::vector<int> counts; // count of data points for each distinct feature value.
template class SparseBin<uint16_t>;
template class SparseBin<uint32_t>;
template class MultiValDenseBin<uint8_t>; std::stable_sort(values, values + num_sample_values);
template class MultiValDenseBin<uint16_t>;
template class MultiValDenseBin<uint32_t>;
Bin* Bin::CreateDenseBin(data_size_t num_data, int num_bin) { // push zero in the front
if (num_bin <= 16) { if (num_sample_values == 0 || (values[0] > 0.0f && zero_cnt > 0)) {
return new DenseBin<uint8_t, true>(num_data); distinct_values.push_back(0.0f);
} else if (num_bin <= 256) { counts.push_back(zero_cnt);
return new DenseBin<uint8_t, false>(num_data);
} else if (num_bin <= 65536) {
return new DenseBin<uint16_t, false>(num_data);
} else {
return new DenseBin<uint32_t, false>(num_data);
}
} }
Bin* Bin::CreateSparseBin(data_size_t num_data, int num_bin) { if (num_sample_values > 0) {
if (num_bin <= 256) { distinct_values.push_back(values[0]);
return new SparseBin<uint8_t>(num_data); counts.push_back(1);
} else if (num_bin <= 65536) {
return new SparseBin<uint16_t>(num_data);
} else {
return new SparseBin<uint32_t>(num_data);
}
} }
MultiValBin* MultiValBin::CreateMultiValBin(data_size_t num_data, int num_bin, int num_feature, for (int i = 1; i < num_sample_values; ++i) {
double sparse_rate, const std::vector<uint32_t>& offsets) { if (!Common::CheckDoubleEqualOrdered(values[i - 1], values[i])) {
if (sparse_rate >= multi_val_bin_sparse_threshold) { if (values[i - 1] < 0.0f && values[i] > 0.0f) {
const double average_element_per_row = (1.0 - sparse_rate) * num_feature; distinct_values.push_back(0.0f);
return CreateMultiValSparseBin(num_data, num_bin, counts.push_back(zero_cnt);
average_element_per_row); }
distinct_values.push_back(values[i]);
counts.push_back(1);
} else { } else {
return CreateMultiValDenseBin(num_data, num_bin, num_feature, offsets); // use the large value
distinct_values.back() = values[i];
++counts.back();
} }
} }
MultiValBin* MultiValBin::CreateMultiValDenseBin(data_size_t num_data, // push zero in the back
int num_bin, if (num_sample_values > 0 && values[num_sample_values - 1] < 0.0f && zero_cnt > 0) {
int num_feature, distinct_values.push_back(0.0f);
const std::vector<uint32_t>& offsets) { counts.push_back(zero_cnt);
// calculate max bin of all features to select the int type in MultiValDenseBin }
int max_bin = 0; min_val_ = distinct_values.front();
for (int i = 0; i < static_cast<int>(offsets.size()) - 1; ++i) { max_val_ = distinct_values.back();
int feature_bin = offsets[i + 1] - offsets[i]; std::vector<int> cnt_in_bin; // count of data points in each bin.
if (feature_bin > max_bin) { int num_distinct_values = static_cast<int>(distinct_values.size());
max_bin = feature_bin; if (bin_type_ == BinType::NumericalBin) {
if (missing_type_ == MissingType::Zero) {
bin_upper_bound_ = FindBinWithZeroAsOneBin(distinct_values.data(), counts.data(), num_distinct_values, max_bin, total_sample_cnt,
min_data_in_bin, forced_upper_bounds);
if (bin_upper_bound_.size() == 2) {
missing_type_ = MissingType::None;
} }
} } else if (missing_type_ == MissingType::None) {
if (max_bin <= 256) { bin_upper_bound_ = FindBinWithZeroAsOneBin(distinct_values.data(), counts.data(), num_distinct_values, max_bin, total_sample_cnt,
return new MultiValDenseBin<uint8_t>(num_data, num_bin, num_feature, offsets); min_data_in_bin, forced_upper_bounds);
} else if (max_bin <= 65536) {
return new MultiValDenseBin<uint16_t>(num_data, num_bin, num_feature, offsets);
} else { } else {
return new MultiValDenseBin<uint32_t>(num_data, num_bin, num_feature, offsets); bin_upper_bound_ = FindBinWithZeroAsOneBin(distinct_values.data(), counts.data(), num_distinct_values, max_bin - 1, total_sample_cnt - na_cnt,
min_data_in_bin, forced_upper_bounds);
bin_upper_bound_.push_back(NaN);
} }
} num_bin_ = static_cast<int>(bin_upper_bound_.size());
{
MultiValBin* MultiValBin::CreateMultiValSparseBin(data_size_t num_data, cnt_in_bin.resize(num_bin_, 0);
int num_bin, int i_bin = 0;
double estimate_element_per_row) { for (int i = 0; i < num_distinct_values; ++i) {
size_t estimate_total_entries = while (distinct_values[i] > bin_upper_bound_[i_bin] && i_bin < num_bin_ - 1) {
static_cast<size_t>(estimate_element_per_row * 1.1 * num_data); ++i_bin;
if (estimate_total_entries <= std::numeric_limits<uint16_t>::max()) { }
if (num_bin <= 256) { cnt_in_bin[i_bin] += counts[i];
return new MultiValSparseBin<uint16_t, uint8_t>(
num_data, num_bin, estimate_element_per_row);
} else if (num_bin <= 65536) {
return new MultiValSparseBin<uint16_t, uint16_t>(
num_data, num_bin, estimate_element_per_row);
} else {
return new MultiValSparseBin<uint16_t, uint32_t>(
num_data, num_bin, estimate_element_per_row);
} }
} else if (estimate_total_entries <= std::numeric_limits<uint32_t>::max()) { if (missing_type_ == MissingType::NaN) {
if (num_bin <= 256) { cnt_in_bin[num_bin_ - 1] = na_cnt;
return new MultiValSparseBin<uint32_t, uint8_t>( }
num_data, num_bin, estimate_element_per_row); }
} else if (num_bin <= 65536) { CHECK_LE(num_bin_, max_bin);
return new MultiValSparseBin<uint32_t, uint16_t>( } else {
num_data, num_bin, estimate_element_per_row); // convert to int type first
std::vector<int> distinct_values_int;
std::vector<int> counts_int;
for (size_t i = 0; i < distinct_values.size(); ++i) {
int val = static_cast<int>(distinct_values[i]);
if (val < 0) {
na_cnt += counts[i];
Log::Warning("Met negative value in categorical features, will convert it to NaN");
} else { } else {
return new MultiValSparseBin<uint32_t, uint32_t>( if (distinct_values_int.empty() || val != distinct_values_int.back()) {
num_data, num_bin, estimate_element_per_row); distinct_values_int.push_back(val);
counts_int.push_back(counts[i]);
} else {
counts_int.back() += counts[i];
}
} }
} else { }
if (num_bin <= 256) { int rest_cnt = static_cast<int>(total_sample_cnt - na_cnt);
return new MultiValSparseBin<size_t, uint8_t>( if (rest_cnt > 0) {
num_data, num_bin, estimate_element_per_row); const int SPARSE_RATIO = 100;
} else if (num_bin <= 65536) { if (distinct_values_int.back() / SPARSE_RATIO > static_cast<int>(distinct_values_int.size())) {
return new MultiValSparseBin<size_t, uint16_t>( Log::Warning("Met categorical feature which contains sparse values. "
num_data, num_bin, estimate_element_per_row); "Consider renumbering to consecutive integers started from zero");
}
// sort by counts in descending order
Common::SortForPair<int, int>(&counts_int, &distinct_values_int, 0, true);
// will ignore the categorical of small counts
int cut_cnt = static_cast<int>(
Common::RoundInt((total_sample_cnt - na_cnt) * 0.99f));
size_t cur_cat_idx = 0; // index of current category.
categorical_2_bin_.clear();
bin_2_categorical_.clear();
int used_cnt = 0;
int distinct_cnt = static_cast<int>(distinct_values_int.size());
if (na_cnt > 0) {
++distinct_cnt;
}
max_bin = std::min(distinct_cnt, max_bin);
cnt_in_bin.clear();
// Push the dummy bin for NaN
bin_2_categorical_.push_back(-1);
categorical_2_bin_[-1] = 0;
cnt_in_bin.push_back(0);
num_bin_ = 1;
while (cur_cat_idx < distinct_values_int.size()
&& (used_cnt < cut_cnt || num_bin_ < max_bin)) {
if (counts_int[cur_cat_idx] < min_data_in_bin && cur_cat_idx > 1) {
break;
}
bin_2_categorical_.push_back(distinct_values_int[cur_cat_idx]);
categorical_2_bin_[distinct_values_int[cur_cat_idx]] = static_cast<unsigned int>(num_bin_);
used_cnt += counts_int[cur_cat_idx];
cnt_in_bin.push_back(counts_int[cur_cat_idx]);
++num_bin_;
++cur_cat_idx;
}
// Use MissingType::None to represent this bin contains all categoricals
if (cur_cat_idx == distinct_values_int.size() && na_cnt == 0) {
missing_type_ = MissingType::None;
} else { } else {
return new MultiValSparseBin<size_t, uint32_t>( missing_type_ = MissingType::NaN;
num_data, num_bin, estimate_element_per_row);
} }
// fix count of NaN bin
cnt_in_bin[0] = static_cast<int>(total_sample_cnt - used_cnt);
} }
} }
template <> // check trivial(num_bin_ == 1) feature
const void* DenseBin<uint8_t, false>::GetColWiseData( if (num_bin_ <= 1) {
uint8_t* bit_type, is_trivial_ = true;
bool* is_sparse, } else {
std::vector<BinIterator*>* bin_iterator, is_trivial_ = false;
const int /*num_threads*/) const {
*is_sparse = false;
*bit_type = 8;
bin_iterator->clear();
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint16_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int /*num_threads*/) const {
*is_sparse = false;
*bit_type = 16;
bin_iterator->clear();
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint32_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int /*num_threads*/) const {
*is_sparse = false;
*bit_type = 32;
bin_iterator->clear();
return reinterpret_cast<const void*>(data_.data());
} }
// check useless bin
template <> if (!is_trivial_ && pre_filter && NeedFilter(cnt_in_bin, static_cast<int>(total_sample_cnt), min_split_data, bin_type_)) {
const void* DenseBin<uint8_t, true>::GetColWiseData( is_trivial_ = true;
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int /*num_threads*/) const {
*is_sparse = false;
*bit_type = 4;
bin_iterator->clear();
return reinterpret_cast<const void*>(data_.data());
} }
template <> if (!is_trivial_) {
const void* DenseBin<uint8_t, false>::GetColWiseData( default_bin_ = ValueToBin(0);
uint8_t* bit_type, most_freq_bin_ =
bool* is_sparse, static_cast<uint32_t>(ArrayArgs<int>::ArgMax(cnt_in_bin));
BinIterator** bin_iterator) const { const double max_sparse_rate =
*is_sparse = false; static_cast<double>(cnt_in_bin[most_freq_bin_]) / total_sample_cnt;
*bit_type = 8; // When most_freq_bin_ != default_bin_, there are some additional data loading costs.
*bin_iterator = nullptr; // so use most_freq_bin_ = default_bin_ when there is not so sparse
return reinterpret_cast<const void*>(data_.data()); if (most_freq_bin_ != default_bin_ && max_sparse_rate < kSparseThreshold) {
} most_freq_bin_ = default_bin_;
template <>
const void* DenseBin<uint16_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = false;
*bit_type = 16;
*bin_iterator = nullptr;
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint32_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = false;
*bit_type = 32;
*bin_iterator = nullptr;
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint8_t, true>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = false;
*bit_type = 4;
*bin_iterator = nullptr;
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* SparseBin<uint8_t>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int num_threads) const {
*is_sparse = true;
*bit_type = 8;
for (int thread_index = 0; thread_index < num_threads; ++thread_index) {
bin_iterator->emplace_back(new SparseBinIterator<uint8_t>(this, 0));
} }
return nullptr; sparse_rate_ =
static_cast<double>(cnt_in_bin[most_freq_bin_]) / total_sample_cnt;
} else {
sparse_rate_ = 1.0f;
} }
}
template <>
const void* SparseBin<uint16_t>::GetColWiseData( void BinMapper::CopyTo(char * buffer) const {
uint8_t* bit_type, std::memcpy(buffer, &num_bin_, sizeof(num_bin_));
bool* is_sparse, buffer += VirtualFileWriter::AlignedSize(sizeof(num_bin_));
std::vector<BinIterator*>* bin_iterator, std::memcpy(buffer, &missing_type_, sizeof(missing_type_));
const int num_threads) const { buffer += VirtualFileWriter::AlignedSize(sizeof(missing_type_));
*is_sparse = true; std::memcpy(buffer, &is_trivial_, sizeof(is_trivial_));
*bit_type = 16; buffer += VirtualFileWriter::AlignedSize(sizeof(is_trivial_));
for (int thread_index = 0; thread_index < num_threads; ++thread_index) { std::memcpy(buffer, &sparse_rate_, sizeof(sparse_rate_));
bin_iterator->emplace_back(new SparseBinIterator<uint16_t>(this, 0)); buffer += sizeof(sparse_rate_);
} std::memcpy(buffer, &bin_type_, sizeof(bin_type_));
return nullptr; buffer += VirtualFileWriter::AlignedSize(sizeof(bin_type_));
std::memcpy(buffer, &min_val_, sizeof(min_val_));
buffer += sizeof(min_val_);
std::memcpy(buffer, &max_val_, sizeof(max_val_));
buffer += sizeof(max_val_);
std::memcpy(buffer, &default_bin_, sizeof(default_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(default_bin_));
std::memcpy(buffer, &most_freq_bin_, sizeof(most_freq_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(most_freq_bin_));
if (bin_type_ == BinType::NumericalBin) {
std::memcpy(buffer, bin_upper_bound_.data(), num_bin_ * sizeof(double));
} else {
std::memcpy(buffer, bin_2_categorical_.data(), num_bin_ * sizeof(int));
} }
}
template <>
const void* SparseBin<uint32_t>::GetColWiseData( void BinMapper::CopyFrom(const char * buffer) {
uint8_t* bit_type, std::memcpy(&num_bin_, buffer, sizeof(num_bin_));
bool* is_sparse, buffer += VirtualFileWriter::AlignedSize(sizeof(num_bin_));
std::vector<BinIterator*>* bin_iterator, std::memcpy(&missing_type_, buffer, sizeof(missing_type_));
const int num_threads) const { buffer += VirtualFileWriter::AlignedSize(sizeof(missing_type_));
*is_sparse = true; std::memcpy(&is_trivial_, buffer, sizeof(is_trivial_));
*bit_type = 32; buffer += VirtualFileWriter::AlignedSize(sizeof(is_trivial_));
for (int thread_index = 0; thread_index < num_threads; ++thread_index) { std::memcpy(&sparse_rate_, buffer, sizeof(sparse_rate_));
bin_iterator->emplace_back(new SparseBinIterator<uint32_t>(this, 0)); buffer += sizeof(sparse_rate_);
std::memcpy(&bin_type_, buffer, sizeof(bin_type_));
buffer += VirtualFileWriter::AlignedSize(sizeof(bin_type_));
std::memcpy(&min_val_, buffer, sizeof(min_val_));
buffer += sizeof(min_val_);
std::memcpy(&max_val_, buffer, sizeof(max_val_));
buffer += sizeof(max_val_);
std::memcpy(&default_bin_, buffer, sizeof(default_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(default_bin_));
std::memcpy(&most_freq_bin_, buffer, sizeof(most_freq_bin_));
buffer += VirtualFileWriter::AlignedSize(sizeof(most_freq_bin_));
if (bin_type_ == BinType::NumericalBin) {
bin_upper_bound_ = std::vector<double>(num_bin_);
std::memcpy(bin_upper_bound_.data(), buffer, num_bin_ * sizeof(double));
} else {
bin_2_categorical_ = std::vector<int>(num_bin_);
std::memcpy(bin_2_categorical_.data(), buffer, num_bin_ * sizeof(int));
categorical_2_bin_.clear();
for (int i = 0; i < num_bin_; ++i) {
categorical_2_bin_[bin_2_categorical_[i]] = static_cast<unsigned int>(i);
} }
return nullptr;
} }
}
template <>
const void* SparseBin<uint8_t>::GetColWiseData( void BinMapper::SaveBinaryToFile(BinaryWriter* writer) const {
uint8_t* bit_type, writer->AlignedWrite(&num_bin_, sizeof(num_bin_));
bool* is_sparse, writer->AlignedWrite(&missing_type_, sizeof(missing_type_));
BinIterator** bin_iterator) const { writer->AlignedWrite(&is_trivial_, sizeof(is_trivial_));
*is_sparse = true; writer->Write(&sparse_rate_, sizeof(sparse_rate_));
*bit_type = 8; writer->AlignedWrite(&bin_type_, sizeof(bin_type_));
*bin_iterator = new SparseBinIterator<uint8_t>(this, 0); writer->Write(&min_val_, sizeof(min_val_));
return nullptr; writer->Write(&max_val_, sizeof(max_val_));
writer->AlignedWrite(&default_bin_, sizeof(default_bin_));
writer->AlignedWrite(&most_freq_bin_, sizeof(most_freq_bin_));
if (bin_type_ == BinType::NumericalBin) {
writer->Write(bin_upper_bound_.data(), sizeof(double) * num_bin_);
} else {
writer->Write(bin_2_categorical_.data(), sizeof(int) * num_bin_);
} }
}
template <>
const void* SparseBin<uint16_t>::GetColWiseData( size_t BinMapper::SizesInByte() const {
uint8_t* bit_type, size_t ret = VirtualFileWriter::AlignedSize(sizeof(num_bin_)) +
bool* is_sparse, VirtualFileWriter::AlignedSize(sizeof(missing_type_)) +
BinIterator** bin_iterator) const { VirtualFileWriter::AlignedSize(sizeof(is_trivial_)) +
*is_sparse = true; sizeof(sparse_rate_) +
*bit_type = 16; VirtualFileWriter::AlignedSize(sizeof(bin_type_)) +
*bin_iterator = new SparseBinIterator<uint16_t>(this, 0); sizeof(min_val_) + sizeof(max_val_) +
return nullptr; VirtualFileWriter::AlignedSize(sizeof(default_bin_)) +
VirtualFileWriter::AlignedSize(sizeof(most_freq_bin_));
if (bin_type_ == BinType::NumericalBin) {
ret += sizeof(double) * num_bin_;
} else {
ret += sizeof(int) * num_bin_;
} }
return ret;
template <> }
const void* SparseBin<uint32_t>::GetColWiseData(
uint8_t* bit_type, template class DenseBin<uint8_t, true>;
bool* is_sparse, template class DenseBin<uint8_t, false>;
BinIterator** bin_iterator) const { template class DenseBin<uint16_t, false>;
*is_sparse = true; template class DenseBin<uint32_t, false>;
*bit_type = 32;
*bin_iterator = new SparseBinIterator<uint32_t>(this, 0); template class SparseBin<uint8_t>;
return nullptr; template class SparseBin<uint16_t>;
template class SparseBin<uint32_t>;
template class MultiValDenseBin<uint8_t>;
template class MultiValDenseBin<uint16_t>;
template class MultiValDenseBin<uint32_t>;
Bin* Bin::CreateDenseBin(data_size_t num_data, int num_bin) {
if (num_bin <= 16) {
return new DenseBin<uint8_t, true>(num_data);
} else if (num_bin <= 256) {
return new DenseBin<uint8_t, false>(num_data);
} else if (num_bin <= 65536) {
return new DenseBin<uint16_t, false>(num_data);
} else {
return new DenseBin<uint32_t, false>(num_data);
} }
}
#ifdef USE_CUDA
template <> Bin* Bin::CreateSparseBin(data_size_t num_data, int num_bin) {
const void* MultiValDenseBin<uint8_t>::GetRowWiseData(uint8_t* bit_type, if (num_bin <= 256) {
size_t* total_size, return new SparseBin<uint8_t>(num_data);
bool* is_sparse, } else if (num_bin <= 65536) {
const void** out_data_ptr, return new SparseBin<uint16_t>(num_data);
uint8_t* data_ptr_bit_type) const { } else {
const uint8_t* to_return = data_.data(); return new SparseBin<uint32_t>(num_data);
*bit_type = 8;
*total_size = static_cast<size_t>(num_data_) * static_cast<size_t>(num_feature_);
CHECK_EQ(*total_size, data_.size());
*is_sparse = false;
*out_data_ptr = nullptr;
*data_ptr_bit_type = 0;
return to_return;
} }
}
template <>
const void* MultiValDenseBin<uint16_t>::GetRowWiseData(uint8_t* bit_type, MultiValBin* MultiValBin::CreateMultiValBin(data_size_t num_data, int num_bin, int num_feature,
size_t* total_size, double sparse_rate, const std::vector<uint32_t>& offsets) {
bool* is_sparse, if (sparse_rate >= multi_val_bin_sparse_threshold) {
const void** out_data_ptr, const double average_element_per_row = (1.0 - sparse_rate) * num_feature;
uint8_t* data_ptr_bit_type) const { return CreateMultiValSparseBin(num_data, num_bin,
const uint16_t* data_ptr = data_.data(); average_element_per_row);
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_ptr); } else {
*bit_type = 16; return CreateMultiValDenseBin(num_data, num_bin, num_feature, offsets);
*total_size = static_cast<size_t>(num_data_) * static_cast<size_t>(num_feature_);
CHECK_EQ(*total_size, data_.size());
*is_sparse = false;
*out_data_ptr = nullptr;
*data_ptr_bit_type = 0;
return to_return;
} }
}
template <>
const void* MultiValDenseBin<uint32_t>::GetRowWiseData(uint8_t* bit_type, MultiValBin* MultiValBin::CreateMultiValDenseBin(data_size_t num_data,
size_t* total_size, int num_bin,
bool* is_sparse, int num_feature,
const void** out_data_ptr, const std::vector<uint32_t>& offsets) {
uint8_t* data_ptr_bit_type) const { // calculate max bin of all features to select the int type in MultiValDenseBin
const uint32_t* data_ptr = data_.data(); int max_bin = 0;
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_ptr); for (int i = 0; i < static_cast<int>(offsets.size()) - 1; ++i) {
*bit_type = 32; int feature_bin = offsets[i + 1] - offsets[i];
*total_size = static_cast<size_t>(num_data_) * static_cast<size_t>(num_feature_); if (feature_bin > max_bin) {
CHECK_EQ(*total_size, data_.size()); max_bin = feature_bin;
*is_sparse = false; }
*out_data_ptr = nullptr;
*data_ptr_bit_type = 0;
return to_return;
}
template <>
const void* MultiValSparseBin<uint16_t, uint8_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = data_.data();
*bit_type = 8;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 16;
return to_return;
}
template <>
const void* MultiValSparseBin<uint16_t, uint16_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 16;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 16;
return to_return;
}
template <>
const void* MultiValSparseBin<uint16_t, uint32_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 32;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 16;
return to_return;
} }
if (max_bin <= 256) {
template <> return new MultiValDenseBin<uint8_t>(num_data, num_bin, num_feature, offsets);
const void* MultiValSparseBin<uint32_t, uint8_t>::GetRowWiseData( } else if (max_bin <= 65536) {
uint8_t* bit_type, return new MultiValDenseBin<uint16_t>(num_data, num_bin, num_feature, offsets);
size_t* total_size, } else {
bool* is_sparse, return new MultiValDenseBin<uint32_t>(num_data, num_bin, num_feature, offsets);
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = data_.data();
*bit_type = 8;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 32;
return to_return;
} }
}
template <>
const void* MultiValSparseBin<uint32_t, uint16_t>::GetRowWiseData( MultiValBin* MultiValBin::CreateMultiValSparseBin(data_size_t num_data,
uint8_t* bit_type, int num_bin,
size_t* total_size, double estimate_element_per_row) {
bool* is_sparse, size_t estimate_total_entries =
const void** out_data_ptr, static_cast<size_t>(estimate_element_per_row * 1.1 * num_data);
uint8_t* data_ptr_bit_type) const { if (estimate_total_entries <= std::numeric_limits<uint16_t>::max()) {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data()); if (num_bin <= 256) {
*bit_type = 16; return new MultiValSparseBin<uint16_t, uint8_t>(
*total_size = data_.size(); num_data, num_bin, estimate_element_per_row);
*is_sparse = true; } else if (num_bin <= 65536) {
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data()); return new MultiValSparseBin<uint16_t, uint16_t>(
*data_ptr_bit_type = 32; num_data, num_bin, estimate_element_per_row);
return to_return; } else {
return new MultiValSparseBin<uint16_t, uint32_t>(
num_data, num_bin, estimate_element_per_row);
}
} else if (estimate_total_entries <= std::numeric_limits<uint32_t>::max()) {
if (num_bin <= 256) {
return new MultiValSparseBin<uint32_t, uint8_t>(
num_data, num_bin, estimate_element_per_row);
} else if (num_bin <= 65536) {
return new MultiValSparseBin<uint32_t, uint16_t>(
num_data, num_bin, estimate_element_per_row);
} else {
return new MultiValSparseBin<uint32_t, uint32_t>(
num_data, num_bin, estimate_element_per_row);
}
} else {
if (num_bin <= 256) {
return new MultiValSparseBin<size_t, uint8_t>(
num_data, num_bin, estimate_element_per_row);
} else if (num_bin <= 65536) {
return new MultiValSparseBin<size_t, uint16_t>(
num_data, num_bin, estimate_element_per_row);
} else {
return new MultiValSparseBin<size_t, uint32_t>(
num_data, num_bin, estimate_element_per_row);
}
} }
}
template <>
const void* MultiValSparseBin<uint32_t, uint32_t>::GetRowWiseData( template <>
uint8_t* bit_type, const void* DenseBin<uint8_t, false>::GetColWiseData(
size_t* total_size, uint8_t* bit_type,
bool* is_sparse, bool* is_sparse,
const void** out_data_ptr, std::vector<BinIterator*>* bin_iterator,
uint8_t* data_ptr_bit_type) const { const int /*num_threads*/) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data()); *is_sparse = false;
*bit_type = 32; *bit_type = 8;
*total_size = data_.size(); bin_iterator->clear();
*is_sparse = true; return reinterpret_cast<const void*>(data_.data());
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data()); }
*data_ptr_bit_type = 32;
return to_return; template <>
const void* DenseBin<uint16_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int /*num_threads*/) const {
*is_sparse = false;
*bit_type = 16;
bin_iterator->clear();
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint32_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int /*num_threads*/) const {
*is_sparse = false;
*bit_type = 32;
bin_iterator->clear();
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint8_t, true>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int /*num_threads*/) const {
*is_sparse = false;
*bit_type = 4;
bin_iterator->clear();
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint8_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = false;
*bit_type = 8;
*bin_iterator = nullptr;
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint16_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = false;
*bit_type = 16;
*bin_iterator = nullptr;
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint32_t, false>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = false;
*bit_type = 32;
*bin_iterator = nullptr;
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* DenseBin<uint8_t, true>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = false;
*bit_type = 4;
*bin_iterator = nullptr;
return reinterpret_cast<const void*>(data_.data());
}
template <>
const void* SparseBin<uint8_t>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
std::vector<BinIterator*>* bin_iterator,
const int num_threads) const {
*is_sparse = true;
*bit_type = 8;
for (int thread_index = 0; thread_index < num_threads; ++thread_index) {
bin_iterator->emplace_back(new SparseBinIterator<uint8_t>(this, 0));
} }
return nullptr;
template <> }
const void* MultiValSparseBin<uint64_t, uint8_t>::GetRowWiseData(
uint8_t* bit_type, template <>
size_t* total_size, const void* SparseBin<uint16_t>::GetColWiseData(
bool* is_sparse, uint8_t* bit_type,
const void** out_data_ptr, bool* is_sparse,
uint8_t* data_ptr_bit_type) const { std::vector<BinIterator*>* bin_iterator,
const uint8_t* to_return = data_.data(); const int num_threads) const {
*bit_type = 8; *is_sparse = true;
*total_size = data_.size(); *bit_type = 16;
*is_sparse = true; for (int thread_index = 0; thread_index < num_threads; ++thread_index) {
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data()); bin_iterator->emplace_back(new SparseBinIterator<uint16_t>(this, 0));
*data_ptr_bit_type = 64;
return to_return;
} }
return nullptr;
template <> }
const void* MultiValSparseBin<uint64_t, uint16_t>::GetRowWiseData(
uint8_t* bit_type, template <>
size_t* total_size, const void* SparseBin<uint32_t>::GetColWiseData(
bool* is_sparse, uint8_t* bit_type,
const void** out_data_ptr, bool* is_sparse,
uint8_t* data_ptr_bit_type) const { std::vector<BinIterator*>* bin_iterator,
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data()); const int num_threads) const {
*bit_type = 16; *is_sparse = true;
*total_size = data_.size(); *bit_type = 32;
*is_sparse = true; for (int thread_index = 0; thread_index < num_threads; ++thread_index) {
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data()); bin_iterator->emplace_back(new SparseBinIterator<uint32_t>(this, 0));
*data_ptr_bit_type = 64;
return to_return;
} }
return nullptr;
template <> }
const void* MultiValSparseBin<uint64_t, uint32_t>::GetRowWiseData(
uint8_t* bit_type, template <>
const void* SparseBin<uint8_t>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = true;
*bit_type = 8;
*bin_iterator = new SparseBinIterator<uint8_t>(this, 0);
return nullptr;
}
template <>
const void* SparseBin<uint16_t>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = true;
*bit_type = 16;
*bin_iterator = new SparseBinIterator<uint16_t>(this, 0);
return nullptr;
}
template <>
const void* SparseBin<uint32_t>::GetColWiseData(
uint8_t* bit_type,
bool* is_sparse,
BinIterator** bin_iterator) const {
*is_sparse = true;
*bit_type = 32;
*bin_iterator = new SparseBinIterator<uint32_t>(this, 0);
return nullptr;
}
#ifdef USE_CUDA
template <>
const void* MultiValDenseBin<uint8_t>::GetRowWiseData(uint8_t* bit_type,
size_t* total_size, size_t* total_size,
bool* is_sparse, bool* is_sparse,
const void** out_data_ptr, const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const { uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data()); const uint8_t* to_return = data_.data();
*bit_type = 32; *bit_type = 8;
*total_size = data_.size(); *total_size = static_cast<size_t>(num_data_) * static_cast<size_t>(num_feature_);
*is_sparse = true; CHECK_EQ(*total_size, data_.size());
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data()); *is_sparse = false;
*data_ptr_bit_type = 64; *out_data_ptr = nullptr;
return to_return; *data_ptr_bit_type = 0;
} return to_return;
}
#endif // USE_CUDA
template <>
const void* MultiValDenseBin<uint16_t>::GetRowWiseData(uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint16_t* data_ptr = data_.data();
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_ptr);
*bit_type = 16;
*total_size = static_cast<size_t>(num_data_) * static_cast<size_t>(num_feature_);
CHECK_EQ(*total_size, data_.size());
*is_sparse = false;
*out_data_ptr = nullptr;
*data_ptr_bit_type = 0;
return to_return;
}
template <>
const void* MultiValDenseBin<uint32_t>::GetRowWiseData(uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint32_t* data_ptr = data_.data();
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_ptr);
*bit_type = 32;
*total_size = static_cast<size_t>(num_data_) * static_cast<size_t>(num_feature_);
CHECK_EQ(*total_size, data_.size());
*is_sparse = false;
*out_data_ptr = nullptr;
*data_ptr_bit_type = 0;
return to_return;
}
template <>
const void* MultiValSparseBin<uint16_t, uint8_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = data_.data();
*bit_type = 8;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 16;
return to_return;
}
template <>
const void* MultiValSparseBin<uint16_t, uint16_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 16;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 16;
return to_return;
}
template <>
const void* MultiValSparseBin<uint16_t, uint32_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 32;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 16;
return to_return;
}
template <>
const void* MultiValSparseBin<uint32_t, uint8_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = data_.data();
*bit_type = 8;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 32;
return to_return;
}
template <>
const void* MultiValSparseBin<uint32_t, uint16_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 16;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 32;
return to_return;
}
template <>
const void* MultiValSparseBin<uint32_t, uint32_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 32;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 32;
return to_return;
}
template <>
const void* MultiValSparseBin<uint64_t, uint8_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = data_.data();
*bit_type = 8;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 64;
return to_return;
}
template <>
const void* MultiValSparseBin<uint64_t, uint16_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 16;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 64;
return to_return;
}
template <>
const void* MultiValSparseBin<uint64_t, uint32_t>::GetRowWiseData(
uint8_t* bit_type,
size_t* total_size,
bool* is_sparse,
const void** out_data_ptr,
uint8_t* data_ptr_bit_type) const {
const uint8_t* to_return = reinterpret_cast<const uint8_t*>(data_.data());
*bit_type = 32;
*total_size = data_.size();
*is_sparse = true;
*out_data_ptr = reinterpret_cast<const uint8_t*>(row_ptr_.data());
*data_ptr_bit_type = 64;
return to_return;
}
#endif // USE_CUDA
} // namespace LightGBM } // namespace LightGBM
src/io/config.cpp
View file @ 548cec82
...@@ -9,7 +9,12 @@ ...@@ -9,7 +9,12 @@
#include <LightGBM/utils/log.h> #include <LightGBM/utils/log.h>
#include <LightGBM/utils/random.h> #include <LightGBM/utils/random.h>
#include <algorithm>
#include <limits> #include <limits>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
namespace LightGBM { namespace LightGBM {
......
src/io/config_auto.cpp
View file @ 548cec82
...@@ -5,7 +5,13 @@ ...@@ -5,7 +5,13 @@
* \note * \note
* This file is auto generated by LightGBM\.ci\parameter-generator.py from LightGBM\include\LightGBM\config.h file. * This file is auto generated by LightGBM\.ci\parameter-generator.py from LightGBM\include\LightGBM\config.h file.
*/ */
#include<LightGBM/config.h> #include <LightGBM/config.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
namespace LightGBM { namespace LightGBM {
const std::unordered_map<std::string, std::string>& Config::alias_table() { const std::unordered_map<std::string, std::string>& Config::alias_table() {
static std::unordered_map<std::string, std::string> aliases({ static std::unordered_map<std::string, std::string> aliases({
......
src/io/cuda/cuda_column_data.cpp
View file @ 548cec82
...@@ -8,6 +8,7 @@ ...@@ -8,6 +8,7 @@
#include <LightGBM/cuda/cuda_column_data.hpp> #include <LightGBM/cuda/cuda_column_data.hpp>
#include <cstdint> #include <cstdint>
#include <vector>
namespace LightGBM { namespace LightGBM {
......
src/io/cuda/cuda_metadata.cpp
View file @ 548cec82
...@@ -7,6 +7,8 @@ ...@@ -7,6 +7,8 @@
#include <LightGBM/cuda/cuda_metadata.hpp> #include <LightGBM/cuda/cuda_metadata.hpp>
#include <vector>
namespace LightGBM { namespace LightGBM {
CUDAMetadata::CUDAMetadata(const int gpu_device_id) { CUDAMetadata::CUDAMetadata(const int gpu_device_id) {
......
src/io/cuda/cuda_row_data.cpp
View file @ 548cec82
...@@ -7,6 +7,8 @@ ...@@ -7,6 +7,8 @@
#include <LightGBM/cuda/cuda_row_data.hpp> #include <LightGBM/cuda/cuda_row_data.hpp>
#include <vector>
namespace LightGBM { namespace LightGBM {
CUDARowData::CUDARowData(const Dataset* train_data, CUDARowData::CUDARowData(const Dataset* train_data,
......
src/io/dataset.cpp
View file @ 548cec82
...@@ -11,21 +11,25 @@ ...@@ -11,21 +11,25 @@
#include <LightGBM/utils/openmp_wrapper.h> #include <LightGBM/utils/openmp_wrapper.h>
#include <LightGBM/utils/threading.h> #include <LightGBM/utils/threading.h>
#include <algorithm>
#include <chrono> #include <chrono>
#include <cstdio> #include <cstdio>
#include <limits> #include <limits>
#include <memory>
#include <sstream> #include <sstream>
#include <string>
#include <unordered_map> #include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
namespace LightGBM { namespace LightGBM {
const int Dataset::kSerializedReferenceVersionLength = 2; const int Dataset::kSerializedReferenceVersionLength = 2;
const char* Dataset::serialized_reference_version = "v1"; const char* Dataset::serialized_reference_version = "v1";
const char* Dataset::binary_file_token = const char* Dataset::binary_file_token = "______LightGBM_Binary_File_Token______\n";
"______LightGBM_Binary_File_Token______\n"; const char* Dataset::binary_serialized_reference_token = "______LightGBM_Binary_Serialized_Token______\n";
const char* Dataset::binary_serialized_reference_token =
"______LightGBM_Binary_Serialized_Token______\n";
Dataset::Dataset() { Dataset::Dataset() {
data_filename_ = "noname"; data_filename_ = "noname";
......
src/io/dataset_loader.cpp
View file @ 548cec82
...@@ -10,8 +10,15 @@ ...@@ -10,8 +10,15 @@
#include <LightGBM/utils/log.h> #include <LightGBM/utils/log.h>
#include <LightGBM/utils/openmp_wrapper.h> #include <LightGBM/utils/openmp_wrapper.h>
#include <algorithm>
#include <chrono> #include <chrono>
#include <fstream> #include <fstream>
#include <memory>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
namespace LightGBM { namespace LightGBM {
......
src/io/dense_bin.hpp
View file @ 548cec82
...@@ -3,8 +3,8 @@ ...@@ -3,8 +3,8 @@
* Licensed under the MIT License. See LICENSE file in the project root for * Licensed under the MIT License. See LICENSE file in the project root for
* license information. * license information.
*/ */
#ifndef LIGHTGBM_IO_DENSE_BIN_HPP_ #ifndef LIGHTGBM_SRC_IO_DENSE_BIN_HPP_
#define LIGHTGBM_IO_DENSE_BIN_HPP_ #define LIGHTGBM_SRC_IO_DENSE_BIN_HPP_
#include <LightGBM/bin.h> #include <LightGBM/bin.h>
#include <LightGBM/cuda/vector_cudahost.h> #include <LightGBM/cuda/vector_cudahost.h>
...@@ -646,4 +646,4 @@ BinIterator* DenseBin<VAL_T, IS_4BIT>::GetIterator( ...@@ -646,4 +646,4 @@ BinIterator* DenseBin<VAL_T, IS_4BIT>::GetIterator(
} }
} // namespace LightGBM } // namespace LightGBM
#endif // LightGBM_IO_DENSE_BIN_HPP_ #endif // LIGHTGBM_SRC_IO_DENSE_BIN_HPP_
src/io/file_io.cpp
View file @ 548cec82
...@@ -8,7 +8,10 @@ ...@@ -8,7 +8,10 @@
#include <LightGBM/utils/log.h> #include <LightGBM/utils/log.h>
#include <algorithm> #include <algorithm>
#include <cstdio>
#include <memory>
#include <sstream> #include <sstream>
#include <string>
#include <unordered_map> #include <unordered_map>
namespace LightGBM { namespace LightGBM {
......
src/io/json11.cpp
View file @ 548cec82
...@@ -27,6 +27,10 @@ ...@@ -27,6 +27,10 @@
#include <cstdio> #include <cstdio>
#include <cstdlib> #include <cstdlib>
#include <limits> #include <limits>
#include <memory>
#include <string>
#include <utility>
#include <vector>
namespace json11_internal_lightgbm { namespace json11_internal_lightgbm {
......
src/io/metadata.cpp
View file @ 548cec82
...@@ -7,6 +7,7 @@ ...@@ -7,6 +7,7 @@
#include <set> #include <set>
#include <string> #include <string>
#include <unordered_map>
#include <vector> #include <vector>
namespace LightGBM { namespace LightGBM {
......
src/io/multi_val_dense_bin.hpp
View file @ 548cec82
...@@ -2,8 +2,8 @@ ...@@ -2,8 +2,8 @@
* Copyright (c) 2020 Microsoft Corporation. All rights reserved. * Copyright (c) 2020 Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See LICENSE file in the project root for license information. * Licensed under the MIT License. See LICENSE file in the project root for license information.
*/ */
#ifndef LIGHTGBM_IO_MULTI_VAL_DENSE_BIN_HPP_ #ifndef LIGHTGBM_SRC_IO_MULTI_VAL_DENSE_BIN_HPP_
#define LIGHTGBM_IO_MULTI_VAL_DENSE_BIN_HPP_ #define LIGHTGBM_SRC_IO_MULTI_VAL_DENSE_BIN_HPP_
#include <LightGBM/bin.h> #include <LightGBM/bin.h>
#include <LightGBM/utils/openmp_wrapper.h> #include <LightGBM/utils/openmp_wrapper.h>
...@@ -356,4 +356,4 @@ MultiValDenseBin<VAL_T>* MultiValDenseBin<VAL_T>::Clone() { ...@@ -356,4 +356,4 @@ MultiValDenseBin<VAL_T>* MultiValDenseBin<VAL_T>::Clone() {
} // namespace LightGBM } // namespace LightGBM
#endif // LIGHTGBM_IO_MULTI_VAL_DENSE_BIN_HPP_ #endif // LIGHTGBM_SRC_IO_MULTI_VAL_DENSE_BIN_HPP_
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment