fitness.h

Go to the documentation of this file.

#ifndef FITNESS_H
#define FITNESS_H
 
#include <functional>
#include "../init.h"
#include "../util/utils.h"
 
using namespace nlohmann;
 
namespace Brush{
    
struct Fitness {
    // the loss is used in evolutionary functions
    
    float loss;     
    float loss_v;   
 
    unsigned int complexity;
    unsigned int linear_complexity;
    unsigned int size;
    unsigned int depth;
 
    // We store the previous values of the objectives everytime we update them.
    // This is used by the bandits to allow easy calculation of rewards.
    float prev_loss;
    float prev_loss_v;
 
    unsigned int prev_complexity;
    unsigned int prev_linear_complexity;
    unsigned int prev_size;
    unsigned int prev_depth;
 
    // these can be different depending on the island the individual is
    unsigned int dcounter;          
    vector<unsigned int> dominated; 
    unsigned int rank;              
    float crowding_dist;            
 
    // store the values and weights for the objectives
    vector<float> values;
    vector<float> weights;
 
    // weighted values
    vector<float> wvalues;
 
    void set_dominated(vector<unsigned int>& dom){ dominated=dom; };
    vector<unsigned int> get_dominated() const { return dominated; };
 
    // these setters are going to update the previous value --------------------
    void set_loss(float f){prev_loss=loss; loss=f; };
    float get_loss() const { return loss; };
    float get_prev_loss() const {return prev_loss; };
 
    void set_loss_v(float f_v){ prev_loss_v=loss_v; loss_v=f_v; };
    float get_loss_v() const { return loss_v; };
    float get_prev_loss_v() const {return prev_loss_v; };
    
    void set_size(unsigned int new_s){ prev_size=size; size=new_s; };
    unsigned int get_size() const { return size; };
    unsigned int get_prev_size() const {return prev_size; };
    
    void set_complexity(unsigned int new_c){
        prev_complexity=complexity; complexity=new_c; };
    unsigned int get_complexity() const { return complexity; };
    unsigned int get_prev_complexity() const {return prev_complexity; };
 
    void set_linear_complexity(unsigned int new_lc){
        prev_linear_complexity=linear_complexity; linear_complexity=new_lc; };
    unsigned int get_linear_complexity() const { return linear_complexity; };
    unsigned int get_prev_linear_complexity() const {return prev_linear_complexity; };
 
    void set_depth(unsigned int new_d){ prev_depth=depth; depth=new_d; };
    unsigned int get_depth() const { return depth; };
    unsigned int get_prev_depth() const { return prev_depth; };
 
    // -------------------------------------------------------------------------
 
    void set_dcounter(unsigned int d){ dcounter=d; };
    unsigned int get_dcounter() const { return dcounter; };
 
    void set_rank(unsigned r){ rank=r; };
    size_t get_rank() const { return rank; };
 
    void set_crowding_dist(float cd){ crowding_dist=cd; };
    float get_crowding_dist() const { return crowding_dist; };
 
    // Constructor with initializer list for weights
    Fitness(const vector<float>& w={}) : values(), wvalues(), weights(w) {
        dcounter = 0;
        set_rank(0);
        set_crowding_dist(0.0f);
        dominated.resize(0);
    }
    
    // Hash function (deap requires individuals (and fitness by induction)
    // to be hashable)
    size_t hash() const {
        std::size_t h = std::hash<vector<float>>{}(wvalues);
        return h;
    }
 
    void set_weights(vector<float>& w) {
        weights = w;
    }
    vector<float> get_weights() const {
        return weights;
    }
    vector<float> get_values() const {
        return values;
    }
    vector<float> get_wvalues() const {
        return wvalues;
    }
 
    // Method to set values
    void set_values(vector<float>& v) {
        if (v.size() != weights.size()) {
            throw std::length_error("Assigned values have not the same length than current values");
        }
 
        values.resize(0);
        for (const auto& element : v) {
            values.push_back(element);
        }
 
        // Minimizing/maximizing problem: negative/positive weight, respectively.
        wvalues.resize(weights.size());
 
        // Perform element-wise multiplication
        std::transform(v.begin(), v.end(), 
                       weights.begin(), wvalues.begin(),
                        [](double a, double b) {
                            return a * b;
                        });
    }
 
    // Method to clear values
    void clearValues() {
        wvalues.clear();
    }
 
    bool valid() const {
        return !wvalues.empty();
    }
 
    // Equality comparison
    bool operator==(const Fitness& other) const {
        if (wvalues.size() != other.wvalues.size()) {
            return false;
        }
        for (size_t i = 0; i < wvalues.size(); ++i)
            if (fabs(wvalues[i] - other.wvalues[i]) > 1e-6)
                return false;
                
        return true;
    }
 
    // Inequality comparison
    bool operator!=(const Fitness& other) const {
        return !(*this == other);
    }
 
    // Less than comparison
    bool operator<(const Fitness& other) const {
        // because of the weights, every objective is a maximization problem
        return !std::lexicographical_compare(wvalues.begin(), wvalues.end(),
                                            other.wvalues.begin(), other.wvalues.end());
    }
 
    // Greater than comparison
    bool operator>(const Fitness& other) const {
        return other < *this;
    }
 
    // Less than or equal to comparison
    bool operator<=(const Fitness& other) const {
        return !(other < *this);
    }
 
    // Greater than or equal to comparison
    bool operator>=(const Fitness& other) const {
        return !(*this < other);
    }
 
    // String representation
    std::string toString() const {
        // TODO: unify to_string, toString, print, print_models, etc.
        if (valid()) {
            string s = "Fitness(";
            for (auto& v : values)
                s += to_string(v) + " ";
            return s+")";
        } else {
            return "Fitness()";
        }
    }
 
    // Representation for debugging
    std::string repr() const {
        if (valid()) {
            string s = "Fitness(";
            for (auto& v : values)
                s += to_string(v) + " ";
            return s+")";
        } else {
            return "Fitness()";
        }
    }

    int dominates(const Fitness& b) const;
};
 
void to_json(json &j, const Fitness &f);
void from_json(const json &j, Fitness& f);
 
}
#endif