Create a surrogate discipline

We want to build an MDODiscipline based on a regression model approximating the following discipline with two inputs and two outputs:

• \(y_1=1+2x_1+3x_2\)

• \(y_2=-1-2x_1-3x_2\)

over the unit hypercube \([0,1]\times[0,1]\). For that, we use a SurrogateDiscipline relying on an MLRegressionAlgo

from __future__ import annotations

from gemseo import configure_logger
from gemseo import create_design_space
from gemseo import create_discipline
from gemseo import create_scenario
from gemseo import create_surrogate
from numpy import array

Import

configure_logger()

<RootLogger root (INFO)>

Create the discipline to learn

We can implement this analytic discipline by means of the AnalyticDiscipline class.

expressions = {"y_1": "1+2*x_1+3*x_2", "y_2": "-1-2*x_1-3*x_2"}
discipline = create_discipline(
    "AnalyticDiscipline", name="func", expressions=expressions
)

Create the input sampling space

We create the input sampling space by adding the variables one by one.

design_space = create_design_space()
design_space.add_variable("x_1", l_b=0.0, u_b=1.0)
design_space.add_variable("x_2", l_b=0.0, u_b=1.0)

Create the learning set

We can build a learning set by means of a DOEScenario with a full factorial design of experiments. The number of samples can be equal to 9 for example.

scenario = create_scenario(
    [discipline], "DisciplinaryOpt", "y_1", design_space, scenario_type="DOE"
)
scenario.execute({"algo": "fullfact", "n_samples": 9})

    INFO - 08:24:43:
    INFO - 08:24:43: *** Start DOEScenario execution ***
    INFO - 08:24:43: DOEScenario
    INFO - 08:24:43:    Disciplines: func
    INFO - 08:24:43:    MDO formulation: DisciplinaryOpt
    INFO - 08:24:43: Optimization problem:
    INFO - 08:24:43:    minimize y_1(x_1, x_2)
    INFO - 08:24:43:    with respect to x_1, x_2
    INFO - 08:24:43:    over the design space:
    INFO - 08:24:43:    +------+-------------+-------+-------------+-------+
    INFO - 08:24:43:    | name | lower_bound | value | upper_bound | type  |
    INFO - 08:24:43:    +------+-------------+-------+-------------+-------+
    INFO - 08:24:43:    | x_1  |      0      |  None |      1      | float |
    INFO - 08:24:43:    | x_2  |      0      |  None |      1      | float |
    INFO - 08:24:43:    +------+-------------+-------+-------------+-------+
    INFO - 08:24:43: Solving optimization problem with algorithm fullfact:
    INFO - 08:24:43: ...   0%|          | 0/9 [00:00<?, ?it]
    INFO - 08:24:43: ...  11%|█         | 1/9 [00:00<00:00, 295.60 it/sec, obj=1]
    INFO - 08:24:43: ...  22%|██▏       | 2/9 [00:00<00:00, 479.49 it/sec, obj=2]
    INFO - 08:24:43: ...  33%|███▎      | 3/9 [00:00<00:00, 612.61 it/sec, obj=3]
    INFO - 08:24:43: ...  44%|████▍     | 4/9 [00:00<00:00, 715.02 it/sec, obj=2.5]
    INFO - 08:24:43: ...  56%|█████▌    | 5/9 [00:00<00:00, 795.37 it/sec, obj=3.5]
    INFO - 08:24:43: ...  67%|██████▋   | 6/9 [00:00<00:00, 855.17 it/sec, obj=4.5]
    INFO - 08:24:43: ...  78%|███████▊  | 7/9 [00:00<00:00, 908.20 it/sec, obj=4]
    INFO - 08:24:43: ...  89%|████████▉ | 8/9 [00:00<00:00, 952.87 it/sec, obj=5]
    INFO - 08:24:43: ... 100%|██████████| 9/9 [00:00<00:00, 989.25 it/sec, obj=6]
    INFO - 08:24:43: Optimization result:
    INFO - 08:24:43:    Optimizer info:
    INFO - 08:24:43:       Status: None
    INFO - 08:24:43:       Message: None
    INFO - 08:24:43:       Number of calls to the objective function by the optimizer: 9
    INFO - 08:24:43:    Solution:
    INFO - 08:24:43:       Objective: 1.0
    INFO - 08:24:43:       Design space:
    INFO - 08:24:43:       +------+-------------+-------+-------------+-------+
    INFO - 08:24:43:       | name | lower_bound | value | upper_bound | type  |
    INFO - 08:24:43:       +------+-------------+-------+-------------+-------+
    INFO - 08:24:43:       | x_1  |      0      |   0   |      1      | float |
    INFO - 08:24:43:       | x_2  |      0      |   0   |      1      | float |
    INFO - 08:24:43:       +------+-------------+-------+-------------+-------+
    INFO - 08:24:43: *** End DOEScenario execution (time: 0:00:00.021530) ***

{'eval_jac': False, 'n_samples': 9, 'algo': 'fullfact'}

Create the surrogate discipline

Then, we build the Gaussian process regression model from the database and displays this model.

dataset = scenario.to_dataset(opt_naming=False)
model = create_surrogate("GaussianProcessRegressor", data=dataset)

INFO - 08:24:44: Build the surrogate discipline: GPR_DOEScenario
INFO - 08:24:44:    Dataset size: 9
INFO - 08:24:44:    Surrogate model: GaussianProcessRegressor
INFO - 08:24:44: Use the surrogate discipline: GPR_DOEScenario
INFO - 08:24:44:    Inputs: x_1, x_2
INFO - 08:24:44:    Outputs: y_1
INFO - 08:24:44:    Jacobian: use finite differences

Predict output

Once it is built, we can use it for prediction, either with default inputs

model.execute()

{'x_1': array([0.5]), 'x_2': array([0.5]), 'y_1': array([3.49999999])}

or with user-defined ones.

model.execute({"x_1": array([1.0]), "x_2": array([2.0])})

{'x_1': array([1.]), 'x_2': array([2.]), 'y_1': array([8.50166014])}