Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[c++] Initial Work for Pairwise Ranking #6182

Open
wants to merge 88 commits into
base: master
Choose a base branch
from
Open
Changes from 1 commit
Commits
Show all changes
88 commits
Select commit Hold shift + click to select a range
9ae3476
initial work for pairwise ranking (dataset part)
shiyu1994 Nov 8, 2023
2314099
remove unrelated changes
shiyu1994 Nov 8, 2023
06ddf68
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Nov 8, 2023
42e91e2
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Nov 23, 2023
a8379d4
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Dec 1, 2023
da5f02d
first version of pairwie ranking bin
shiyu1994 Dec 5, 2023
9d0afd9
Merge branch 'pairwise-ranking-dev' of https://github.com/Microsoft/L…
shiyu1994 Dec 5, 2023
0cb436d
templates for bins in pairwise ranking dataset
shiyu1994 Dec 5, 2023
fc9b381
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Dec 5, 2023
6fbc674
fix lint issues and compilation errors
shiyu1994 Dec 6, 2023
6082913
Merge branch 'pairwise-ranking-dev' of https://github.com/Microsoft/L…
shiyu1994 Dec 6, 2023
9e16dc3
add methods for pairwise bin
shiyu1994 Dec 6, 2023
6154bde
instantiate templates
shiyu1994 Dec 6, 2023
3a646eb
remove unrelated files
shiyu1994 Dec 6, 2023
9e77ab9
add return values for unimplemented methods
shiyu1994 Dec 7, 2023
eba4560
add new files and windows/LightGBM.vcxproj and windows/LightGBM.vcxpr…
shiyu1994 Dec 7, 2023
f1d2281
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Dec 7, 2023
873d7ad
create pairwise dataset
shiyu1994 Dec 7, 2023
3838b9b
Merge branch 'pairwise-ranking-dev' of https://github.com/Microsoft/L…
shiyu1994 Dec 7, 2023
986a979
set num_data_ of pairwise dataset
shiyu1994 Dec 7, 2023
c40965a
skip query with no paired items
shiyu1994 Dec 15, 2023
97d34d7
store original query information
shiyu1994 Jan 31, 2024
1e57e27
copy position information for pairwise dataset
shiyu1994 Jan 31, 2024
1699c06
rename to pointwise members
shiyu1994 Feb 1, 2024
d5b6f0a
adding initial support for pairwise gradients and NDCG eval with pair…
metpavel Feb 9, 2024
2ee1199
fix score offsets
metpavel Feb 9, 2024
fe10a2c
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Feb 19, 2024
0aaf090
skip copy for weights and label if none
shiyu1994 Feb 19, 2024
8714bfb
fix pairwise dataset bugs
shiyu1994 Feb 29, 2024
250996b
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Feb 29, 2024
38b2f3e
fix validation set with pairwise lambda rank
shiyu1994 Feb 29, 2024
09fff25
Merge branch 'pairwise-ranking-dev' of https://github.com/Microsoft/L…
shiyu1994 Feb 29, 2024
ba3c815
fix pairwise ranking objective initialization
shiyu1994 Feb 29, 2024
d9b537d
keep the original query boundaries and add pairwise query boundaries
shiyu1994 Feb 29, 2024
362baf8
allow empty queries in pairwise query boundaries
shiyu1994 Mar 1, 2024
06597ac
fix query boundaries
shiyu1994 Mar 1, 2024
18e3a1b
clean up
shiyu1994 Mar 1, 2024
43b8582
various fixes
metpavel Mar 1, 2024
ad4e89f
construct all pairs for validation set
shiyu1994 Mar 1, 2024
dc17309
Merge branch 'pairwise-ranking-dev' of https://github.com/microsoft/L…
metpavel Mar 1, 2024
1ad78b2
fix for validation set
shiyu1994 Mar 1, 2024
9cd3b93
fix validation pairs
shiyu1994 Mar 1, 2024
f9d9c07
fatal error when no query boundary is provided
shiyu1994 Mar 1, 2024
97e0a81
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Mar 1, 2024
746bc82
add differential features
shiyu1994 Mar 8, 2024
f9ab075
add differential features
shiyu1994 Mar 20, 2024
7aa170b
bug fixing and efficiency improvement
metpavel Mar 25, 2024
abdb716
add feature group for differential features
shiyu1994 Mar 27, 2024
3cdfd83
refactor template initializations with macro
shiyu1994 Mar 28, 2024
3703495
tree learning with differential features
shiyu1994 Mar 28, 2024
8f55a93
avoid copy sampled values
shiyu1994 Mar 28, 2024
8c3e7be
fix sampled indices
shiyu1994 Apr 2, 2024
5aa2d17
push data into differential features
shiyu1994 Apr 11, 2024
1c319b8
fix differential feature bugs
shiyu1994 Apr 17, 2024
d8eb68b
clean up debug code
shiyu1994 Apr 17, 2024
b088236
fix validation set with differential features
shiyu1994 Apr 18, 2024
2d09897
support row-wise histogram construction with pairwise ranking
shiyu1994 Jun 15, 2024
406d0c1
fix row wise in pairwise ranking
shiyu1994 Jun 20, 2024
6c65d1f
save for debug
shiyu1994 Jun 20, 2024
7738915
update code for debug
shiyu1994 Jun 28, 2024
d6c16df
save changes
shiyu1994 Jul 4, 2024
0d572d7
save changes for debug
shiyu1994 Jul 8, 2024
1f59f85
save changes
shiyu1994 Aug 21, 2024
0618bb2
add bagging by query for lambdarank
shiyu1994 Aug 27, 2024
185bdf6
Merge branch 'master' into bagging/bagging-by-query-for-lambdarank
shiyu1994 Aug 27, 2024
38fa4c2
fix pre-commit
shiyu1994 Aug 27, 2024
2fce147
Merge branch 'bagging/bagging-by-query-for-lambdarank' of https://git…
shiyu1994 Aug 27, 2024
1f7f967
Merge branch 'master' into bagging/bagging-by-query-for-lambdarank
shiyu1994 Aug 29, 2024
9e2a322
fix bagging by query with cuda
shiyu1994 Aug 29, 2024
666c51e
fix bagging by query test case
shiyu1994 Aug 30, 2024
9e2c338
fix bagging by query test case
shiyu1994 Aug 30, 2024
3abbc11
fix bagging by query test case
shiyu1994 Aug 30, 2024
13fa0a3
add #include <vector>
shiyu1994 Aug 30, 2024
b8427b0
merge bagging by query
shiyu1994 Sep 4, 2024
0258f07
update CMakeLists.txt
shiyu1994 Sep 4, 2024
90a95fa
fix bagging by query with pairwise lambdarank
shiyu1994 Sep 20, 2024
306af04
Merge branch 'master' into pairwise-ranking-dev
shiyu1994 Sep 20, 2024
b69913d
fix compilation error C3200 with visual studio
shiyu1994 Oct 10, 2024
6dba1cf
clean up main.cpp
shiyu1994 Oct 11, 2024
3b2e29d
Exposing configuration parameters for pairwise ranking
metpavel Oct 18, 2024
f1c32d3
fix bugs and pass by reference for SigmoidCache&
shiyu1994 Nov 8, 2024
51693e2
add pairing approach
shiyu1994 Nov 8, 2024
5071842
add at_least_one_relevant
shiyu1994 Nov 8, 2024
598764b
fix num bin for row wise in pairwise ranking
shiyu1994 Nov 21, 2024
f7deab4
save for debug
shiyu1994 Dec 17, 2024
0d1b310
update doc
shiyu1994 Dec 18, 2024
8f9ab26
add random_k pairing mode
shiyu1994 Feb 18, 2025
d797122
clean up code
shiyu1994 Feb 18, 2025
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Exposing configuration parameters for pairwise ranking
  • Loading branch information
