Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
tianlh
LightGBM-DCU
Commits
2051223b
Commit
2051223b
authored
Mar 05, 2020
by
guolinke
Browse files
better naming
parent
77d92b7c
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
17 additions
and
17 deletions
+17
-17
src/treelearner/feature_histogram.hpp
src/treelearner/feature_histogram.hpp
+17
-17
No files found.
src/treelearner/feature_histogram.hpp
View file @
2051223b
...
...
@@ -149,12 +149,12 @@ class FeatureHistogram {
double
min_gain_shift
=
BeforeNumercal
<
USE_RAND
,
USE_L1
,
USE_MAX_OUTPUT
>
(
sum_gradient
,
sum_hessian
,
output
,
&
rand_threshold
);
FindBestThresholdSequen
ce
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
true
,
false
>
(
FindBestThresholdSequen
tially
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
true
,
false
>
(
sum_gradient
,
sum_hessian
,
num_data
,
constraints
,
min_gain_shift
,
output
,
rand_threshold
);
FindBestThresholdSequen
ce
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
false
,
true
,
false
>
(
FindBestThresholdSequen
tially
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
false
,
true
,
false
>
(
sum_gradient
,
sum_hessian
,
num_data
,
constraints
,
min_gain_shift
,
output
,
rand_threshold
);
};
...
...
@@ -166,12 +166,12 @@ class FeatureHistogram {
double
min_gain_shift
=
BeforeNumercal
<
USE_RAND
,
USE_L1
,
USE_MAX_OUTPUT
>
(
sum_gradient
,
sum_hessian
,
output
,
&
rand_threshold
);
FindBestThresholdSequen
ce
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
false
,
true
>
(
FindBestThresholdSequen
tially
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
false
,
true
>
(
sum_gradient
,
sum_hessian
,
num_data
,
constraints
,
min_gain_shift
,
output
,
rand_threshold
);
FindBestThresholdSequen
ce
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
false
,
false
,
true
>
(
FindBestThresholdSequen
tially
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
false
,
false
,
true
>
(
sum_gradient
,
sum_hessian
,
num_data
,
constraints
,
min_gain_shift
,
output
,
rand_threshold
);
};
...
...
@@ -185,8 +185,8 @@ class FeatureHistogram {
double
min_gain_shift
=
BeforeNumercal
<
USE_RAND
,
USE_L1
,
USE_MAX_OUTPUT
>
(
sum_gradient
,
sum_hessian
,
output
,
&
rand_threshold
);
FindBestThresholdSequen
ce
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
false
,
false
>
(
FindBestThresholdSequen
tially
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
false
,
false
>
(
sum_gradient
,
sum_hessian
,
num_data
,
constraints
,
min_gain_shift
,
output
,
rand_threshold
);
};
...
...
@@ -198,8 +198,8 @@ class FeatureHistogram {
double
min_gain_shift
=
BeforeNumercal
<
USE_RAND
,
USE_L1
,
USE_MAX_OUTPUT
>
(
sum_gradient
,
sum_hessian
,
output
,
&
rand_threshold
);
FindBestThresholdSequen
ce
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
false
,
false
>
(
FindBestThresholdSequen
tially
<
USE_RAND
,
USE_MC
,
USE_L1
,
USE_MAX_OUTPUT
,
true
,
false
,
false
>
(
sum_gradient
,
sum_hessian
,
num_data
,
constraints
,
min_gain_shift
,
output
,
rand_threshold
);
output
->
default_left
=
false
;
...
...
@@ -769,11 +769,11 @@ class FeatureHistogram {
template
<
bool
USE_RAND
,
bool
USE_MC
,
bool
USE_L1
,
bool
USE_MAX_OUTPUT
,
bool
REVERSE
,
bool
SKIP_DEFAULT_BIN
,
bool
NA_AS_MISSING
>
void
FindBestThresholdSequen
ce
(
double
sum_gradient
,
double
sum_hessian
,
data_size_t
num_data
,
const
ConstraintEntry
&
constraints
,
double
min_gain_shift
,
SplitInfo
*
output
,
int
rand_threshold
)
{
void
FindBestThresholdSequen
tially
(
double
sum_gradient
,
double
sum_hessian
,
data_size_t
num_data
,
const
ConstraintEntry
&
constraints
,
double
min_gain_shift
,
SplitInfo
*
output
,
int
rand_threshold
)
{
const
int8_t
offset
=
meta_
->
offset
;
double
best_sum_left_gradient
=
NAN
;
double
best_sum_left_hessian
=
NAN
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment