001503186c
This PR rewrites the approx tree method to use codebase from hist for better performance and code sharing. The rewrite has many benefits: - Support for both `max_leaves` and `max_depth`. - Support for `grow_policy`. - Support for mono constraint. - Support for feature weights. - Support for easier bin configuration (`max_bin`). - Support for categorical data. - Faster performance for most of the datasets. (many times faster) - Support for prediction cache. - Significantly better performance for external memory. - Unites the code base between approx and hist.
45 lines
1.2 KiB
C++
45 lines
1.2 KiB
C++
/*!
|
|
* Copyright 2015 by Contributors
|
|
* \file tree_updater.cc
|
|
* \brief Registry of tree updaters.
|
|
*/
|
|
#include <dmlc/registry.h>
|
|
|
|
#include "xgboost/tree_updater.h"
|
|
#include "xgboost/host_device_vector.h"
|
|
|
|
namespace dmlc {
|
|
DMLC_REGISTRY_ENABLE(::xgboost::TreeUpdaterReg);
|
|
} // namespace dmlc
|
|
|
|
namespace xgboost {
|
|
|
|
TreeUpdater* TreeUpdater::Create(const std::string& name, GenericParameter const* tparam,
|
|
ObjInfo task) {
|
|
auto* e = ::dmlc::Registry< ::xgboost::TreeUpdaterReg>::Get()->Find(name);
|
|
if (e == nullptr) {
|
|
LOG(FATAL) << "Unknown tree updater " << name;
|
|
}
|
|
auto p_updater = (e->body)(task);
|
|
p_updater->tparam_ = tparam;
|
|
return p_updater;
|
|
}
|
|
|
|
} // namespace xgboost
|
|
|
|
namespace xgboost {
|
|
namespace tree {
|
|
// List of files that will be force linked in static links.
|
|
DMLC_REGISTRY_LINK_TAG(updater_colmaker);
|
|
DMLC_REGISTRY_LINK_TAG(updater_refresh);
|
|
DMLC_REGISTRY_LINK_TAG(updater_prune);
|
|
DMLC_REGISTRY_LINK_TAG(updater_quantile_hist);
|
|
DMLC_REGISTRY_LINK_TAG(updater_histmaker);
|
|
DMLC_REGISTRY_LINK_TAG(updater_approx);
|
|
DMLC_REGISTRY_LINK_TAG(updater_sync);
|
|
#ifdef XGBOOST_USE_CUDA
|
|
DMLC_REGISTRY_LINK_TAG(updater_gpu_hist);
|
|
#endif // XGBOOST_USE_CUDA
|
|
} // namespace tree
|
|
} // namespace xgboost
|