metpavel committed Oct 18, 2024
commit 3b2e29d328304146afa0f826cd5901399462cd86
20 changes: 20 additions & 0 deletions include/LightGBM/config.h
Original file line number Diff line number Diff line change
@@ -1008,6 +1008,26 @@ struct Config {
// desc = used only in ``pairwise_lambdarank`` application
bool use_differential_feature_in_pairwise_ranking = false;

// desc = whether to additionaly perform indirect document comparison in pairwise ranking
// desc = used only in ``pairwise_lambdarank`` application
bool pairwise_lambdarank_model_indirect_comparison = false;

// desc = whether to model conditional document relevance (given documents ranked above) in pairwise ranking
// desc = used only in ``pairwise_lambdarank`` application
bool pairwise_lambdarank_model_conditional_rel = false;

// desc = whether to limit the indirect document comparison to only auxilliary documents ranked above in pairwise ranking
// desc = used only in ``pairwise_lambdarank`` application
bool pairwise_lambdarank_indirect_comparison_above_only = true;

// desc = whether to use logarithmic discounts when converting pairwise scores into pointwise in pairwise ranking
// desc = used only in ``pairwise_lambdarank`` application
bool pairwise_lambdarank_logarithmic_discounts = true;

// desc = whether to use hard pairwise preference when converting pairwise scores into pointwise in pairwise ranking
// desc = used only in ``pairwise_lambdarank`` application
bool pairwise_lambdarank_hard_pairwise_preference = false;

#ifndef __NVCC__
#pragma endregion

3 changes: 2 additions & 1 deletion include/LightGBM/objective_function.h
Original file line number Diff line number Diff line change
@@ -130,7 +130,8 @@ void UpdatePointwiseScoresForOneQuery(data_size_t query_id, double* score_pointw
data_size_t selected_pairs_cnt, const data_size_t* selected_pairs, const std::pair<data_size_t, data_size_t>* paired_index_map,
const std::multimap<data_size_t, data_size_t>& right2left_map, const std::multimap < data_size_t, data_size_t>& left2right_map,
const std::map<std::pair<data_size_t, data_size_t>, data_size_t>& left_right2pair_map,
int truncation_level, double sigma, CommonC::SigmoidCache sigmoid_cache);
int truncation_level, double sigma, CommonC::SigmoidCache sigmoid_cache, bool model_indirect_comparison, bool model_conditional_rel,
bool indirect_comparison_above_only, bool logarithmic_discounts, bool hard_pairwise_preference);

} // namespace LightGBM

