tree-based-model #31696
Next
Next commit
first_commit for index_dataset
- Loading branch information
commit a431b31780d3af87e4ef9217ba5c846212507b05
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,72 @@ | ||
| #include "paddle/fluid/framework/fleet/index_sampler.h" | ||
|
|
||
| namespace paddle { | ||
| namespace framework { | ||
|
|
||
| std::vector<std::vector<uint64_t>> LayerWiseSampler::sample(std::vector<std::vector<uint64_t>>& user_inputs, std::vector<uint64_t>& target_ids) { | ||
| std::vector<std::vector<uint64_t>> outputs; | ||
| return outputs; | ||
| //auto ids_num = target_ids->size(); | ||
| //(ids_num * layer_counts_sum_, std::vector<uint64_t>(inputs[0].size() + 1)); | ||
|
|
||
| // std::vector<std::vector<uint64_t>> ancestors(ids_num); | ||
| // tree_->Ancestors(*input_ids, ancestors); | ||
| // int i = 0; | ||
| // for (auto it = ancestors.begin(); it != ancestors.end(); ++it) { | ||
| // auto& ancs = *it; | ||
| // if (!ancs.empty()) { | ||
| // if (ancs.size() > layer_counts_.size()) { | ||
| // ancs.resize(layer_counts_.size()); | ||
| // } | ||
|
|
||
| // auto level = tree_->tree_height(); | ||
| // for (size_t j = 0; j < ancs.size(); ++j) { | ||
| // level --; | ||
| // // sample + | ||
| // outputs->at(i).first = ancs[j]; | ||
| // outputs->at(i).second = 1; | ||
| // i ++; | ||
|
|
||
| // // sample: - | ||
| // auto layer_nodes_info = tree_->layer_nodes(level); | ||
|
|
||
| // size_t cur_layer_count = layer_counts_.at(level); | ||
| // std::unordered_set<int> neighbor_indices_set; | ||
| // std::vector<int> neighbor_indices; | ||
| // neighbor_indices_set.reserve(cur_layer_count); | ||
| // neighbor_indices.reserve(cur_layer_count); | ||
| // auto neighbors_count = layer_nodes_info.second; | ||
|
|
||
| // static __thread std::hash<std::thread::id> hasher; | ||
| // static __thread std::mt19937 rng( | ||
| // clock() + hasher(std::this_thread::get_id())); | ||
| // std::uniform_int_distribution<int> distrib(0, neighbors_count); | ||
|
|
||
| // while (neighbor_indices_set.size() < cur_layer_count) { | ||
| // int q = distrib(rng); | ||
| // auto id = layer_nodes_info.first[q].id; | ||
| // if (neighbor_indices_set.find(q) != neighbor_indices_set.end() || id == ancs[j]) { | ||
| // continue; | ||
| // } | ||
|
|
||
| // neighbor_indices_set.insert(id); | ||
| // neighbor_indices.push_back(id); | ||
| // } | ||
| // for (size_t k = 0; k < cur_layer_count; ++k) { | ||
| // outputs->at(i).first = neighbor_indices[k]; | ||
| // outputs->at(i).second = 0; | ||
| // i++; | ||
| // } | ||
| // } | ||
| // } | ||
| // } | ||
| // return; | ||
| } | ||
|
|
||
| std::vector<std::vector<uint64_t>> BeamSearchSampler::sample(std::vector<std::vector<uint64_t>>& user_inputs, std::vector<uint64_t>& target_ids) { | ||
| std::vector<std::vector<uint64_t>> outputs; | ||
| return outputs; | ||
| } | ||
|
|
||
| } // end namespace framework | ||
| } // end namespace paddle | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,62 @@ | ||
| #include <vector> | ||
| #include "paddle/fluid/framework/fleet/index_wrapper.h" | ||
| #include "paddle/fluid/framework/program_desc.h" | ||
|
|
||
| namespace paddle { | ||
| namespace framework { | ||
|
|
||
| class Sampler { | ||
| public: | ||
| virtual ~Sampler() {} | ||
| Sampler() {} | ||
|
|
||
| template <typename T> | ||
| static std::shared_ptr<Sampler> Init(const std::string& name) { | ||
| std::shared_ptr<Sampler> instance = nullptr; | ||
| instance.reset(new T(name)); | ||
| return instance; | ||
| } | ||
|
|
||
| virtual void init_layerwise_conf(const std::vector<int64_t> &layer_sample_counts) {}; | ||
| virtual void init_beamsearch_conf(const int64_t k) {}; | ||
| virtual std::vector<std::vector<uint64_t>> sample(std::vector<std::vector<uint64_t>>& user_inputs, std::vector<uint64_t>& input_targets) = 0; | ||
| }; | ||
|
|
||
| class LayerWiseSampler : public Sampler { | ||
| public: | ||
| virtual ~LayerWiseSampler() {} | ||
| LayerWiseSampler(const std::string& name) {tree_ = IndexWrapper::GetInstance()->GetTreeIndex(name);} | ||
|
|
||
| void init_layerwise_conf(const std::vector<int64_t> &layer_sample_counts) override { | ||
| for (int i = 0; i < tree_->height(); ++i) { | ||
| layer_counts_sum_ += layer_sample_counts[i] + 1; | ||
| layer_counts_.push_back(layer_sample_counts[i]); | ||
| VLOG(0) << "[INFO] level " << i << " layer_counts.push_back: " << layer_sample_counts[i]; | ||
| } | ||
| } | ||
| std::vector<std::vector<uint64_t>> sample(std::vector<std::vector<uint64_t>>& user_inputs, std::vector<uint64_t>& target_ids) override; | ||
|
|
||
| private: | ||
| std::vector<int64_t> layer_counts_; | ||
| int64_t layer_counts_sum_; | ||
| TreePtr tree_{nullptr}; | ||
| }; | ||
|
|
||
| class BeamSearchSampler : public Sampler{ | ||
| public: | ||
| virtual ~BeamSearchSampler() {} | ||
| BeamSearchSampler(const std::string& name) {tree_ = IndexWrapper::GetInstance()->GetTreeIndex(name);} | ||
|
|
||
| void init_beamsearch_conf(const int64_t k) override { | ||
| k_ = k; | ||
| return; | ||
| } | ||
| std::vector<std::vector<uint64_t>> sample(std::vector<std::vector<uint64_t>>& user_inputs, std::vector<uint64_t>& target_ids) override; | ||
|
|
||
| private: | ||
| int64_t k_; | ||
| TreePtr tree_{nullptr}; | ||
| }; | ||
|
|
||
| } // end namespace framework | ||
| } // end namespace paddle |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,115 @@ | ||
| /* Copyright (c) 2020 PaddlePaddle Authors. All Rights Reserved. | ||
| Licensed under the Apache License, Version 2.0 (the "License"); | ||
| you may not use this file except in compliance with the License. | ||
| You may obtain a copy of the License at | ||
| http://www.apache.org/licenses/LICENSE-2.0 | ||
| Unless required by applicable law or agreed to in writing, software | ||
| distributed under the License is distributed on an "AS IS" BASIS, | ||
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| See the License for the specific language governing permissions and | ||
| limitations under the License. */ | ||
|
|
||
| #include <memory> | ||
| #include <string> | ||
| #include <unordered_map> | ||
| #include <unordered_set> | ||
| #include <vector> | ||
| #include <thread> | ||
| #include <stdio.h> | ||
|
|
||
| #include <boost/algorithm/string.hpp> | ||
| #include <boost/lexical_cast.hpp> | ||
| #include "paddle/fluid/distributed/service/communicator.h" | ||
| #include "paddle/fluid/framework/fleet/index_wrapper.h" | ||
|
|
||
| namespace paddle { | ||
| namespace framework { | ||
|
|
||
| using paddle::distributed::Communicator; | ||
|
|
||
| std::shared_ptr<IndexWrapper> IndexWrapper::s_instance_(nullptr); | ||
|
|
||
| int TreeIndex::load(std::string filename) { | ||
| FILE* fp = fopen(filename.c_str(), "rb"); | ||
| if (fp == NULL) { | ||
| fprintf(stderr, "Can not open file: %s\n", filename.c_str()); | ||
| return -1; | ||
| } | ||
|
|
||
| int num = 0; | ||
| size_t ret = fread(&num, sizeof(num), 1, fp); | ||
| while (ret == 1 && num > 0) { | ||
| std::string content(num, '\0'); | ||
| if (fread(const_cast<char*>(content.data()), 1, num, fp) | ||
| != static_cast<size_t>(num)) { | ||
| fprintf(stderr, "Read from file: %s failed, invalid format.\n", | ||
| filename.c_str()); | ||
| break; | ||
| } | ||
| KVItem item; | ||
| if (!item.ParseFromString(content)) { | ||
| fprintf(stderr, "Parse from file: %s failed.\n", filename.c_str()); | ||
| break; | ||
| } | ||
| if (item.key() == ".tree_meta") { | ||
| meta_.ParseFromString(item.value()); | ||
| } else { | ||
| auto code = boost::lexical_cast<uint64_t>(item.key()); | ||
|
There was a problem hiding this comment. need to parse from bytes to uint64. |
||
| Node node; | ||
| node.ParseFromString(item.value()); | ||
| if (node.is_leaf()) { | ||
| id_codes_map_[node.id()] = code; | ||
| } | ||
| data_[code] = node; | ||
| } | ||
| ret = fread(&num, sizeof(num), 1, fp); | ||
| } | ||
| fclose(fp); | ||
| total_nodes_num_ = data_.size(); | ||
| return 0; | ||
| } | ||
|
|
||
| std::vector<uint64_t> TreeIndex::get_nodes_given_level(int level, bool ret_code) { | ||
| uint64_t level_num = static_cast<uint64_t>(std::pow(meta_.branch(), level)); | ||
| uint64_t level_offset = level_num - 1; | ||
|
|
||
| std::vector<uint64_t> res; | ||
| res.reserve(level_num); | ||
| for (uint64_t i = 0; i < level_num; i++) { | ||
| auto code = level_offset + i; | ||
| if (data_.find(code) != data_.end()) { | ||
| res.push_back(code); | ||
| } | ||
| } | ||
| if (ret_code == false) { | ||
| for (size_t i = 0; i < res.size(); i++) { | ||
| res[i] = data_[res[i]].id(); | ||
| } | ||
| } | ||
| return res; | ||
| } | ||
|
|
||
| std::vector<uint64_t> TreeIndex::get_travel_path(uint64_t id, bool ret_code, int start_level) { | ||
| std::vector<uint64_t> res; | ||
| if (id_codes_map_.find(id) == id_codes_map_.end()) { | ||
| return res; | ||
| } | ||
| res.reserve(meta_.height()); | ||
| auto code = id_codes_map_[id]; | ||
| res.push_back(code); | ||
| int level = meta_.height() - 1; | ||
|
|
||
| while (--level >= start_level) { | ||
| code = (code - 1) / meta_.branch(); | ||
| res.push_back(code); | ||
| } | ||
| if (ret_code == false) { | ||
| for (size_t i = 0; i < res.size(); i++) { | ||
| res[i] = data_[res[i]].id(); | ||
| } | ||
| } | ||
| return res; | ||
| } | ||
|
|
||
| } // end namespace framework | ||
| } // end namespace paddle | ||
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
namespace upgrade.