blt-gp/include/blt/gp/program.h

582 lines
25 KiB
C
Raw Normal View History

2024-06-02 21:27:00 -04:00
#pragma once
/*
* Copyright (C) 2024 Brett Terpstra
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef BLT_GP_PROGRAM_H
#define BLT_GP_PROGRAM_H
2024-06-04 21:52:43 -04:00
#include <cstddef>
2024-06-02 21:27:00 -04:00
#include <functional>
#include <type_traits>
2024-06-03 02:29:51 -04:00
#include <string_view>
#include <string>
#include <utility>
#include <iostream>
2024-06-29 10:47:27 -04:00
#include <algorithm>
#include <memory>
2024-07-09 21:57:18 -04:00
#include <array>
2024-07-11 21:14:23 -04:00
#include <thread>
#include <mutex>
#include <atomic>
2024-06-21 22:04:57 -04:00
#include <blt/std/ranges.h>
#include <blt/std/hashmap.h>
#include <blt/std/types.h>
#include <blt/std/utility.h>
#include <blt/std/memory.h>
#include <blt/gp/fwdecl.h>
2024-06-21 22:04:57 -04:00
#include <blt/gp/typesystem.h>
#include <blt/gp/operations.h>
#include <blt/gp/transformers.h>
2024-07-09 03:57:58 -04:00
#include <blt/gp/selection.h>
2024-06-21 22:04:57 -04:00
#include <blt/gp/tree.h>
#include <blt/gp/stack.h>
#include <blt/gp/config.h>
#include <blt/gp/random.h>
2024-06-02 21:27:00 -04:00
namespace blt::gp
{
2024-06-24 21:56:51 -04:00
struct argc_t
{
blt::u32 argc = 0;
blt::u32 argc_context = 0;
[[nodiscard]] bool is_terminal() const
{
return argc == 0;
}
2024-06-24 21:56:51 -04:00
};
2024-06-30 03:20:56 -04:00
struct operator_info
{
// types of the arguments
std::vector<type_id> argument_types;
// return type of this operator
type_id return_type;
// number of arguments for this operator
argc_t argc;
// function to call this operator
detail::callable_t function;
// function used to transfer values between stacks
detail::transfer_t transfer;
2024-06-30 03:20:56 -04:00
};
2024-06-29 10:47:27 -04:00
struct operator_storage
{
// indexed from return TYPE ID, returns index of operator
blt::expanding_buffer<std::vector<operator_id>> terminals;
blt::expanding_buffer<std::vector<operator_id>> non_terminals;
2024-06-29 14:03:57 -04:00
blt::expanding_buffer<std::vector<std::pair<operator_id, blt::size_t>>> operators_ordered_terminals;
2024-06-29 10:47:27 -04:00
// indexed from OPERATOR ID (operator number)
blt::hashset_t<operator_id> static_types;
std::vector<operator_info> operators;
std::vector<detail::print_func_t> print_funcs;
std::vector<std::optional<std::string_view>> names;
2024-06-29 10:47:27 -04:00
};
template<typename Context = detail::empty_t>
2024-06-29 10:47:27 -04:00
class operator_builder
{
friend class gp_program;
2024-06-24 21:56:51 -04:00
2024-06-24 14:00:08 -04:00
friend class blt::gp::detail::operator_storage_test;
public:
2024-06-29 10:47:27 -04:00
explicit operator_builder(type_provider& system): system(system)
{}
template<typename ArgType, typename Return, typename... Args>
operator_builder& add_operator(const operation_t<ArgType, Return(Args...)>& op, bool is_static = false)
{
auto return_type_id = system.get_type<Return>().id();
2024-06-29 10:47:27 -04:00
auto operator_id = blt::gp::operator_id(storage.operators.size());
operator_info info;
2024-06-24 21:56:51 -04:00
if constexpr (sizeof...(Args) > 0)
{
(add_non_context_argument<Args>(info.argument_types), ...);
2024-06-24 21:56:51 -04:00
}
info.argc.argc_context = info.argc.argc = sizeof...(Args);
info.return_type = system.get_type<Return>().id();
2024-06-24 21:56:51 -04:00
((std::is_same_v<detail::remove_cv_ref<Args>, Context> ? info.argc.argc -= 1 : (blt::size_t) nullptr), ...);
2024-06-24 21:56:51 -04:00
2024-07-11 04:11:24 -04:00
auto& operator_list = info.argc.argc == 0 ? storage.terminals : storage.non_terminals;
operator_list[return_type_id].push_back(operator_id);
BLT_ASSERT(info.argc.argc_context - info.argc.argc <= 1 && "Cannot pass multiple context as arguments!");
2024-06-24 21:56:51 -04:00
info.function = op.template make_callable<Context>();
info.transfer = [](std::optional<std::reference_wrapper<stack_allocator>> to, stack_allocator& from) {
#if BLT_DEBUG_LEVEL >= 3
auto value = from.pop<Return>();
//BLT_TRACE_STREAM << value << "\n";
if (to){
to->get().push(value);
}
#else
if (to)
{
to->get().push(from.pop<Return>());
} else
{
from.pop<Return>();
}
#endif
};
storage.operators.push_back(info);
storage.print_funcs.push_back([](std::ostream& out, stack_allocator& stack) {
out << stack.pop<Return>();
});
storage.names.push_back(op.get_name());
if (is_static)
2024-06-29 10:47:27 -04:00
storage.static_types.insert(operator_id);
2024-06-24 21:56:51 -04:00
return *this;
}
2024-06-29 10:47:27 -04:00
operator_storage&& build()
{
blt::hashset_t<type_id> has_terminals;
for (const auto& v : blt::enumerate(storage.terminals))
{
if (!v.second.empty())
has_terminals.insert(v.first);
}
for (const auto& op_r : blt::enumerate(storage.non_terminals))
{
if (op_r.second.empty())
continue;
auto return_type = op_r.first;
std::vector<std::pair<operator_id, blt::size_t>> ordered_terminals;
for (const auto& op : op_r.second)
{
// count number of terminals
blt::size_t terminals = 0;
for (const auto& type : storage.operators[op].argument_types)
2024-06-29 10:47:27 -04:00
{
if (has_terminals.contains(type))
2024-06-29 10:47:27 -04:00
terminals++;
}
ordered_terminals.emplace_back(op, terminals);
}
2024-06-29 14:03:57 -04:00
bool found_terminal_inputs = false;
bool matches_argc = false;
2024-06-29 10:47:27 -04:00
for (const auto& terms : ordered_terminals)
{
if (terms.second == storage.operators[terms.first].argc.argc)
2024-06-29 14:03:57 -04:00
matches_argc = true;
2024-06-29 10:47:27 -04:00
if (terms.second != 0)
2024-06-29 14:03:57 -04:00
found_terminal_inputs = true;
if (matches_argc && found_terminal_inputs)
2024-06-29 10:47:27 -04:00
break;
}
2024-06-29 14:03:57 -04:00
if (!found_terminal_inputs)
BLT_ABORT(("Failed to find function with terminal arguments for return type " + std::to_string(return_type)).c_str());
if (!matches_argc)
2024-06-29 10:47:27 -04:00
{
2024-06-29 14:03:57 -04:00
BLT_ABORT(("Failed to find a function which purely translates types "
"(that is all input types are terminals) for return type " + std::to_string(return_type)).c_str());
2024-06-29 10:47:27 -04:00
}
std::sort(ordered_terminals.begin(), ordered_terminals.end(), [](const auto& a, const auto& b) {
return a.second > b.second;
});
2024-06-29 14:03:57 -04:00
auto first_size = *ordered_terminals.begin();
auto iter = ordered_terminals.begin();
while (++iter != ordered_terminals.end() && iter->second == first_size.second)
{}
ordered_terminals.erase(iter, ordered_terminals.end());
storage.operators_ordered_terminals[return_type] = ordered_terminals;
2024-06-29 10:47:27 -04:00
}
return std::move(storage);
}
private:
2024-06-26 20:24:58 -04:00
template<typename T>
void add_non_context_argument(decltype(operator_info::argument_types)& types)
2024-06-26 20:24:58 -04:00
{
if constexpr (!std::is_same_v<Context, detail::remove_cv_ref<T>>)
{
types.push_back(system.get_type<T>().id());
2024-06-26 20:24:58 -04:00
}
}
2024-06-29 10:47:27 -04:00
type_provider& system;
operator_storage storage;
};
2024-06-21 22:04:57 -04:00
class gp_program
{
public:
/**
* Note about context size: This is required as context is passed to every operator in the GP tree, this context will be provided by your
* call to one of the evaluator functions. This was the nicest way to provide this as C++ lacks reflection
*
* @param system type system to use in tree generation
2024-07-11 21:14:23 -04:00
* @param engine random engine to use throughout the program.
* @param context_size number of arguments which are always present as "context" to the GP system / operators
*/
2024-07-11 21:14:23 -04:00
explicit gp_program(type_provider& system, blt::u64 seed):
system(system), seed(seed)
{ create_threads(); }
2024-07-11 21:14:23 -04:00
explicit gp_program(type_provider& system, blt::u64 seed, prog_config_t config):
system(system), seed(seed), config(config)
{ create_threads(); }
2024-07-11 04:11:24 -04:00
template<typename Crossover, typename Mutation, typename Reproduction, typename CreationFunc = decltype(default_next_pop_creator<Crossover, Mutation, Reproduction>)>
2024-07-09 21:57:18 -04:00
void create_next_generation(Crossover&& crossover_selection, Mutation&& mutation_selection, Reproduction&& reproduction_selection,
2024-07-11 04:11:24 -04:00
CreationFunc& func = default_next_pop_creator<Crossover, Mutation, Reproduction>)
2024-07-09 03:57:58 -04:00
{
// should already be empty
next_pop.clear();
crossover_selection.pre_process(*this, current_pop, current_stats);
mutation_selection.pre_process(*this, current_pop, current_stats);
reproduction_selection.pre_process(*this, current_pop, current_stats);
2024-07-09 21:57:18 -04:00
func(get_selector_args(), std::forward<Crossover>(crossover_selection), std::forward<Mutation>(mutation_selection),
std::forward<Reproduction>(reproduction_selection));
2024-07-09 03:57:58 -04:00
}
2024-07-11 04:11:24 -04:00
void evaluate_fitness()
{
2024-07-11 21:14:23 -04:00
evaluate_fitness_internal();
2024-07-11 04:11:24 -04:00
}
/**
2024-07-11 04:11:24 -04:00
* takes in a reference to a function for the fitness evaluation function (must return a value convertable to double)
* The lambda must accept a tree for evaluation, and an index (current tree)
*
2024-07-11 04:11:24 -04:00
* tree_t& current_tree, blt::size_t index_of_tree
2024-07-09 21:57:18 -04:00
*
* Container must be concurrently accessible from multiple threads using operator[]
*
2024-07-11 04:11:24 -04:00
* NOTE: 0 is considered the best, in terms of standardized fitness
*/
2024-07-11 04:11:24 -04:00
template<typename FitnessFunc>
void generate_population(type_id root_type, FitnessFunc& fitness_function)
{
2024-07-11 04:11:24 -04:00
current_pop = config.pop_initializer.get().generate(
{*this, root_type, config.population_size, config.initial_min_tree_size, config.initial_max_tree_size});
2024-07-12 18:33:39 -04:00
if (config.threads == 1)
{
thread_execution_service = new std::function([this, &fitness_function]() {
if (thread_helper.evaluation_left > 0)
{
2024-07-12 18:33:39 -04:00
}
});
} else
{
thread_execution_service = new std::function([this, &fitness_function]() {
if (thread_helper.evaluation_left > 0)
{
thread_helper.threads_left.fetch_add(1, std::memory_order::memory_order_relaxed);
while (thread_helper.evaluation_left > 0)
{
2024-07-12 21:58:05 -04:00
blt::size_t size = 0;
2024-07-12 18:33:39 -04:00
blt::size_t begin = 0;
blt::size_t end = thread_helper.evaluation_left.load(std::memory_order_acquire);
do
{
size = std::min(end, config.evaluation_size);
begin = end - size;
} while (!thread_helper.evaluation_left.compare_exchange_weak(end, end - size,
std::memory_order::memory_order_release,
std::memory_order::memory_order_acquire));
2024-07-12 18:35:32 -04:00
2024-07-12 18:33:39 -04:00
for (blt::size_t i = begin; i < end; i++)
{
auto& ind = current_pop.get_individuals()[i];
fitness_function(ind.tree, ind.fitness, i);
auto old_best = current_stats.best_fitness.load(std::memory_order_relaxed);
while (ind.fitness.adjusted_fitness > old_best &&
!current_stats.best_fitness.compare_exchange_weak(old_best, ind.fitness.adjusted_fitness,
std::memory_order_release, std::memory_order_relaxed));
auto old_worst = current_stats.worst_fitness.load(std::memory_order_relaxed);
while (ind.fitness.adjusted_fitness < old_worst &&
!current_stats.worst_fitness.compare_exchange_weak(old_worst, ind.fitness.adjusted_fitness,
std::memory_order_release, std::memory_order_relaxed));
auto old_overall = current_stats.overall_fitness.load(std::memory_order_relaxed);
while (!current_stats.overall_fitness.compare_exchange_weak(old_overall,
ind.fitness.adjusted_fitness + old_overall,
std::memory_order_release,
std::memory_order_relaxed));
}
}
2024-07-12 18:33:39 -04:00
thread_helper.threads_left.fetch_sub(1, std::memory_order::memory_order_relaxed);
}
2024-07-12 18:33:39 -04:00
});
}
2024-07-11 21:14:23 -04:00
evaluate_fitness_internal();
}
void next_generation()
{
2024-07-09 03:57:58 -04:00
current_pop = std::move(next_pop);
current_generation++;
}
2024-07-10 22:00:28 -04:00
inline auto& get_current_pop()
{
return current_pop;
}
2024-07-09 21:57:18 -04:00
template<blt::size_t size>
std::array<blt::size_t, size> get_best_indexes()
{
2024-07-09 21:57:18 -04:00
std::array<blt::size_t, size> arr;
std::vector<std::pair<blt::size_t, double>> values;
values.reserve(current_pop.get_individuals().size());
for (const auto& ind : blt::enumerate(current_pop.get_individuals()))
2024-07-11 04:11:24 -04:00
values.emplace_back(ind.first, ind.second.fitness.adjusted_fitness);
2024-07-09 21:57:18 -04:00
std::sort(values.begin(), values.end(), [](const auto& a, const auto& b) {
2024-07-11 04:11:24 -04:00
return a.second > b.second;
2024-07-09 21:57:18 -04:00
});
for (blt::size_t i = 0; i < size; i++)
arr[i] = values[i].first;
return arr;
}
2024-07-09 21:57:18 -04:00
template<blt::size_t size>
2024-07-11 04:11:24 -04:00
auto get_best_trees()
2024-06-24 21:56:51 -04:00
{
2024-07-11 04:11:24 -04:00
return convert_array<std::array<std::reference_wrapper<tree_t>, size>>(get_best_indexes<size>(),
[this](auto&& arr, blt::size_t index) -> tree_t& {
return current_pop.get_individuals()[arr[index]].tree;
},
std::make_integer_sequence<blt::size_t, size>());
}
template<blt::size_t size>
auto get_best_individuals()
{
return convert_array<std::array<std::reference_wrapper<individual>, size>>(get_best_indexes<size>(),
[this](auto&& arr, blt::size_t index) -> individual& {
return current_pop.get_individuals()[arr[index]];
},
std::make_integer_sequence<blt::size_t, size>());
2024-06-24 21:56:51 -04:00
}
2024-07-09 21:57:18 -04:00
[[nodiscard]] bool should_terminate() const
2024-06-24 21:56:51 -04:00
{
2024-07-09 21:57:18 -04:00
return current_generation >= config.max_generations;
}
2024-07-11 21:14:23 -04:00
[[nodiscard]] bool should_thread_terminate() const
2024-07-09 21:57:18 -04:00
{
2024-07-11 21:14:23 -04:00
return should_terminate() && thread_helper.lifetime_over;
2024-06-24 21:56:51 -04:00
}
2024-07-11 21:14:23 -04:00
[[nodiscard]] random_t& get_random() const;
2024-06-29 10:47:27 -04:00
[[nodiscard]] inline type_provider& get_typesystem()
{
2024-06-21 22:04:57 -04:00
return system;
}
inline operator_id select_terminal(type_id id)
{
2024-06-29 14:03:57 -04:00
// we wanted a terminal, but could not find one, so we will select from a function that has a terminal
if (storage.terminals[id].empty())
return select_non_terminal_too_deep(id);
2024-07-11 21:14:23 -04:00
return get_random().select(storage.terminals[id]);
}
2024-06-19 14:12:04 -04:00
inline operator_id select_non_terminal(type_id id)
2024-06-19 14:12:04 -04:00
{
2024-07-11 21:14:23 -04:00
return get_random().select(storage.non_terminals[id]);
}
2024-06-29 14:03:57 -04:00
inline operator_id select_non_terminal_too_deep(type_id id)
{
2024-07-11 21:14:23 -04:00
return get_random().select(storage.operators_ordered_terminals[id]).first;
2024-06-29 14:03:57 -04:00
}
2024-06-27 03:01:39 -04:00
inline operator_info& get_operator_info(operator_id id)
{
return storage.operators[id];
}
inline detail::print_func_t& get_print_func(operator_id id)
{
return storage.print_funcs[id];
}
inline std::optional<std::string_view> get_name(operator_id id)
{
return storage.names[id];
}
inline std::vector<operator_id>& get_type_terminals(type_id id)
{
2024-06-29 10:47:27 -04:00
return storage.terminals[id];
}
inline std::vector<operator_id>& get_type_non_terminals(type_id id)
{
2024-06-29 10:47:27 -04:00
return storage.non_terminals[id];
}
inline bool is_static(operator_id id)
{
2024-06-29 10:47:27 -04:00
return storage.static_types.contains(static_cast<blt::size_t>(id));
}
2024-06-29 10:47:27 -04:00
inline void set_operations(operator_storage&& op)
{
2024-06-29 10:47:27 -04:00
storage = std::move(op);
2024-06-19 14:12:04 -04:00
}
2024-07-09 21:57:18 -04:00
[[nodiscard]] inline auto get_current_generation() const
{
2024-07-11 21:14:23 -04:00
return current_generation.load();
}
[[nodiscard]] inline auto& get_population_stats()
{
return current_stats;
}
~gp_program()
{
thread_helper.lifetime_over = true;
for (auto& thread : thread_helper.threads)
{
if (thread->joinable())
thread->join();
}
auto* cpy = thread_execution_service.load(std::memory_order_acquire);
thread_execution_service = nullptr;
delete cpy;
2024-07-09 21:57:18 -04:00
}
2024-06-19 14:12:04 -04:00
private:
2024-06-29 10:47:27 -04:00
type_provider& system;
2024-06-29 10:47:27 -04:00
operator_storage storage;
population_t current_pop;
population_stats current_stats;
population_t next_pop;
2024-07-11 21:14:23 -04:00
std::atomic_uint64_t current_generation = 0;
2024-06-29 10:47:27 -04:00
2024-07-11 21:14:23 -04:00
blt::u64 seed;
prog_config_t config;
2024-07-09 21:57:18 -04:00
2024-07-11 21:14:23 -04:00
struct concurrency_storage
{
std::vector<std::unique_ptr<std::thread>> threads;
2024-07-12 18:33:39 -04:00
//std::mutex evaluation_control;
2024-07-11 21:14:23 -04:00
std::atomic_uint64_t evaluation_left = 0;
2024-07-12 04:03:56 -04:00
std::atomic_int64_t threads_left = 0;
2024-07-11 21:14:23 -04:00
std::atomic_bool lifetime_over = false;
} thread_helper;
2024-07-11 04:11:24 -04:00
// for convenience, shouldn't decrease performance too much
std::atomic<std::function<void()>*> thread_execution_service = nullptr;
2024-07-11 04:11:24 -04:00
2024-07-09 21:57:18 -04:00
inline selector_args get_selector_args()
{
2024-07-11 21:14:23 -04:00
return {*this, next_pop, current_pop, current_stats, config, get_random()};
2024-07-09 21:57:18 -04:00
}
2024-07-11 04:11:24 -04:00
template<typename Return, blt::size_t size, typename Accessor, blt::size_t... indexes>
inline Return convert_array(std::array<blt::size_t, size>&& arr, Accessor&& accessor,
std::integer_sequence<blt::size_t, indexes...>)
2024-07-09 21:57:18 -04:00
{
2024-07-11 04:11:24 -04:00
return Return{accessor(arr, indexes)...};
}
2024-07-11 21:14:23 -04:00
void create_threads();
void evaluate_fitness_internal()
2024-07-11 04:11:24 -04:00
{
2024-07-11 21:14:23 -04:00
current_stats.clear();
if (config.threads == 1)
2024-07-11 21:14:23 -04:00
{
(*thread_execution_service)();
} else
{
{
2024-07-12 18:33:39 -04:00
//std::scoped_lock lock(thread_helper.evaluation_control);
thread_helper.evaluation_left.store(current_pop.get_individuals().size(), std::memory_order_release);
}
2024-07-12 18:33:39 -04:00
//std::cout << "Func" << std::endl;
while (thread_execution_service == nullptr)
std::this_thread::sleep_for(std::chrono::milliseconds(1));
2024-07-12 18:33:39 -04:00
//std::cout << "Wait" << std::endl;
(*thread_execution_service)();
2024-07-12 18:33:39 -04:00
//std::cout << "FINSIHED WAITING!!!!!!!! " << thread_helper.threads_left << std::endl;
while (thread_helper.threads_left > 0)
{
//std::cout << thread_helper.threads_left << std::endl;
std::this_thread::sleep_for(std::chrono::milliseconds(1));
}
2024-07-12 18:33:39 -04:00
//std::cout << "Finished" << std::endl;
2024-07-11 21:14:23 -04:00
}
current_stats.average_fitness = current_stats.overall_fitness / static_cast<double>(config.population_size);
2024-07-11 21:14:23 -04:00
/*current_stats = {};
2024-07-11 04:11:24 -04:00
for (const auto& ind : blt::enumerate(current_pop.get_individuals()))
{
fitness_function(ind.second.tree, ind.second.fitness, ind.first);
if (ind.second.fitness.adjusted_fitness > current_stats.best_fitness)
{
current_stats.best_fitness = ind.second.fitness.adjusted_fitness;
current_stats.best_individual = &ind.second;
}
if (ind.second.fitness.adjusted_fitness < current_stats.worst_fitness)
{
current_stats.worst_fitness = ind.second.fitness.adjusted_fitness;
current_stats.worst_individual = &ind.second;
}
current_stats.overall_fitness += ind.second.fitness.adjusted_fitness;
}
2024-07-11 21:14:23 -04:00
current_stats.average_fitness = current_stats.overall_fitness / static_cast<double>(config.population_size);*/
2024-07-09 21:57:18 -04:00
}
2024-06-19 14:12:04 -04:00
};
2024-06-02 21:27:00 -04:00
}
#endif //BLT_GP_PROGRAM_H