30 changes: 30 additions & 0 deletions src/io/config_auto.cpp
Original file line number Diff line number Diff line change
@@ -308,6 +308,11 @@ const std::unordered_set<std::string>& Config::parameter_set() {
"label_gain",
"lambdarank_position_bias_regularization",
"use_differential_feature_in_pairwise_ranking",
"pairwise_lambdarank_model_indirect_comparison",
"pairwise_lambdarank_model_conditional_rel",
"pairwise_lambdarank_indirect_comparison_above_only",
"pairwise_lambdarank_logarithmic_discounts",
"pairwise_lambdarank_hard_pairwise_preference",
"metric",
"metric_freq",
"is_provide_training_metric",
@@ -633,6 +638,16 @@ void Config::GetMembersFromString(const std::unordered_map<std::string, std::str

GetBool(params, "use_differential_feature_in_pairwise_ranking", &use_differential_feature_in_pairwise_ranking);

GetBool(params, "pairwise_lambdarank_model_indirect_comparison", &pairwise_lambdarank_model_indirect_comparison);

GetBool(params, "pairwise_lambdarank_model_conditional_rel", &pairwise_lambdarank_model_conditional_rel);

GetBool(params, "pairwise_lambdarank_indirect_comparison_above_only", &pairwise_lambdarank_indirect_comparison_above_only);

GetBool(params, "pairwise_lambdarank_logarithmic_discounts", &pairwise_lambdarank_logarithmic_discounts);

GetBool(params, "pairwise_lambdarank_hard_pairwise_preference", &pairwise_lambdarank_hard_pairwise_preference);

GetInt(params, "metric_freq", &metric_freq);
CHECK_GT(metric_freq, 0);

@@ -778,6 +793,11 @@ std::string Config::SaveMembersToString() const {
str_buf << "[label_gain: " << Common::Join(label_gain, ",") << "]\n";
str_buf << "[lambdarank_position_bias_regularization: " << lambdarank_position_bias_regularization << "]\n";
str_buf << "[use_differential_feature_in_pairwise_ranking: " << use_differential_feature_in_pairwise_ranking << "]\n";
str_buf << "[pairwise_lambdarank_model_indirect_comparison: " << pairwise_lambdarank_model_indirect_comparison << "]\n";
str_buf << "[pairwise_lambdarank_model_conditional_rel: " << pairwise_lambdarank_model_conditional_rel << "]\n";
str_buf << "[pairwise_lambdarank_indirect_comparison_above_only: " << pairwise_lambdarank_indirect_comparison_above_only << "]\n";
str_buf << "[pairwise_lambdarank_logarithmic_discounts: " << pairwise_lambdarank_logarithmic_discounts << "]\n";
str_buf << "[pairwise_lambdarank_hard_pairwise_preference: " << pairwise_lambdarank_hard_pairwise_preference << "]\n";
str_buf << "[eval_at: " << Common::Join(eval_at, ",") << "]\n";
str_buf << "[multi_error_top_k: " << multi_error_top_k << "]\n";
str_buf << "[auc_mu_weights: " << Common::Join(auc_mu_weights, ",") << "]\n";
@@ -921,6 +941,11 @@ const std::unordered_map<std::string, std::vector<std::string>>& Config::paramet
{"label_gain", {}},
{"lambdarank_position_bias_regularization", {}},
{"use_differential_feature_in_pairwise_ranking", {}},
{"pairwise_lambdarank_model_indirect_comparison", {} },
{"pairwise_lambdarank_model_conditional_rel", {} },
{"pairwise_lambdarank_indirect_comparison_above_only", {} },
{"pairwise_lambdarank_logarithmic_discounts", {} },
{"pairwise_lambdarank_hard_pairwise_preference", {} },
{"metric", {"metrics", "metric_types"}},
{"metric_freq", {"output_freq"}},
{"is_provide_training_metric", {"training_metric", "is_training_metric", "train_metric"}},
@@ -1067,6 +1092,11 @@ const std::unordered_map<std::string, std::string>& Config::ParameterTypes() {
{"label_gain", "vector<double>"},
{"lambdarank_position_bias_regularization", "double"},
{"use_differential_feature_in_pairwise_ranking", "bool"},
{"pairwise_lambdarank_model_indirect_comparison", "bool" },
{"pairwise_lambdarank_model_conditional_rel", "bool" },
{"pairwise_lambdarank_indirect_comparison_above_only", "bool" },
{"pairwise_lambdarank_logarithmic_discounts", "bool" },
{"pairwise_lambdarank_hard_pairwise_preference", "bool" },
{"metric", "vector<string>"},
{"metric_freq", "int"},
{"is_provide_training_metric", "bool"},
16 changes: 13 additions & 3 deletions src/metric/rank_metric.hpp
Original file line number Diff line number Diff line change
@@ -30,7 +30,12 @@ class NDCGMetric:public Metric {
DCGCalculator::Init(label_gain);
pairwise_scores_ = config.objective == std::string("pairwise_lambdarank");
sigmoid_ = config.sigmoid;
truncation_level_ = config.lambdarank_truncation_level;
truncation_level_ = config.lambdarank_truncation_level;
model_indirect_comparison_ = config.pairwise_lambdarank_model_indirect_comparison;
model_conditional_rel_ = config.pairwise_lambdarank_model_conditional_rel;
indirect_comparison_above_only_ = config.pairwise_lambdarank_indirect_comparison_above_only;
logarithmic_discounts_ = config.pairwise_lambdarank_logarithmic_discounts;
hard_pairwise_preference_ = config.pairwise_lambdarank_hard_pairwise_preference;
}

~NDCGMetric() {
@@ -145,7 +150,7 @@ class NDCGMetric:public Metric {
std::iota(all_pairs.begin(), all_pairs.end(), 0);
UpdatePointwiseScoresForOneQuery(i, scores_pointwise_.data() + start_pointwise, score + start_pairwise, cnt_pointwise, cnt_pairwise, all_pairs.data(),
paired_index_map_ + start_pairwise, right2left_map_byquery_[i], left2right_map_byquery_[i], left_right2pair_map_byquery_[i], truncation_level_,
sigmoid_, sigmoid_cache_);
sigmoid_, sigmoid_cache_, model_indirect_comparison_, model_conditional_rel_, indirect_comparison_above_only_, logarithmic_discounts_, hard_pairwise_preference_);
}

// calculate DCG
@@ -177,7 +182,7 @@ class NDCGMetric:public Metric {
std::iota(all_pairs.begin(), all_pairs.end(), 0);
UpdatePointwiseScoresForOneQuery(i, scores_pointwise_.data() + start_pointwise, score + start_pairwise, cnt_pointwise, cnt_pairwise, all_pairs.data(),
paired_index_map_ + start_pairwise, right2left_map_byquery_[i], left2right_map_byquery_[i], left_right2pair_map_byquery_[i], truncation_level_,
sigmoid_, sigmoid_cache_);
sigmoid_, sigmoid_cache_, model_indirect_comparison_, model_conditional_rel_, indirect_comparison_above_only_, logarithmic_discounts_, hard_pairwise_preference_);
}
// calculate DCG
DCGCalculator::CalDCG(eval_at_, label_ + query_boundaries_[i],
@@ -233,6 +238,11 @@ class NDCGMetric:public Metric {
/*! \brief Number of data */
data_size_t num_data_pairwise_;
const data_size_t* query_boundaries_pairwise_;
bool model_indirect_comparison_;
bool model_conditional_rel_;
bool indirect_comparison_above_only_;
bool logarithmic_discounts_;
bool hard_pairwise_preference_;
};

} // namespace LightGBM
49 changes: 31 additions & 18 deletions src/objective/rank_objective.hpp
Original file line number Diff line number Diff line change
@@ -6,11 +6,11 @@
#ifndef LIGHTGBM_OBJECTIVE_RANK_OBJECTIVE_HPP_
#define LIGHTGBM_OBJECTIVE_RANK_OBJECTIVE_HPP_

#define model_indirect_comparisons_ false
#define model_conditional_rel_ true
#define indirect_comparisons_above_only true
#define logarithmic_discounts true
#define hard_pairwise_preference false
//#define model_indirect_comparison_ false
//#define model_conditional_rel_ true
//#define indirect_comparison_above_only_ true
//#define logarithmic_discounts_ true
//#define hard_pairwise_preference_ false

#include <LightGBM/metric.h>
#include <LightGBM/objective_function.h>
@@ -31,7 +31,8 @@ namespace LightGBM {
data_size_t selected_pairs_cnt, const data_size_t* selected_pairs, const std::pair<data_size_t, data_size_t>* paired_index_map,
const std::multimap<data_size_t, data_size_t>& right2left_map, const std::multimap < data_size_t, data_size_t>& left2right_map,
const std::map<std::pair<data_size_t, data_size_t>, data_size_t>& left_right2pair_map,
int truncation_level, double sigma, CommonC::SigmoidCache sigmoid_cache) {
int truncation_level, double sigma, CommonC::SigmoidCache sigmoid_cache, bool model_indirect_comparison, bool model_conditional_rel,
bool indirect_comparison_above_only, bool logarithmic_discounts, bool hard_pairwise_preference) {
// get sorted indices for scores
global_timer.Start("pairwise_lambdarank::UpdatePointwiseScoresForOneQuery part 0");
std::vector<data_size_t> sorted_idx(cnt_pointwise);
@@ -64,12 +65,12 @@ namespace LightGBM {
delta_score -= score_pairwise[current_pair_inverse];
comparisons++;
}
if (model_indirect_comparisons_) {
if (model_indirect_comparison) {
auto indexHead_range = right2left_map.equal_range(indexLeft);
for (auto indexHead_it = indexHead_range.first; indexHead_it != indexHead_range.second; indexHead_it++) {
data_size_t indexHead = indexHead_it->second;
if (left_right2pair_map.count(std::make_pair(indexHead, indexRight)) > 0 &&
(!(indirect_comparisons_above_only || model_conditional_rel_) || (ranks[indexHead] < ranks[indexLeft] && ranks[indexHead] < ranks[indexRight]))) {
(!(indirect_comparison_above_only || model_conditional_rel) || (ranks[indexHead] < ranks[indexLeft] && ranks[indexHead] < ranks[indexRight]))) {
data_size_t indexHeadLeft = left_right2pair_map.at(std::make_pair(indexHead, indexLeft));
data_size_t indexHeadRight = left_right2pair_map.at(std::make_pair(indexHead, indexRight));
delta_score += score_pairwise[indexHeadRight] - score_pairwise[indexHeadLeft];
@@ -80,8 +81,8 @@ namespace LightGBM {
for (auto indexTail_it = indexTail_range.first; indexTail_it != indexTail_range.second; indexTail_it++) {
data_size_t indexTail = indexTail_it->second;
if (left_right2pair_map.count(std::make_pair(indexRight, indexTail)) > 0 &&
(!indirect_comparisons_above_only || (ranks[indexTail] < ranks[indexLeft] && ranks[indexTail] < ranks[indexRight])) &&
(!model_conditional_rel_ || (ranks[indexTail] > ranks[indexLeft] && ranks[indexTail] > ranks[indexRight]))) {
(!indirect_comparison_above_only || (ranks[indexTail] < ranks[indexLeft] && ranks[indexTail] < ranks[indexRight])) &&
(!model_conditional_rel || (ranks[indexTail] > ranks[indexLeft] && ranks[indexTail] > ranks[indexRight]))) {
data_size_t indexLeftTail = left_right2pair_map.at(std::make_pair(indexLeft, indexTail));
data_size_t indexRightTail = left_right2pair_map.at(std::make_pair(indexRight, indexTail));
delta_score += score_pairwise[indexLeftTail] - score_pairwise[indexRightTail];
@@ -564,7 +565,13 @@ class RankXENDCG : public RankingObjective {

class PairwiseLambdarankNDCG: public LambdarankNDCG {
public:
explicit PairwiseLambdarankNDCG(const Config& config): LambdarankNDCG(config) {}
explicit PairwiseLambdarankNDCG(const Config& config): LambdarankNDCG(config) {
model_indirect_comparison_ = config.pairwise_lambdarank_model_indirect_comparison;
model_conditional_rel_ = config.pairwise_lambdarank_model_conditional_rel;
indirect_comparison_above_only_ = config.pairwise_lambdarank_indirect_comparison_above_only;
logarithmic_discounts_ = config.pairwise_lambdarank_logarithmic_discounts;
hard_pairwise_preference_ = config.pairwise_lambdarank_hard_pairwise_preference;
}

explicit PairwiseLambdarankNDCG(const std::vector<std::string>& strs): LambdarankNDCG(strs) {}

@@ -634,7 +641,8 @@ class PairwiseLambdarankNDCG: public LambdarankNDCG {
global_timer.Stop("pairwise_lambdarank::GetGradients part 1");
global_timer.Start("pairwise_lambdarank::GetGradients part 2");
UpdatePointwiseScoresForOneQuery(i, scores_pointwise_.data() + start_pointwise, score_pairwise + start_pairwise, cnt_pointwise, cnt_pairwise, all_pairs.data(),
paired_index_map_ + start_pairwise, right2left_map_byquery_[query_index], left2right_map_byquery_[query_index], left_right2pair_map_byquery_[query_index], truncation_level_, sigmoid_, sigmoid_cache_);
paired_index_map_ + start_pairwise, right2left_map_byquery_[query_index], left2right_map_byquery_[query_index], left_right2pair_map_byquery_[query_index], truncation_level_, sigmoid_, sigmoid_cache_,
model_indirect_comparison_, model_conditional_rel_, indirect_comparison_above_only_, logarithmic_discounts_, hard_pairwise_preference_);
global_timer.Stop("pairwise_lambdarank::GetGradients part 2");
}
if (num_position_ids_ > 0) {
@@ -736,12 +744,12 @@ class PairwiseLambdarankNDCG: public LambdarankNDCG {
delta_score -= score_pairwise[i_inverse];
comparisons++;
}
if (model_indirect_comparisons_) {
if (model_indirect_comparison_) {
auto indexHead_range = right2left_map.equal_range(indexLeft);
for (auto indexHead_it = indexHead_range.first; indexHead_it != indexHead_range.second; indexHead_it++) {
data_size_t indexHead = indexHead_it->second;
if (left_right2pair_map.count(std::make_pair(indexHead, indexRight)) > 0 &&
(!(indirect_comparisons_above_only || model_conditional_rel_) || (ranks[indexHead] < ranks[indexLeft] && ranks[indexHead] < ranks[indexRight]))) {
(!(indirect_comparison_above_only_ || model_conditional_rel_) || (ranks[indexHead] < ranks[indexLeft] && ranks[indexHead] < ranks[indexRight]))) {
data_size_t indexHeadLeft = left_right2pair_map.at(std::make_pair(indexHead, indexLeft));
data_size_t indexHeadRight = left_right2pair_map.at(std::make_pair(indexHead, indexRight));
delta_score += score_pairwise[indexHeadRight] - score_pairwise[indexHeadLeft];
@@ -752,7 +760,7 @@ class PairwiseLambdarankNDCG: public LambdarankNDCG {
for (auto indexTail_it = indexTail_range.first; indexTail_it != indexTail_range.second; indexTail_it++) {
data_size_t indexTail = indexTail_it->second;
if (left_right2pair_map.count(std::make_pair(indexRight, indexTail)) > 0 &&
(!indirect_comparisons_above_only || (ranks[indexTail] < ranks[indexLeft] && ranks[indexTail] < ranks[indexRight])) &&
(!indirect_comparison_above_only_ || (ranks[indexTail] < ranks[indexLeft] && ranks[indexTail] < ranks[indexRight])) &&
(!model_conditional_rel_ || (ranks[indexTail] > ranks[indexLeft] && ranks[indexTail] > ranks[indexRight]))) {
data_size_t indexLeftTail = left_right2pair_map.at(std::make_pair(indexLeft, indexTail));
data_size_t indexRightTail = left_right2pair_map.at(std::make_pair(indexRight, indexTail));
@@ -791,12 +799,12 @@ class PairwiseLambdarankNDCG: public LambdarankNDCG {
lambdas_pairwise[i_inverse] -= static_cast<score_t>(p_lambda / comparisons);
hessians_pairwise[i_inverse] += static_cast<score_t>(p_hessian / comparisons);
}
if (model_indirect_comparisons_) {
if (model_indirect_comparison_) {
auto indexHead_range = right2left_map.equal_range(indexLeft);
for (auto indexHead_it = indexHead_range.first; indexHead_it != indexHead_range.second; indexHead_it++) {
data_size_t indexHead = indexHead_it->second;
if (left_right2pair_map.count(std::make_pair(indexHead, indexRight)) > 0 &&
(!(indirect_comparisons_above_only || model_conditional_rel_) || (ranks[indexHead] < ranks[indexLeft] && ranks[indexHead] < ranks[indexRight]))) {
(!(indirect_comparison_above_only_ || model_conditional_rel_) || (ranks[indexHead] < ranks[indexLeft] && ranks[indexHead] < ranks[indexRight]))) {
data_size_t indexHeadLeft = left_right2pair_map.at(std::make_pair(indexHead, indexLeft));
data_size_t indexHeadRight = left_right2pair_map.at(std::make_pair(indexHead, indexRight));
lambdas_pairwise[indexHeadRight] += static_cast<score_t>(p_lambda / comparisons);
@@ -809,7 +817,7 @@ class PairwiseLambdarankNDCG: public LambdarankNDCG {
for (auto indexTail_it = indexTail_range.first; indexTail_it != indexTail_range.second; indexTail_it++) {
data_size_t indexTail = indexTail_it->second;
if (left_right2pair_map.count(std::make_pair(indexRight, indexTail)) > 0 &&
(!indirect_comparisons_above_only || (ranks[indexTail] < ranks[indexLeft] && ranks[indexTail] < ranks[indexRight])) &&
(!indirect_comparison_above_only_ || (ranks[indexTail] < ranks[indexLeft] && ranks[indexTail] < ranks[indexRight])) &&
(!model_conditional_rel_ || (ranks[indexTail] > ranks[indexLeft] && ranks[indexTail] > ranks[indexRight]))) {
data_size_t indexLeftTail = left_right2pair_map.at(std::make_pair(indexLeft, indexTail));
data_size_t indexRightTail = left_right2pair_map.at(std::make_pair(indexRight, indexTail));
@@ -856,6 +864,11 @@ class PairwiseLambdarankNDCG: public LambdarankNDCG {
/*! \brief Number of pairwise data */
data_size_t num_data_pairwise_;
mutable std::vector<double> scores_pointwise_;
bool model_indirect_comparison_;
bool model_conditional_rel_;
bool indirect_comparison_above_only_;
bool logarithmic_discounts_;
bool hard_pairwise_preference_;

private:
const std::pair<data_size_t, data_size_t>* paired_index_map_;