paref.moo_algorithms.two_dimensional.fill_gaps_of_pareto_front_2d#

Classes

FillGapsOfParetoFront2D([...])

Fill gaps of Pareto front in two dimensions
class paref.moo_algorithms.two_dimensional.fill_gaps_of_pareto_front_2d.FillGapsOfParetoFront2D(max_iter_minimizer: int = 100, training_iter: int = 2000, learning_rate: float = 0.05, min_required_evaluations: int = 20, min_distance_to_evaluated_points: float = 0.02)[source]#

Bases: GPRMinimizer

Fill gaps of Pareto front in two dimensions

Note

Use this algorithm if you want to fill (by middle point) the gaps between the currently found Pareto front (Pareto front of the evaluations).

Warning

The algorithm calculates an utopia point under the hood by setting it to the minimum of the components of the evaluations. If is, therefore, highly recommended to run the find edge points algorithm before applying this algorithm.

Examples

# TBA: add

Initialize the algorithms hyperparameters

Parameters:

  • max_iter_minimizer (int default 100) – maximum number of iterations of the differential evolution algorithm

  • training_iter (int default 2000) – maximum training iterations of the GPR(s)

  • learning_rate (float default 0.05) – learning rate of the training of the GPR(s)

  • min_required_evaluations (int default 20) – minimum number of evaluations required for the training (must be greater or equal than 20)

  • min_distance_to_evaluated_points (float default 2e-2) – required minimum distance to already evaluated points

property sequence_of_pareto_reflections: SequenceParetoReflections#
property supported_codomain_dimensions: int#